Sparse Representations for Efficient Shape Matching

Graph matching is a fundamental problem with many applications in computer vision. Patterns are represented by graphs and pattern recognition corresponds to finding a correspondence between vertices from different graphs. In many cases, the problem can be formulated as a quadratic assignment problem, where the cost function consists of two components: a linear term representing the vertex compatibility and a quadratic term encoding the edge compatibility. The quadratic assignment problem is NP-hard and the present paper extends the approximation technique based on graph matching and efficient belief propagation, described in a previous work, by using sparse representations for efficient shape matching. Successful results of recognition of 3D objects and handwritten digits are illustrated, using COIL and MNIST datasets, respectively.

[1]  Rogério Schmidt Feris,et al.  Shape classification through structured learning of matching measures , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[2]  Roberto Marcondes Cesar Junior,et al.  A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching , 2009, CIARP.

[3]  Daniel P. Huttenlocher,et al.  Efficient Belief Propagation for Early Vision , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[4]  Yair Weiss,et al.  Correctness of Local Probability Propagation in Graphical Models with Loops , 2000, Neural Computation.

[5]  Haibin Ling,et al.  Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[7]  Simon Haykin,et al.  GradientBased Learning Applied to Document Recognition , 2001 .

[8]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[9]  Pedro F. Felzenszwalb.  Representation and detection of deformable shapes , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[10]  Sebastian Thrun,et al.  The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces , 2004, NIPS.

[11]  Hiroshi Murase,et al.  Visual learning and recognition of 3-d objects from appearance , 2005, International Journal of Computer Vision.

[12]  Terry Caelli,et al.  Graphical models for graph matching: Approximate models and optimal algorithms , 2005, Pattern Recognit. Lett..

[13]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[14]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.

[15]  Sven J. Dickinson,et al.  Canonical Skeletons for Shape Matching , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[16]  Alexander J. Smola,et al.  Learning Graph Matching , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Vladimir Kolmogorov,et al.  Feature Correspondence Via Graph Matching: Models and Global Optimization , 2008, ECCV.