Flexible Syntactic Matching of Curves and its Application to Automatic Hierarchical Classification of Silhouettes (0)
by
Yoram Gdalyahu
,
Daphna Weinshall
| Venue: | IEEE Transactions on Pattern Analysis and Machine Intelligence |
| Citations: | 91 - 2 self |
BibTeX
@ARTICLE{Gdalyahu_flexiblesyntactic,
author = {Yoram Gdalyahu and Daphna Weinshall},
title = {Flexible Syntactic Matching of Curves and its Application to Automatic Hierarchical Classification of Silhouettes},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {},
volume = {21},
pages = {1312--1328}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Curve matching is one instance of the fundamental correspondence problem. Our exible algorithm is designed to match curves under substantial deformations and arbitrary large scaling and rigid transformations. A syntactic representation is constructed for both curves, and an edit transformation which maps one curve to the other is found using dynamic programming. We present extensive...
