Advertisement

Point Pattern Matching and Corner Finding For Line Drawings

  • Hideo Ogaxtfa

Abstract

This paper proposes a robust method for matching labeled point patterns. A point pattern is partitioned into a set of triangles using the Delaunay triangulation. For the corresponding triangle pair, a consistency graph is constructed based on the pairwise compatibility between the points in the triangles. The matching is accomplished by locating the largest maximal clique of the consistency graph. A new method for detecting corners is also proposed, based on the local symmetry of a discrete curve. The corners are used as the feature points in point pattern representation and matching of the line drawings.

Keywords

Line Drawing Delaunay Triangulation Local Symmetry Point Pattern Point Pair 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Ranade and A. Rosenfeld, “Point pattern matching by relaxation,” Pattern Recognition 12, 269–275 (1980).CrossRefGoogle Scholar
  2. 2.
    S. T. Barnard and W. B. Thompson, “Disparity analysis of images,” IEEE Trans. Pattern Anal. Mach. Intell., PAMI-2, 333 - 340 (1980).Google Scholar
  3. 3.
    H. Ogawa, “Labeled point pattern matching by fuzzy relaxation,” Pattern Recognition 17, 569–573 (1984).CrossRefGoogle Scholar
  4. 4.
    U. H. Ogawa, “Labeled point pattern matching by Delaunay triangulation and maximal cliques,” Pattern Recognition 19, 35–40 (1984).CrossRefGoogle Scholar
  5. 5.
    N. Ahuja, “Dot pattern processing using Voronoi neighborhoods,” IEEE Trans. Pattern Anal. Mach. Intell., PAMI-4, 336–343 (1982).Google Scholar
  6. 6.
    R. C. Bolles, “Robust feature matching through maximal cliques,” Proc. Soc. Photo-opt. Instrum Engrs 182, 140–149 (1979).Google Scholar
  7. 7.
    A. Rosenfeld and E. Johnston, “Angle detection on digital curves,” IEEE Trans. Computers C-22, 875–878 (1973).Google Scholar
  8. 8.
    A. Rosenfeld and J. S. Weszka, “An improved method of angle detection on digital curves,” IEEE Trans. Computers C-24, 940–941 (1975).Google Scholar
  9. 9.
    H. Freeman and L. Davis, “A corner-finding algorithm for chain-coded curves,” IEEE Trans. Computers C-26, 297–303 (1977).Google Scholar
  10. 10.
    I. M. Anderson and J. C.Bezdek, “Curvature and tangential deflection of discrete arcs,” IEEE Trans. Pattern Anal. Mach. Intell., PAMI-6, 27–40 (1984).Google Scholar
  11. 11.
    T.Koyama, M. Shiono, H. Sanada and,Y. Tezuka, “Corner detection on thinned pattern,” Tech. Rep. of the Professional Group on Pattern Recognition and Learning, IECE Japan, PRL80-107, 83–90 (1980).Google Scholar
  12. 12.
    T. Matuyama, H. Yonezawa and M. Nagao, Proc. of 30th national conference, IPS of Japan, 1163–116 (1985).Google Scholar
  13. 13.
    P. J. Green and R. Sibson, “Computing Dirichlet tessellations in the plane,” Comput. J. 21, 168–173 (1977).MathSciNetGoogle Scholar

Copyright information

© Plenum Press, New York 1988

Authors and Affiliations

  • Hideo Ogaxtfa
    • 1
  1. 1.Department of ElectronicsFukui UniversityFukuiJapan

Personalised recommendations