Not only size matters: Regularized partial matching of nonrigid shapes

Alexander M. Bronstein, Michael M. Bronstein

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

Abstract

Partial matching is probably one of the most challenging problems in nonrigid shape analysis. The problem consists of matching similar parts of shapes that are dissimilar on the whole and can assume different forms by undergoing nonrigid deformations. Conceptually, two shapes can be considered partially matching if they have significant similar parts, with the simplest definition of significance being the size of the parts. Thus, partial matching can be defined as a multcriterion optimization problem trying to simultaneously maximize the similarity and the size of these parts. In this paper, we propose a different definition of significance, taking into account the regularity of parts besides their size. The regularity term proposed here is similar to the spirit of the Mumford-Shah functional. Numerical experiments show that the regularized partial matching produces semantically better results compared to the non-regularized one.

Original languageEnglish
Title of host publication2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops - Anchorage, AK, United States
Duration: 23 Jun 200828 Jun 2008

Publication series

Name2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops

Conference

Conference2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops
Country/TerritoryUnited States
CityAnchorage, AK
Period23/06/0828/06/08

Fingerprint

Dive into the research topics of 'Not only size matters: Regularized partial matching of nonrigid shapes'. Together they form a unique fingerprint.

Cite this