Structure-oriented contour representation and matching for engineering shapes
Computer-Aided Design
Biological Inspired Global Descriptor for Shape Matching
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
A string matching approach for visual retrieval and classification
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
A Context Dependent Distance Measure for Shape Clustering
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Probabilistic Models of Object Geometry with Application to Grasping
International Journal of Robotics Research
Using the Particle Filter Approach to Building Partial Correspondences Between Shapes
International Journal of Computer Vision
Rotation invariant non-rigid shape matching in cluttered scenes
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Efficient partial shape matching of outer contours
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
Hand shape recognition based on coherent distance shape contexts
Pattern Recognition
Circular Cone: A novel approach for protein ligand shape matching using modified PCA
Computer Methods and Programs in Biomedicine
Contour-based shape representation using principal curves
Pattern Recognition
An evolutionary image matching approach
Applied Soft Computing
| Hi-index | 0.01 |
A common approach to determining corresponding points on two shapes is to compute the cost of each possible pairing of points and solve the assignment problem (weighted bipartite matching) for the resulting cost matrix. We consider the problem of solving for point correspondences when the shapes of interest are each defined by a single, closed contour. A modification of the standard assignment problem is proposed whereby the correspondences are required to preserve the ordering of the points induced from the shapes' contours. Enforcement of this constraint leads to significantly improved correspondences. Robustness with respect to outliers and shape irregularity is obtained by required only a fraction of feature points to be matched. Furthermore, the minimum matching size may be specified in advance. We present efficient dynamic programming algorithms to solve the proposed optimization problem. Experiments on the Brown and MPEG-7 shape databases demonstrate the effectiveness of the proposed method relative to the standard assignment problem.