Circular shortest paths by branch and bound

Pattern Recognition

Volumn 36, Issue 11, 2003, Pages 2513-2520

  Appleton, Ben ^a   Sun, Changming ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b CSIRO   (Australia)

Author keywords

Branch and Bound; Circular shortest path; Dynamic programming

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; OPTIMIZATION; TRANSPORTATION;

SHORTEST PATHS;

PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 0141638424     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(03)00122-5     Document Type: Article

References (17)

1. Cherkassky B.V. Goldberg A.V. Radzik T. Shortest paths algorithms: Theory and experimental evaluation Math. Programming 73 2 1996 129-174
2. Buckley M. Yang J. Regularised shortest-path extraction Pattern Recognition Lett. 18 7 1997 621-629
3. Barzohar M. Cooper D.B. Automatic finding of main roads in aerial images by using geometric-stochastic models and estimation IEEE Trans. Pattern Anal. Mach. Intell. 18 7 1996 707-721
4. Merlet N. Zerubia J. New prospects in line detection by dynamic programming IEEE Trans. Pattern Anal. Mach. Intell. 18 4 1996 426-431
5. Ohta Y. Kanade T. Stereo by intra- and inter-scanline search using dynamic programming IEEE Trans. Pattern Anal. Mach. Intell. 7 2 1985 139-154
6. Lloyd S.A. Stereo matching using intra- and inter-row dynamic programming Pattern Recognition Lett. 4 1986 273-277
7. Sun C. Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques Internat. J. Comput. Vision 47 1/2/3 2002 99-117
8. Bamford P. Lovell B. Unsupervised cell nucleus segmentation with active contours Signal Processing (Special Issue: Deformable models and techniques for image and signal processing) 71 2 1988 203-213
9. I.H. Jermyn, H. Ishikawa, Globally optimal regions and boundaries, in: Proceedings of the Seventh IEEE International Conference on Computer Vision, Kerkyra, Greece, September 1999, pp. 904-910.
10. C. Sun, S. Peleg, Fast panoramic stereo matching using cylindrical maximum surfaces, IEEE Trans. Systems Man Cybernet. Part B, 34 (2004) to appear.
11. Sun C. Pallottino S. Circular shortest path in images Pattern Recognition 36 3 2003 709-719
12. C. Sun, S. Pallottino, Circular shortest path on regular grids, in: Asian Conference on Computer Vision, Melbourne, Australia, January 22-25, 2002, pp. 852-857.
13. Dijkstra E. A note on two problems in connexion with graphs Numer. Math. 1 1959 269-271
14. Gallo G. Pallottino S. Shortest path algorithms Ann. Oper. Res. 13 1988 3-79
15. Winston P.H. Artificial Intelligence 1984 Addison-Wesley Reading, MA
16. W. Zhang, R. Korf, An average-case analysis of branch-and-bound with applications: Summary of results, in: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI-92, San Jose, CA, July 1992, pp. 545-550.
17. Hoare C.A.R. Quicksort Comput. J. 5 1 1962 10-15