Regularized partial matching of rigid shapes

Alexander M. Bronstein, Michael M. Bronstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationComputer Vision - ECCV 2008 - 10th European Conference on Computer Vision, Proceedings
PublisherSpringer Verlag
Pages143-154
Number of pages12
EditionPART 2
ISBN (Print)3540886850, 9783540886853
DOIs
StatePublished - 2008
Externally publishedYes
Event10th European Conference on Computer Vision, ECCV 2008 - Marseille, France
Duration: 12 Oct 200818 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5303 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th European Conference on Computer Vision, ECCV 2008
Country/TerritoryFrance
CityMarseille
Period12/10/0818/10/08

Fingerprint

Dive into the research topics of 'Regularized partial matching of rigid shapes'. Together they form a unique fingerprint.

Cite this