The processing of three-dimensional (3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision fields. The distance transform (DT) is extensively applied in the imag...
详细信息
ISBN:
(纸本)0780378407
The processing of three-dimensional (3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision fields. The distance transform (DT) is extensively applied in the image processing and computer vision areas as a key operation. In a two or three-dimensional image array, the computation of distance transform (DT) is an important task, With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. In order to provide the efficient transform computations, parallelism is employed. We develop parallel algorithms for the three-dimensional Euclidean distance transform (3D-EDT) on the simd hypercube computer. The time complexity of our parallel algorithm is O{log(2) N} for an N x N x N image array using N-3 processors. A generalized parallel algorithm for the 3D-EDT is also proposed and it runs O((N/p)(3) log(N) + (N/p)(2) log(2) p) time for an N x N x N binary image array on the simd hypercube computer using p(3) PE's, where 1 less than or equal to p less than or equal to N.
The processing of three-dimensional(3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision *** distance transform(DT) is extensively applied in the image proc...
详细信息
The processing of three-dimensional(3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision *** distance transform(DT) is extensively applied in the image processing and computer vision areas as a key operation. In a two or three-dimensional image array,the computation of distance transform(DT) is an important task. With the increasing application of 3D voxel images,it is useful to consider the distance transform of a 3D digital image *** order to provide the efficient transform computations, parallelism is *** develop parallel algorithms for the three-dimensional Euclidean distance transform (3D-EDT) on the simdhypercube *** time complexity of our parallel algorithm is O(log N) for an N×JV×N image array using JV3 processors.A generalized parallel algorithm for the 3D-EDT is also proposed and it runs O((N/p) log(N) +(N/p) log p) time for an N×N×N binary image array on the simd hypercube computer using p PE's,where 1≤p≤N.
暂无评论