This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
Not only size matters: Regularized partial matching of nonrigid shapes
Anchorage, AK, USA
June 23-June 28
ISBN: 978-1-4244-2339-2
Alexander M. Bronstein, Department of Computer Science, Technion ' Israel Institute of Technology, Haifa 32000, Israel
Michael M. Bronstein, Department of Computer Science, Technion ' Israel Institute of Technology, Haifa 32000, Israel
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.
Citation:
Alexander M. Bronstein, Michael M. Bronstein, "Not only size matters: Regularized partial matching of nonrigid shapes," cvprw, pp.1-6, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
Usage of this product signifies your acceptance of the Terms of Use.