New prospects in line detection by dynamic programming

The detection of lines in satellite images has drawn a lot of attention within the last 15 years. Problems of resolution, noise, and image understanding are involved, and one of the best methods developed so far is the F* algorithm of Fischler, which achieves robustness, rightness, and rapidity. Like other methods of dynamic programming, it consists of defining a cost which depends on local information; then a summation-minimization process in the image is performed. The authors present herein a mathematical formalization of the F* algorithm, which allows them to extend the cost both to cliques of more than two points (to deal with the contrast), and to neighborhoods of size larger than one (to take into account the curvature). Thus, all the needed information (contrast, grey-level, curvature) is synthesized in a unique cost function defined on the digital original image. This cost is used to detect roads and valleys in satellite images (SPOT)