Advertisement

Minimizing the topological structure of line images

  • Walter G. Kropatsch
  • Mark Burge
Structural Matching and Grammatical Inference
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1451)

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.

Keywords

Dual Graph Line Image Information Preserve Iconic Representation Contour Representation 
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

  1. [1]
    H. Blum and R. N. Nagel. Shape description using weighted symmetric axis features. Pattern Recognition, 10(3):167–180, 1978.CrossRefGoogle Scholar
  2. [2]
    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.CrossRefGoogle Scholar
  3. [3]
    H. Freeman. Computer processing of line drawing images. Surveys, 6(1):57–97, March 1974.CrossRefGoogle Scholar
  4. [4]
    L. O'Gorman. Primitives chain code. In Computer Vision and Image Processing, pages 167–183, 1992.Google Scholar
  5. [5]
    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.CrossRefGoogle Scholar
  6. [6]
    O. Hori and D. S. Doermann. Quantitative measurement of the performance of raster-to-vector conversion algorithms. GRMA95, pages 57–68, 1996.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.CrossRefGoogle Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    Dieter Willersinn and Walter G. Kropatsch. Dual graph contraction for irregular pyramids. In 12th IAPR, volume Ill, pages 251–256. IEEE, 1994.Google Scholar
  13. [13]
    P. Meer, C.A. Sher, and A. Rosenfeld. The chain pyramid: Hierarchical contour processing. PAMI, 12(4):363–376, April 1990.Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    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.Google Scholar
  16. [16]
    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.Google Scholar
  17. [17]
    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/Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Walter G. Kropatsch
    • 1
  • Mark Burge
    • 2
  1. 1.Institute of Automation 183/2, Pattern Recognition and Image Processing GroupVienna University of TechnologyWienAustria
  2. 2.Institute of Systems Science, Computer Vision LaboratoryJohannes Kepler UniversityLinzAustria

Personalised recommendations