Issue No. 04 - April (1996 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.491623
<p><b>Abstract</b>—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 <it>F</it>* 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. We present herein a mathematical formalization of the <it>F</it>* algorithm, which allows us 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).</p>
Line detection, energy minimization, dynamic programming, curvature, satellite images.
J. Zerubia and N. Merlet, "New Prospects in Line Detection by Dynamic Programming," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 18, no. , pp. 426-431, 1996.