CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2006 vol.28 Issue No.10 - October
Issue No.10 - October (2006 vol.28)
Daniel Cremers , IEEE
Anthony J. Yezzi , IEEE
Stefano Soatto , IEEE
For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing integral operations. While such integral invariants enjoy some of the desirable properties of their differential counterparts, such as locality of computation (which allows matching under occlusions) and uniqueness of representation (asymptotically), they do not exhibit the noise sensitivity associated with differential quantities and, therefore, do not require presmoothing of the input shape. Our formulation allows the analysis of shapes at multiple scales. Based on integral invariants, we define a notion of distance between shapes. The proposed distance measure can be computed efficiently and allows warping the shape boundaries onto each other; its computation results in optimal point correspondence as an intermediate step. Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise. As a quantitative analysis, we report matching scores for shape retrieval from a database.
Integral invariants, shape, shape matching, shape distance, shape retrieval.
Siddharth Manay, Daniel Cremers, Byung-Woo Hong, Anthony J. Yezzi, Stefano Soatto, "Integral Invariants for Shape Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 10, pp. 1602-1618, October 2006, doi:10.1109/TPAMI.2006.208