Regularized Partial Matching of Rigid Shapes

Authors:
Alexander M. Bronstein;Michael M. Bronstein
Affiliations:
Technion --- Israel Institute of Technology, Haifa, Israel 32000;Technion --- Israel Institute of Technology, Haifa, Israel 32000
Venue:
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Year:
2008

Citing 0
Cited 5

Full and Partial Symmetries of Non-rigid Shapes

International Journal of Computer Vision
Affine puzzle: realigning deformed object fragments without correspondences

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
A correspondence-less approach to matching of deformable shapes

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Putting the pieces together: regularized multi-part shape matching

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
Enhanced pose normalization and matching of non-rigid objects based on support vector machine modelling

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show a rigorous approach allowing to find matching parts of rigid shapes with controllable size and regularity. The regularity term we use is similar to the spirit of the Mumford-Shah functional, extended to non-Euclidean spaces. Numerical experiments show that the regularized partial matching produces better results compared to the non-regularized one.