Circular shortest path in images (2003) [9 citations — 2 self]
Abstract:
Abstract — Shortest path algorithms have been used in a number of applications such as crack detection, road or linear feature extraction in images. There are applications where the starting and ending positions of the shortest path need to be constrained. In this paper, we present several new algorithms for the extraction of a circular shortest path in an image such that the starting and ending positions coincide. The new algorithms we developed include multiple search algorithm, image patching algorithm, multiple backtracking algorithm, the combination of image patching and multiple back-tracking algorithm, and approximate algorithm. The typical running time of our circular shortest path extraction algorithm on a 256×256 image is about 0.3 seconds on a rather slow 85MHz Sun SPARC computer. A variety of real images for crack detection in borehole data, object boundary extraction, and panoramic stereo matching have been tested and good results have been obtained.
Citations
| 117 | Shortest paths algorithms: theory and experimental evaluation – Cherkassky, Goldberg, et al. - 1996 |
| 65 | Disparity-space images and large occlusion stereo – Intille, Bobick - 2002 |
| 49 | Shortest Paths Algorithms – Gallo, Pallottino - 1988 |
| 42 | Fast stereo matching using rectangular subregioning and 3d maximum-surface techniques, IJCV – Sun - 2002 |
| 12 | Regularised shortest-path extraction – Buckley, Yang - 1997 |
| 9 | Experiments with symmetrized intensity-based dynamic programming algorithms for reconstructing digital terrain model – Gimel’farb, Krot, et al. - 1992 |
| 6 | A dynamic programming algorithm for binocular stereo vision – Lloyd - 1985 |
| 4 | Diatom identification: a double challenge called ADIAC – Buf, Bayer, et al. - 1999 |
| 3 | Dijkstra’s two-tree shortest path algorithm – Helgason, Kennington, et al. - 1988 |
