Abstract
The extraction and interpretation of networks of lines from images yields important organizational information of the network under consideration. In this paper, a one-parameter algorithm for the extraction of line networks from images is presented. The parameter indicates the extracted saliency level from a hierarchical graph. Input for the algorithm is the domain specific knowledge of interconnection points. Graph morphological tools are used to extract the minimum cost graph which best segments the network.
We give an extensive error analysis for the general case of line extraction. Our method is shown to be robust against gaps in lines, and against spurious vertices at lines, which we consider as the most prominent source of error in line detection. The method indicates detection confidence, thereby supporting error proof interpretation of the network functionality. The method is demonstrated to be applicable on a broad variety of line networks, including dashed lines. Hence, the proposed method yields a major step towards general line tracking algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ausma, J., Wijfels, M., Thoné, F., Wouters, L., Allessie, M., and Borgers, M. 1997. Structural changes of atrial myocardium due to sustained atrial fibrillation in the goat. Circulation, 96:3157-3163.
Barzohar, M. and Cooper, D. 1993. Automatic finding of main roads in aerial images by using geometric-stochastic models and estimation. In IEEE Conference on Computer Vision and Pattern Recognition, NewYork, NY, June 15–17, 1993. Computer Society Press: Washington, DC, pp. 459-464.
Bellman, R.E. 1957. Dynamic Programming. Princeton University Press: Princeton, NJ.
Beltrami, C.A., Finato, N., Rocco, M., Feruglio, G.A., Puricelli, C., Cigola, E., Quaini, F., Sonnenblick, E.H., Olivetti, G., and Anversa, P. 1994. Structural basis of end-stage failure in ischemic cardiomyopathy in humans. Circulation, 89:151-163.
Beucher, S. and Meyer, F. 1993. The morphological approach to segmentation: The watershed transformation. In Mathematical Morphology in Image Processing, E.R. Dougherty (Ed.). Marcel Dekker: New York, Ch. 12, pp. 433-481.
Buckley, M. and Talbot, H. 2000. Flexible linear openings and closings. In Mathematical Morphology and its Applications to Image and Signal Processing, J. Goutsias, L. Vincent, and D.S. Bloomberg (Eds.). Kluwer Academic Publishers: Dordrecht, The Netherlands.
Cohen, L.D. and Kimmel, R. 1997. Global minimum for active contour models: A minimal path approach. Int. J. Computer Vision, 24:57-78.
Florack, L.M.J., Romeny, B.M.t.H., Koenderink, J.J., and Viergever, M.A. 1992. Scale and the differential structure of images. Image and Vision Computing, 10(6):376-388.
Illingworth, J. and Kittler, J. 1988. A Survey of the Hough transform. Computer Vision, Graphics, Image Process., 44:87-116.
Koenderink, J.J. 1984. The Structure of images. Biol. Cybern., 50:363-370.
Kong, B., Phillips, I.T., Haralick, R.M., Prasad, A., and Kasturi, R. 1996. A bench mark: Performance evaluation of dashed-line detection algorithms. In Graphics Recognition Methods and Applications, R. Kasturi and K. Tombre (Eds.). Springer-Verlag: Berlin, pp. 270-285.
Lindeberg, T. 1994. Scale-Space Theory in Computer Vision. Kluwer Academic Publishers: Boston.
Lorenz, C., Carlsen, I.C., Buzug, T.M., Fassnacht, C., and Weese, J. 1998. Scale Space Theories in Computer Vision. Springer-Verlag: Berlin, pp. 152-163.
Meyer, F. 1994. Topographic distance and watershed lines. Signal Processing, 38:113-125.
Sethian, J.A. 1996. A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. USA, 93:1591-1595.
Sha'ashua, A. and Ullman, S. 1988. Structural saliency: The detection of globally salient structures using a locally connected network. In Second International Conference on Computer Vision Tampa, FL, December 5–8, 1988. Computer Society Press: Washington, DC, pp. 321-327.
Steger, C. 1998. Anunbiased detector of curvillinear structures. IEEE Trans. Pattern Anal. Machine Intell., 20:113-125.
ter Haar Romeny, B.M. (Ed.). 1994. Geometry-Driven Diffusion in Computer Vision. Academic Publishers: Boston.
Vincent, L. 1989. Graphs and mathematical morphology. Signal Processing, 16:365-388.
Vincent, L. 1998. Minimal path algorithms for the robust detection of linear features in gray images. In Mathematical Morphology and its Applications to Image and Signal Processing, H. Heijmans and J. Roerdink (Eds.). Kluwer Academic Publishers: Dordrecht, The Netherlands, pp. 331-338.
Vliegen, H.W., van der Laarse, A., Huysman, J.A.N., Wijnvoord, E.C., Mentar, M., Cornelisse, C.J., Eulderink, F. 1987. Morphometric quantification of myocyte dimensions validated in normal growing rat hearts and applied to hypertrophic human hearts. Cardiovasc. Res., 21:352-357.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Geusebroek, JM., Smeulders, A.W. & Geerts, H. A Minimum Cost Approach for Segmenting Networks of Lines. International Journal of Computer Vision 43, 99–111 (2001). https://doi.org/10.1023/A:1011118718821
Issue Date:
DOI: https://doi.org/10.1023/A:1011118718821