Local Shape Registration Using Boundary-Constrained Match of Skeletons

This paper presents a new shape registration algorithm that establishes "meaningful correspondence " between objects, in that it preserves the local shape correspondence between the source and target objects. By observing that an object's skeleton corresponds to its local shape peaks, we use skeleton to characterize the local shape of the source and target objects. Unlike traditional graph-based skeleton matching algorithms that focus on matching skeletons alone and ignore the overall alignment of the boundaries, our algorithm is formulated in a variational framework which aligns local shape by registering two potential fields that are associated with skeletons. Also, we add a boundary constraint term to the energy functional, such that our algorithm can be applied to match bulky objects where skeleton and boundary are far away to each other. To increase the robustness of our algorithm, we incorporate M-estimator and dynamic pruning algorithm to form a feedback system that eliminates local shape outliers caused by nonrigid deformation, occlusion, and missing parts. Experiments on 2D binary shapes and 3D cardiac sequences validate the accuracy and robustness of this algorithm.

[1]  Kaleem Siddiqi,et al.  Ligature instabilities in the perceptual organization of shape , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[2]  Nikos Paragios,et al.  Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration , 2002, ECCV.

[3]  W. Eric L. Grimson,et al.  Fixed topology skeletons , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[4]  Stefano Soatto,et al.  Integral Invariant Signatures , 2004, ECCV.

[5]  James S. Duncan,et al.  Point-tracked quantitative analysis of left ventricular surface motion from 3-D image sequences , 2000, IEEE Transactions on Medical Imaging.

[6]  James N. Damon,et al.  Determining the Geometry of Boundaries of Objects from Medial Data , 2005, International Journal of Computer Vision.

[7]  James S. Duncan,et al.  Estimating 3D Strain from 4D Cine-MRI and Echocardiography: In-Vivo Validation , 2000, MICCAI.

[8]  Alexandru Telea,et al.  An Augmented Fast Marching Method for Computing Skeletons and Centerlines , 2002, VisSym.

[9]  Aly A. Farag,et al.  Robust centerline extraction framework using level sets , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  Kaleem Siddiqi,et al.  Shapes, shocks and wiggles , 1999, Image Vis. Comput..

[11]  Joon Hee Han,et al.  A curvature-based approach to contour motion estimation , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[12]  Ronen Basri,et al.  Shape Representation and Classification Using the Poisson Equation , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Andrea Torsello,et al.  Matching hierarchical structures for shape recognition , 2004 .

[14]  Benjamin B. Kimia,et al.  Symmetry-Based Indexing of Image Databases , 1998, J. Vis. Commun. Image Represent..

[15]  Ali Shokoufandeh,et al.  Shock Graphs and Shape Matching , 1998, International Journal of Computer Vision.

[16]  Stefano Soatto,et al.  Shape Representation based on Integral Kernels: Application to Image Matching and Segmentation , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[17]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.