CAJ | 학술논문

常见的三维距离变换算法大都是对城市街区、棋盘等二维近似欧氏距离变换算法的三维扩展,得到的依然是近似欧氏距离.提出一种新的三维欧氏距离变换算法,可以得到完全欧氏距离,时间复杂度为O(n3logn).将该算法应用于三维医学CT图像内部软组织的显示,取得了较好的效果.
상견적삼유거리변환산법대도시대성시가구、기반등이유근사구씨거리변환산법적삼유확전,득도적의연시근사구씨거리.제출일충신적삼유구씨거리변환산법,가이득도완전구씨거리,시간복잡도위O(n3logn).장해산법응용우삼유의학CT도상내부연조직적현시,취득료교호적효과.
Most existing algorithms of three-dimensional distance transformare 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(n3*log n). Moreover, this method is used to render the soft tissue in three-dimensional medical CT images, and good result has been obtained.