Trainable method of parametric shape description
Image and Vision Computing - Special issue: BMVC 1991
ACM Transactions on Graphics (TOG)
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using the Inner-Distance for Classification of Articulated Shapes
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Similarity of Objects, or How to Compare a Centaur to a Horse
International Journal of Computer Vision
Representation and detection of deformable shapes
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Object detection by contour segment networks
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Describing and matching 2d shapes by their points of mutual symmetry
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
A boundary-fragment-model for object detection
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Robust contour matching via the order-preserving assignment problem
IEEE Transactions on Image Processing
Using partial edge contour matches for efficient object category localization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Highly consistent sequential segmentation
SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Using diagonals of orthogonal projection matrices for affine invariant contour matching
Image and Vision Computing
Perceptually motivated shape context which uses shape interiors
Pattern Recognition
Hi-index | 0.00 |
This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape description. An efficient integral image based implementation of the matching step is introduced which allows detecting partial matches an order of magnitude faster than comparable methods. We further show how the proposed algorithm is used to calculate a global optimal Pareto frontier to define a partial similarity measure between shapes. Shape retrieval experiments on standard shape databases like MPEG-7 prove that state-of-the-art results are achieved at reduced computational costs.