Parallel alignment of a large number of range images

被引：14

作者：

Oishi, T ^{[1
]}

Sagawa, R ^{[1
]}

Nakazawa, A ^{[1
]}

Kurazume, R ^{[1
]}

Ikeuchi, K ^{[1
]}

机构：

[1] Univ Tokyo, Inst Ind Sci, Minato Ku, Tokyo 106, Japan

来源：

FOURTH INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS | 2003年

关键词：

D O I：

10.1109/IM.2003.1240250

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper describes a method for parallel alignment of multiple range images. It is difficult to align a large number of range images simultaneously. Therefore, we developed the parallel method to improve the time and memory performances of the alignment process. Although a general simultaneous alignment algorithm searches correspondences for all pairs of all range images by rejecting redundant dependencies, our method makes it possible to accelerate computation time and reduce the amount of memory used Since the computation between two range images can be preformed independently, each correspondence pair of range images is assigned to each node. Because the computation time is proportional to the number of vertices assigned to each node, by assigning the pairs so that the number of vertices computed is equal on each node, the load on each node is effectively distributed. The heuristic algorithms for graph partitioning are applied to this problem in order to reduce the amount of memory used on each node. The method was tested on a 16 processor PC cluster, where it demonstrated the high extendibility and the performance improvement in time and memory.

引用

页码：195 / 202

页数：8

共 26 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2] Fast global registration of 3D sampled surfaces using a multi-z-buffer technique [J].