Circular shortest paths by branch and bound
- 30 November 2003
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 36 (11), 2513-2520
- https://doi.org/10.1016/s0031-3203(03)00122-5
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Fast Panoramic Stereo Matching Using Cylindrical Maximum SurfacesIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface TechniquesInternational Journal of Computer Vision, 2002
- Globally optimal regions and boundariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Unsupervised cell nucleus segmentation with active contoursSignal Processing, 1998
- Regularised shortest-path extractionPattern Recognition Letters, 1997
- Automatic finding of main roads in aerial images by using geometric-stochastic models and estimationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- New prospects in line detection by dynamic programmingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Stereo matching using intra- and inter-row dynamic programmingPattern Recognition Letters, 1986
- Stereo by Intra- and Inter-Scanline Search Using Dynamic ProgrammingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1985