• DocumentCode
    344062
  • Title

    Approximate tree matching and shape similarity

  • Author

    Liu, Tyng-Luh ; Geiger, Davi

  • Author_Institution
    Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan
  • Volume
    1
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    456
  • Abstract
    We present a framework for 2D shape contour (silhouette) comparison that can account for stretchings, occlusions and region information. Topological changes due to the original 3D scenarios and articulations are also addressed. To compare the degree of similarity between any two shapes, our approach is to represent each shape contour with a free tree structure derived from a shape axis (SA) model, which we have recently proposed. We then use a tree matching scheme to find the best approximate match and the matching cost. To deal with articulations, stretchings and occlusions, three local tree matching operations, merge, cut, and merge-and-cut, are introduced to yield optimally approximate matches, which can accommodate not only one-to-one but many-to-many mappings. The optimization process gives guaranteed globally optimal match efficiently. Experimental results on a variety of shape contours are provided
  • Keywords
    image matching; image representation; merging; optimisation; trees (mathematics); 2D shape contour comparison; 3D scenarios; approximate tree matching; cut; experimental results; merging; occlusion; optimization; region information; shape axis model; shape similarity; stretching; topological changes; Costs; Dynamic programming; Electrical capacitance tomography; Energy measurement; Information science; Read only memory; Shape measurement; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on
  • Conference_Location
    Kerkyra
  • Print_ISBN
    0-7695-0164-8
  • Type

    conf

  • DOI
    10.1109/ICCV.1999.791256
  • Filename
    791256