Circular shortest path in images

Pattern Recognition

Volumn 36, Issue 3, 2003, Pages 709-719

  Sun, Changming ^a   Pallottino, Stefano ^b  

^a CSIRO   (Australia)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Approximate algorithm; Circular shortest path; Combination algorithm; Dynamic programming; Image patching algorithm; Multiple backtracking algorithm; Multiple search algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CRACKS; IMAGE ANALYSIS;

SHORTEST PATH ALGORITHMS;

FEATURE EXTRACTION;

ALGORITHM; CRACK; IMAGE PROCESSING;

EID: 0036522750     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(02)00085-7     Document Type: Article

References (11)

1. Shortest path algorithms
2. Shortest paths algorithms: Theory and experimental evaluation
3. Regularised shortest-path extraction
4. Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques
5. Disparity-space images and large occlusion stereo
6. Experiments withsymmetrized intensity-based dynamic programming algorithms for reconstructing digital terrain model
7. A dynamic programming algorithm for binocular stereo vision
8. Diatom identification: A double challenge called ADIAC