Parallel alignment of a large number of range images

Proceedings of International Conference on 3-D Digital Imaging and Modeling, 3DIM

Volumn 2003-January, Issue , 2003, Pages 195-202

  Oishi, T ^a   Nakazawa, A ^b   Sagawa, R ^b   Kurazume, R ^c   Ikeuchi, Katsushi ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

Acceleration; Clustering algorithms; Distributed computing; Geometrical optics; Heuristic algorithms; Iterative closest point algorithm; Laser modes; Mean square error methods; Merging; Surface emitting lasers

Indexed keywords

ACCELERATION; ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GEOMETRICAL OPTICS; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; LASER MODES; MEAN SQUARE ERROR; MERGING; SURFACE EMITTING LASERS;

COMPUTATION TIME; GRAPH PARTITIONING; ITERATIVE CLOSEST POINT ALGORITHM; MEAN SQUARE ERROR METHOD; MEMORY PERFORMANCE; PARALLEL ALIGNMENTS; PARALLEL METHOD; SIMULTANEOUS ALIGNMENT;

CLUSTERING ALGORITHMS;

EID: 11244348844     PISSN: 15506185     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IM.2003.1240250     Document Type: Conference Paper

References (27)

1. K. Ikeuchi and Y. Sato, Modeling from Reality, Kluwer Academic Press, 2001.
2. K. Ikeuchi, Modeling from Reality, In Proc. Third International Conference on 3D Digital Imaging and Modeling (3DIM), Quebec City, Canada. May 28-June 1, 2001
3. M. Levoy et al. The Digital Michelangelo Project. In Proc. SIGGRAPH 2000, pp.131-144.
4. Greg Turk and Marc Levoy. Zippered polygon meshes from range images. In Proc. SIGGRAPH '94, pp. 311-318. ACM, 1994.
5. Curless, B., Levoy,M., A Volumetric Method for Building Complex Models from Range Images, In Proc. SIGGRAPH '96, ACM, 1996, pp. 303-312.
6. M. Wheeler, Y. Sato, and K. Ikeuchi, Consensus surfaces for modeling 3D objects from multiple range images, In Proc. IEEE International Conference on Computer Vision, pp.917-923, Jan, 1997.
7. R. Sagawa, K. Nishino, K. Ikeuchi, "Robust and Adaptive Integration of Multiple Range Images with Photometric Attributes", In Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol.2, pp.172-179, 2001
8. P. J. Besl and N. D. McKay, A method for registration of 3-D shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2) 1992, 239-256.
9. Y. Chen and G. Medioni, Object modeling by registration of multiple range images, Image and Vision Computing 10(3), 1992, 145-155.
10. Blais, G. and Levine, M. "Registering Multiview Range Data to Create 3D Computer Objects," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 17, No. 8, 1995.
11. T. Masuda, K. Sakaue, and N. Yokoya, Registration and Integration of Multiple Range Images for 3-D Model Construction. In Proc. Computer Society Conference on Computer Vision and Pattern Recognition, 1996.
12. P. J. Neugebauer. Reconstruction of Real-World Objects via Simultaneous Registration and Robust Combination of Multiple Range Images. International Journal of Shape Modeling, 3(1&2):71-90, 1997.
13. R. Bergevin, M. Soucy, H. Gagnon, and D. Laurendeau. To-wards a general multi-view registration technique. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(5):540-547, May 1996.
14. R. Benjemaa and F. Schmitt. Fast global registration of 3d sampled surfaces using a multi-z-buffer technique. In Proc. Int. Conf. on Recent Advances in 3-D Digital Imaging and Modeling, pages 113-120, May 1997.
15. Z. Zhang. Iterative point matching for registration of free-form curves and surfaces. International Journal of Computer Vision, 13(2):119-152, 1994.
16. David A. Simon, Martial Hebert, and Takeo Kanade. Realtime 3-D pose estimation using a high-speed range sensor. In IEEE Intl. Conf. Robotics and Automation, pages 2235-2241,San Diego, California, May 8-13 1994.
17. Langis, C., Greenspan, M., and Godin, G.. The parallel iterative closest point algorithm. In Proc. International Conference on 3D Digital Imaging and Modeling (3DIM), Quebec City, Quebec. May 28-June 1, 2001.
18. M. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: Freeman, 1979.
19. Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11(3):430-452, 1990.
20. L. Hagen, A. B. Kahng, "New Spectral Methods for Ratio Cut Partitioning and Clustering", IEEE Transactions on Computer-Aided Design, Vol. 11, No. 9, pp. 1074-1085, September, 1992.
21. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998.
22. S. Hauck and G. Borriello, "An Evaluation of Bipartitioning Techniques", IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, Vol. 16, No. 8, pp. 849-866, August 1997.
23. A. George and J. W.-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981.
24. B. W. Kernighan, S. Lin, "An Efficient Heuristic Procedure for Partitioning of Electrical Circuits", Bell Systems Technical Journal, Vol. 49, No. 2, pp. 291-307, February 1970.
25. C. M. Fiduccia, R. M. Mattheyses, "A Linear-Time Heuristic for Improved Network Partitions", Design Automation Conference, pp. 241-247, 1982.
26. B. Krishnamurthy, "An Improved Min-Cut Algorithm for Partitioning VLSI Networks", IEEE Transactions on Computers, Vol. C-33, No. 5, pp. 438-446, May 1984.
27. http://www.cyra.com.