Skull Registration Using Rigid Super-Curves

This research presents an algorithm, Rigid Super Curves (RSC), to solve the problem of registering two sets of digitized skulls data under a rigid transformation using crest lines. The method that restitutes the rigid transformation between two sets of fully matched curves is propounded. RSC exploits the non-ambiguity of B-Spline representation of super-curves whilst overcoming the inability of super-curves to restore rigid transformations. A further contribution of this study is a two-stage algorithm based on RSC which registers two sets of partially matched curves under a rigid transformation. The algorithm improves the robustness over feature based methods by considering the structure rather than individual points of the curve. Experimental results on CT scanned skull data show that proposed algorithm is more robust and accurate at restoring the rigid transformation between two sets of crest line data compared with Iterated Closest Point and Super Curves methods.

[1]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[2]  Luc Van Gool,et al.  Matching of 3-D curves using semi-differential invariants , 1995, Proceedings of IEEE International Conference on Computer Vision.

[3]  F.M. Wahl,et al.  3D B-spline curve matching for model based object recognition , 1997, Proceedings of International Conference on Image Processing.

[4]  Rachid Deriche,et al.  2-D curve matching using high curvature points: application to stereo vision , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[5]  Nicholas Ayache,et al.  New developments on geometric hashing for curve matching , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Irene Y. H. Gu,et al.  Efficient planar object tracking and parameter estimation using compactly represented cubic B-spline curves , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[7]  Eam Khwang Teoh,et al.  A novel 2D shape matching algorithm based on B-spline modeling , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[8]  Behrooz Kamgar-Parsi,et al.  Matching Sets of 3D Line Segments with Application to Polygonal Arc Matching , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Bede Liu,et al.  Image registration by "Super-curves" , 2004, IEEE Transactions on Image Processing.

[10]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[11]  Daphna Weinshall,et al.  Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  J. Thirion,et al.  The 3D marching lines algorithm and its application to crest lines extraction , 1992 .

[13]  Ronen Basri,et al.  Curve Matching Using the Fast Marching Method , 2003, EMMCVPR.

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

[15]  Zhengwei Yang,et al.  Invariant matching and identification of curves using B-splines curve representation , 1995, IEEE Trans. Image Process..

[16]  Christopher J. Taylor,et al.  3D point distribution models of the cortical sulci , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[17]  K. S. Arun,et al.  Least-Squares Fitting of Two 3-D Point Sets , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Alexis Gourdon,et al.  The 3D Marching Lines Algorithm , 1996, CVGIP Graph. Model. Image Process..

[19]  Zhengwei Yang,et al.  Curve recognition using B-spline representation , 1992, [1992] Proceedings IEEE Workshop on Applications of Computer Vision.

[20]  D. Cakmakov,et al.  Shape matching of digital curves , 2005, ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005..

[21]  Kevin Buchin,et al.  Exact algorithms for partial curve matching via the Fréchet distance , 2009, SODA.