Shapes as empirical distributions

We address the problem of shape based classification. We interpret the shape of an object as a probability distribution governing the location of the points of the object. An image of the object, represented as an arbitrary set of unlabeled points, corresponds to a random drawing from the shape probability distribution and can thus be analyzed as an empirical distribution. Using this framework, classification of shapes is robust to the number of points in the image and there is no need to solve the correspondence problem when comparing two images. The framework allows us to estimate geometrical transformations between images in a statistically meaningful way using maximum likelihood. We formulate the decision problem associated with shape classification as a hypothesis test for which we can characterize the performance. We particularize this framework to two-dimensional shapes related by an affine transformation. Under this assumption, we develop a descriptor invariant to affine movement, permutations, and sampling density, and robust to noise, occlusion, and reasonable non-linear deformations. Experimental results demonstrate the quality of our approach.

[1]  Tony Jebara,et al.  Images as bags of pixels , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[2]  João Paulo Costeira,et al.  A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Whoi-Yul Kim,et al.  Fast and efficient method for computing ART , 2006, IEEE Transactions on Image Processing.

[4]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  José M. F. Moura,et al.  LASIC: A model invariant framework for correspondence , 2008, 2008 15th IEEE International Conference on Image Processing.

[6]  David G. Kendall,et al.  Shape & Shape Theory , 1999 .

[7]  R. Fisher The Advanced Theory of Statistics , 1943, Nature.

[8]  Mireille Boutin,et al.  Faithful Shape Representation for 2D Gaussian Mixtures , 2007, 2007 IEEE International Conference on Image Processing.

[9]  José M. F. Moura,et al.  Affine-permutation invariance of 2-D shapes , 2005, IEEE Transactions on Image Processing.

[10]  T. K. Carne,et al.  Shape and Shape Theory , 1999 .

[11]  João M. F. Xavier,et al.  Classification of unlabeled point sets using ANSIG , 2008, 2008 15th IEEE International Conference on Image Processing.

[12]  Anand Rangarajan,et al.  A new algorithm for non-rigid point matching , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[13]  Takeo Kanade,et al.  An Iterative Image Registration Technique with an Application to Stereo Vision , 1981, IJCAI.

[14]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.