摘要
常见的三维距离变换算法大都是对城市街区、棋盘等二维近似欧氏距离变换算法的三维扩展 ,得到的依然是近似欧氏距离 .提出一种新的三维欧氏距离变换算法 ,可以得到完全欧氏距离 ,时间复杂度为 O(n3 logn) .将该算法应用于三维医学 CT图像内部软组织的显示 ,取得了较好的效果 .
Most existing algorithms of three dimensional distance transform are extensions of two dimensional approximate Euclidean distance transform algorithms such as the city block/chessboard. Such algorithms can only get the approximate Euclidean distance. A new method of three dimensional true Euclidean distance transform is presented in this paper. The proposed method can get the true Euclidean distance with time complexity O(n 3 · log n ) . Moreover, this method is used to render the soft tissue in three dimensional medical CT images, and good result has been obtained.
出处
《软件学报》
EI
CSCD
北大核心
2001年第3期383-389,共7页
Journal of Software
基金
国家自然科学基金资助项目!(6 98430 0 1)
国家 86 3高科技发展计划资助项目!(86 3- 30 6 - ZD0 4- 0 6 - 4)&&