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 experiments, where we apply the algorithm to silhouette matching. In these experiments we examine partial occlusion, viewpoint variation, articulation, and class matching (where silhouettes of similar objects are matched). Based on the qualitative syntactic matching we dene a dissimilarity measure, and we compute it for every pair of images in a database of 121 images. We use this experiment to objectively evaluate our algorithm: First, we compare our results to those reported by others. Second, we use the dissimilarity values in order to organize the image database into shape categories. The veridical hierarchical organization stands as evidence to the quality of our matching and similarity estimation. 1
|
2996
|
Pattern Classification and Scene Analysis
– Duda, Hart
- 1973
|
|
1681
|
Introduction to statistical pattern recognition
– Fukunaga
- 1972
|
|
986
|
Normalized Cuts and Image Segmentation
– Shi, Malik
- 2000
|
|
527
|
Features of similarity
– Tversky
|
|
309
|
Comparing images using the hausdorff distance
– Huttenlocher, Klanderman, et al.
- 1993
|
|
164
|
An efficient computable metric for comparing polygonal shapes
– Arkin, Chew, et al.
|
|
154
|
Object recognition using alignment
– Huttenlocher, Ullman
- 1987
|
|
146
|
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
– Wu, Leahy
- 1993
|
|
143
|
Pairwise data clustering by deterministic annealing
– Hofmann, Buhmann
- 1997
|
|
136
|
Modal matching for correspondence and recognition
– Sclaroff, Pentland
- 1995
|
|
135
|
The curvature primal sketch
– Asada, Brady
|
|
129
|
Shock graphs and shape matching
– Siddiqi, Shokoufandeh, et al.
- 1999
|
|
128
|
A.: Scale-based description and recognition of planar curves and two-dimensional shapes
– Mokhtarian, Mackworth
- 1986
|
|
123
|
Dynamic programming for detecting, tracking and matching deformable contours
– Geiger, Gupta, et al.
- 1995
|
|
117
|
Petrou, Structural Matching in Computer VisionUsing Probabilistic Relaxation
– Christmas, Kittler, et al.
- 1995
|
|
112
|
Matching hierarchical structures using association graphs
– Pelillo, Siddiqi, et al.
- 1999
|
|
98
|
Visual Image Retrieval by Elastic Matching of User Sketches
– Bimbo, Pala
- 1997
|
|
92
|
Recognizing and locating partially visible objects: the local feature-focus method
– Bolles, Chan
- 1982
|
|
73
|
Stereo Correspondence Through Feature Grouping and Maximal Cliques
– Horaud, Skordas
- 1989
|
|
71
|
Determining the similarity of deformable shapes
– Basri, Costa, et al.
- 1998
|
|
65
|
Tracking points on deformable objects using curvature information
– Cohen, Ayachi, et al.
- 1992
|
|
49
|
Comparing images using the hausdor distance
– Huttenlocher, Klanderman, et al.
- 1993
|
|
45
|
Matching Images to Models for Registration and Object Detection via Clustering
– Stockman, Kopstein, et al.
- 1982
|
|
44
|
Eytan Domany. Data clustering using a model granular magnet
– Blatt, Wiseman
- 1997
|
|
43
|
Shape Matching Using Relaxation Techniques
– Davis
- 1976
|
|
42
|
Computation of normalized edit distance and applications
– Marzal, Vidal
- 1995
|
|
40
|
Indexing using a spectral encoding of topological structure
– Shokoufandeh, Dickinson, et al.
- 1999
|
|
35
|
Parameterized point pattern matching and its application to recognition of object families
– Umeyama
- 1993
|
|
33
|
Matching: invariant to translations, rotations and scale changes
– Li
- 1992
|
|
32
|
Model matching for correspondence and recognition
– Sclaroff, Pentland
|
|
28
|
Similarity and affine invariant distances between 2d point sets
– Werman, Weinshall
- 1995
|
|
24
|
Partial shape recognition: a landmark-based approach
– Ansari, Delp
- 1989
|
|
24
|
Learning visual models from shape contours using multiscale convex/concave structure matching
– Ueda, Suzuki
- 1993
|
|
23
|
Shape Matching of TwoDimensional Objects
– Bhanu, Faugeras
- 1984
|
|
22
|
M.: On view likelihood and stability
– Weinshall, Werman
- 1997
|
|
21
|
Partial shape recognition using dynamic programming
– Gorman, Mitchell
- 1988
|
|
21
|
Attributive string matching with merging for shape recognition
– TSAI, S
- 1985
|
|
21
|
A shape analysis model with applications to a character recognition system
– Rocha, Pavlidis
- 1994
|
|
19
|
RH: Cluster Monte Carlo Algorithms
– Wang, Swendsen
- 1990
|
|
18
|
Partial shape classification using contour matching in distance transformation
– Liu, Srinath
- 1990
|
|
15
|
Stochastic image segmentation by typical cuts
– Gdalyahu, Weinshall, et al.
- 1999
|
|
14
|
Feature based correspondence: An Eigenvector Approach
– Shapiro, Brady
- 1992
|
|
13
|
Dynamic programming alignment of sequences representing cyclic patterns
– Gregor, Thomason
- 1993
|
|
12
|
Using polygon to recognize and locate partially occluded objects
– Koch, Kashyap
- 1987
|
|
12
|
Optimal correspondence of string subsequences
– Wang, Pavlidis
- 1990
|
|
11
|
Dubes, "Algorithms for Clustering Data
– Jain, C
- 1988
|
|
10
|
ψ − s correlation and dynamic time warping: two methods for tracking ice floes in sar images
– McConnell, Kwok, et al.
- 1991
|
|
9
|
Affine Invariant Model Based Object Recognition
– Lamdan, Schwartz, et al.
- 1988
|
|
9
|
Condensing image databases when retrieval is based on non-metric distances
– Jacobs, Weinshall, et al.
- 1998
|
|
6
|
Shape matching using polygon approximation and dynamic alignment
– Lu, Dunham
- 1993
|
|
