期刊文献+

基于样条曲线的CT牙列图像齿间轮廓重构的研究

Rebuilding Invisible Boundaries between Adjoing Teeth from CT Images based on Spline Curves
在线阅读 下载PDF
导出
摘要 为了重构出相邻齿断面由于密度高度一致,造成在CT图像中丢失的边界轮廓线,先在已提取的牙列整体连续外轮廓上,根据切矢方向的变化,确定出相邻齿廓线的交汇点;再分别以两个相邻交汇点为端点,其间的轮廓点为型值点,构建标准B样条曲线作为部分齿廓线;然后,分别求出相邻齿廓线在交汇点处的一阶导矢,进而求出该交汇点处的平均导矢;最后,以两两相对的交汇点为端点,构建Hermit样条插值曲线,该曲线即作为相邻齿间被丢失的轮廓线。用该方法可以成功地对两颗牙齿进行边界区分,进而提取轮廓,以达到对单颗牙齿进行三维重建,在仿真上能满足临床要求,为后续的牙颌仿真工作奠定了基础。 For reconstructing the contours, which are invisible in CT images due to high identity in the density value, between adjoining teeth, we presented a simple, and feasible method: first, the intersecting points, which were formed by the adjoining contours being parts of outer continuous contour extracted from a tooth-array cross-section in a CT image, were found out according to the saltation of the tangent vector directions on the points. Second, a B-spline, as the representation of a piece of outer contour, was built with two neighboring intersection-points as the end-points, and the outer-contour points as the interpolating points. Third, the one-order derivatives of two adjoining B-splines at common end-point were resolved respectively, and then a mean derivative at the point was computed. Finally, cubic Hermit curves, as the replace of invisible contours between adjoining teeth, were built with a pairs of the opposite intersecting point as end-points. Using this method to determine the edge of the adjoin teeth, and further to reconstruct 3D teeth based on the contours rebuilt with the method mentioned above has proven a satisfying result.
出处 《生物医学工程研究》 2009年第1期28-30,34,共4页 Journal Of Biomedical Engineering Research
基金 国家自然科学基金资助项目(30770559) 山东省教育厅科技攻关项目(J07TJ20)
关键词 B样条曲线 CT图像 轮廓线 重构 插值曲线 三维重建 交汇 外轮廓 Tooth contour CT image of tooth-array Contour extracting Spline curves, 3D reconstruction
  • 相关文献

参考文献5

二级参考文献29

  • 1王小鹏,罗进文.基于形态学梯度重建的分水岭分割[J].光电子.激光,2005,16(1):98-101. 被引量:37
  • 2刘扬,黄庆明,高文,叶齐祥.自适应高斯混合模型球场检测算法及其在体育视频分析中的应用[J].计算机研究与发展,2006,43(7):1207-1215. 被引量:18
  • 3Mansouri A R, Konrad J. Motion segmentation with level sets[J].In:Proc IEEE International Conference Image Processing (ICIP),1999,(2): 126-130.
  • 4Suri J S, Liu Kecheng, Singh S. Shape recovery algorithms using level sets in 2-D/3-D medical imagery[J]. IEEE Trans Information Technology in Biomedical, 2002,6(4):8-28.
  • 5Suri J S. Leaking prevention in fast level sets using fuzzy models:An application in MR brain [J]. In: Proc International Conference Information Technology Biomedicine, 2000,11:220-226.
  • 6"Internet Brain Segmentation Repository (IBSR),"Center for Morphometric Analysis (CMA). Available: http:∥neurowww. mgh.harvard.edu/cma/ibsr. http:∥www.bic.mni.mcgill.ca/.
  • 7Setbian J A. An analysis of flame propagation[D]. Ph.D. dissertatio n, Dept. Math., Univ. California, Berkeley, CA, 1982.
  • 8Sethian J A. Level Set Methods and Fast Marching Methods: Evol ving Interfaces in Computational Geometry, Fluid Mechanics,Computer Vision and Material Science[J]. London. Cambridge University Press, 1999.
  • 9Osher S, and Sethian J A. Fronts propagating with curvature-depe ndent speed: Algorithms based on Hamiltons-Jacobi formulations[J].Journal of Computational Physics, 1988,79(1):12-49.
  • 10Caselles V, Kimmel R, Sapiro G. Geodesic active contours[J].International Journal of Computer Vision, 1997,22(1):61-79.

共引文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部