Abstract
We present a new algorithm based on Dual Graph Contraction (DGC) to transform the Run Graph into its Minimum Line Property Preserving (MLPP) form which, when implemented in parallel, requires O(log(longestcurve)) steps. A MLPP graph of a line image compliments the structural information in geometric graph representations like the run graph. Using such a graph and its dual, line image analysis systems can efficiently detect topological features like loops and holes and make use of relations like containment.
This work was supported by the Austrian Science Foundation grant S7002-MAT
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Blum and R. N. Nagel. Shape description using weighted symmetric axis features. Pattern Recognition, 10(3):167–180, 1978.
L. Lam, S. W. Lee, and C. Y. Suen. Thinning methodologies: A comprehensive survey. IEEE Trans. Pattern Analysis and Machine Intelligence, 14(9):869–885, September 1992.
H. Freeman. Computer processing of line drawing images. Surveys, 6(1):57–97, March 1974.
L. O'Gorman. Primitives chain code. In Computer Vision and Image Processing, pages 167–183, 1992.
P. Zhu and P. M. Chirlian. On critical-point detection of digital shapes. IEEE Trans. Pattern Analysis and Machine Intelligence, 17(8):737–748, August 1995.
O. Hori and D. S. Doermann. Quantitative measurement of the performance of raster-to-vector conversion algorithms. GRMA95, pages 57–68, 1996.
A. K. Aggarwal and A. V. Kulkarni. A sequential approach to the extraction of shape features. Comp. Graph. and Image Proc., 6(6):538–557, December 1977.
T. Pavlidis. A minimum storage boundary tracing algorithm and its application to automatic inspection. IEEE Trans. Systems, Man, and Cybernetics, 8(1):66–69, January 1978.
L. Boatto, V. Consorti, M. C. Buono, S. DiZenzo, V. Eramo, A. Melcarne, M. Meucci, A. Morelli, M. Mosciatti, S. Scarci, and M. Tucci. An interpretation system for land register maps. Computer, 25(7):25–33, July 1992.
M. Burge and W. Kropatsch. Contracting line images using run graphs. In 22th Workshop of the Austrian Association for Pattern Recognition. ÖAGM, R. Oldenbourg Verlag, 1998.
G. Monagan and M. Röösli. Appropriate Base Representation Using a Run Graph. In Proceedings of the Second International Conf. on Document Analysis and Recognition, pages 623–626, Tsukuba, Japan, October 20–22, 1993. IAPR, IEEE Computer Society Press.
Dieter Willersinn and Walter G. Kropatsch. Dual graph contraction for irregular pyramids. In 12th IAPR, volume Ill, pages 251–256. IEEE, 1994.
P. Meer, C.A. Sher, and A. Rosenfeld. The chain pyramid: Hierarchical contour processing. PAMI, 12(4):363–376, April 1990.
Walter G. Kropatsch and Dieter Willersinn. Parallel line grouping in irregular curve pyramids. In Proceedings Computer Vision and Pattern Recognition — CVPR'93, pages 784–785. IEEE Comp.Soc.Press, 1993.
W. G. Kropatsch. Property Preserving Hierarchical Graph Transformations. In Carlo Arcelli, Luigi P. Cordella, and Gabriella Sanniti di Baja, editors, Advances in Visual Form Analysis, pages 340–349. World Scientific Publishing Company, 1998.
Jean-Michel Jolion and Annick Montanvert. The adaptive pyramid, a framework for 2D image analysis. Computer Vision, Graphics and Image Processing, 55(3):pp.339–348, May 1992.
W. G. Kropatsch, M. Burge, S. Ben Yacoub, and N. Selmaoui. Dual graph contraction with leda. Computing, Supplementum: Graph Based Representations in Pattern Recognition, To Appear, 1998. Online at http://www.cast.unilinz.ac.at/Vision/papers/tcl5-97/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kropatsch, W.G., Burge, M. (1998). Minimizing the topological structure of line images. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033233
Download citation
DOI: https://doi.org/10.1007/BFb0033233
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive