Approximate tree matching and shape similarity

Tyng Luh Liu, Davi Geiger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Conference on Computer Vision
PublisherIEEE
Pages456-462
Number of pages7
Volume1
StatePublished - 1999
EventProceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99) - Kerkyra, Greece
Duration: Sep 20 1999Sep 27 1999

Other

OtherProceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99)
CityKerkyra, Greece
Period9/20/999/27/99

Fingerprint

Stretching
Costs

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Software

Cite this

Liu, T. L., & Geiger, D. (1999). Approximate tree matching and shape similarity. In Proceedings of the IEEE International Conference on Computer Vision (Vol. 1, pp. 456-462). IEEE.

Approximate tree matching and shape similarity. / Liu, Tyng Luh; Geiger, Davi.

Proceedings of the IEEE International Conference on Computer Vision. Vol. 1 IEEE, 1999. p. 456-462.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, TL & Geiger, D 1999, Approximate tree matching and shape similarity. in Proceedings of the IEEE International Conference on Computer Vision. vol. 1, IEEE, pp. 456-462, Proceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99), Kerkyra, Greece, 9/20/99.
Liu TL, Geiger D. Approximate tree matching and shape similarity. In Proceedings of the IEEE International Conference on Computer Vision. Vol. 1. IEEE. 1999. p. 456-462
Liu, Tyng Luh ; Geiger, Davi. / Approximate tree matching and shape similarity. Proceedings of the IEEE International Conference on Computer Vision. Vol. 1 IEEE, 1999. pp. 456-462
@inproceedings{7a88a877358d492096830bc595f85e8c,
title = "Approximate tree matching and shape similarity",
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.",
author = "Liu, {Tyng Luh} and Davi Geiger",
year = "1999",
language = "English (US)",
volume = "1",
pages = "456--462",
booktitle = "Proceedings of the IEEE International Conference on Computer Vision",
publisher = "IEEE",

}

TY - GEN

T1 - Approximate tree matching and shape similarity

AU - Liu, Tyng Luh

AU - Geiger, Davi

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033284591&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033284591&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033284591

VL - 1

SP - 456

EP - 462

BT - Proceedings of the IEEE International Conference on Computer Vision

PB - IEEE

ER -