A fast 3D correspondence method for statistical shape Modeling

被引:0
作者
Dalal, Pahal [1 ]
Munsell, Brent C. [1 ]
Wang, Song [1 ]
Tang, Jijun [1 ]
Oliver, Kenton [1 ]
Ninomiya, Hiroaki [2 ]
Zhou, Xiangrong [2 ]
Fujita, Hiroshi [2 ]
机构
[1] Univ South Carolina, Dept Comp Engn & Sci, Columbia, SC 29208 USA
[2] Gifu Univ, Grad Sch Med, Div Regenerat & Adv Med Sci, Dept Intelligent Image Informat, Gifu, Japan
来源
2007 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-8 | 2007年
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this landmark-based shape-correspondence problem for 3D cases by developing a highly efficient landmark-sliding algorithm. This algorithm is able to quickly refine all the landmarks in a parallel fashion by sliding them on the 3D shape surfaces. We use 3D thin-plate splines to model the shape-correspondence error so that the proposed algorithm is invariant to affine transformations and more accurately reflects the nonrigid biological shape deformations between different shape instances. In addition, the proposed algorithm can handle both open- and closed-surface shape, while most of the current 3D shape-correspondence methods can only handle genus-0 closed surfaces. We conduct experiments on 3D hippocampus data and compare the performance of the proposed algorithm to the state-of-the-art MDL and SPHARM methods. We find that, while the proposed algorithm produces a shape correspondence with a better or comparable quality to the other two, it takes substantially less CPU time. We also apply the proposed algorithm to correspond 3D diaphragm data which have an open-surface shape.
引用
收藏
页码:1322 / +
页数:3
相关论文
共 35 条