Parallel alignment of a large number of range images

T. Oishi, A. Nakazawa, R. Sagawa, Ryo Kurazume, Katsushi Ikeuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)

Abstract

We describe 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.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003
PublisherIEEE Computer Society
Pages195-202
Number of pages8
Volume2003-January
ISBN (Electronic)0769519911
DOIs
Publication statusPublished - Jan 1 2003
Event4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003 - Banff, Canada
Duration: Oct 6 2003Oct 10 2003

Other

Other4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003
CountryCanada
CityBanff
Period10/6/0310/10/03

Fingerprint

Data storage equipment
Heuristic algorithms

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Computer Vision and Pattern Recognition

Cite this

Oishi, T., Nakazawa, A., Sagawa, R., Kurazume, R., & Ikeuchi, K. (2003). Parallel alignment of a large number of range images. In Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003 (Vol. 2003-January, pp. 195-202). [1240250] IEEE Computer Society. https://doi.org/10.1109/IM.2003.1240250

Parallel alignment of a large number of range images. / Oishi, T.; Nakazawa, A.; Sagawa, R.; Kurazume, Ryo; Ikeuchi, Katsushi.

Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003. Vol. 2003-January IEEE Computer Society, 2003. p. 195-202 1240250.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oishi, T, Nakazawa, A, Sagawa, R, Kurazume, R & Ikeuchi, K 2003, Parallel alignment of a large number of range images. in Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003. vol. 2003-January, 1240250, IEEE Computer Society, pp. 195-202, 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003, Banff, Canada, 10/6/03. https://doi.org/10.1109/IM.2003.1240250
Oishi T, Nakazawa A, Sagawa R, Kurazume R, Ikeuchi K. Parallel alignment of a large number of range images. In Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003. Vol. 2003-January. IEEE Computer Society. 2003. p. 195-202. 1240250 https://doi.org/10.1109/IM.2003.1240250
Oishi, T. ; Nakazawa, A. ; Sagawa, R. ; Kurazume, Ryo ; Ikeuchi, Katsushi. / Parallel alignment of a large number of range images. Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003. Vol. 2003-January IEEE Computer Society, 2003. pp. 195-202
@inproceedings{1a4c2558c8084ced9534809ead7bd8d7,
title = "Parallel alignment of a large number of range images",
abstract = "We describe 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.",
author = "T. Oishi and A. Nakazawa and R. Sagawa and Ryo Kurazume and Katsushi Ikeuchi",
year = "2003",
month = "1",
day = "1",
doi = "10.1109/IM.2003.1240250",
language = "English",
volume = "2003-January",
pages = "195--202",
booktitle = "Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003",
publisher = "IEEE Computer Society",
address = "United States",

}

TY - GEN

T1 - Parallel alignment of a large number of range images

AU - Oishi, T.

AU - Nakazawa, A.

AU - Sagawa, R.

AU - Kurazume, Ryo

AU - Ikeuchi, Katsushi

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We describe 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.

AB - We describe 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.

UR - http://www.scopus.com/inward/record.url?scp=11244348844&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11244348844&partnerID=8YFLogxK

U2 - 10.1109/IM.2003.1240250

DO - 10.1109/IM.2003.1240250

M3 - Conference contribution

AN - SCOPUS:11244348844

VL - 2003-January

SP - 195

EP - 202

BT - Proceedings - 4th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003

PB - IEEE Computer Society

ER -