Effective nearest neighbor search for aligning and merging range images

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

Volumn 2003-January, Issue , 2003, Pages 54-61

  Sagawa, R ^a   Masuda, T ^b   Ikeuchi, K ^b  

^a OSAKA UNIVERSITY   (Japan)

^b INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Algorithm design and analysis; Binary trees; Computational efficiency; Image analysis; Merging; Multidimensional systems; Nearest neighbor searches; Partitioning algorithms; Performance analysis; Testing

Indexed keywords

BINARY TREES; COMPUTATIONAL EFFICIENCY; IMAGE ANALYSIS; MERGING; SEARCH ENGINES; TESTING; TREES (MATHEMATICS);

ALGORITHM DESIGN AND ANALYSIS; LOGARITHMIC TIME; MULTIDIMENSIONAL SYSTEMS; NEAREST NEIGHBORS; PARTITIONING ALGORITHMS; PERFORMANCE ANALYSIS; SEARCH ALGORITHMS; THRESHOLD-VALUE;

NEAREST NEIGHBOR SEARCH;

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

References (21)

1. J. L Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
2. P.J. Besl and N.D. McKay. A method for registration of 3-d shapes. IEEE Trans. Patt. Anal. Machine Intell., 14(2):239-256, Feb 1992.
3. A. Califano and R. Mohan. Multidimensional indexing for recognizing visual shapes. IEEE Trans. Pattern Analysis and Machine Intelligence, 16:373-392, 1994.
4. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In Proc. SIGGRAPH'96, pages 303-312. ACM, 1996.
5. Cyra Technologies, Inc. http://www.cyra.com.
6. J.H. Friedman, J. Bentley, and R. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, 1977.
7. Volker Gaede and Oliver Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170-231, 1998.
8. M. Greenspan and G. Godin. A nearest neighbor method for efficient ICP. In Proc. 3DIM, pages 161-168, 2001.
9. A. Guttman. R-trees: A dynamic index struc- ture for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-54, 1984.
10. A. Hilton, A.J. Stoddart, J. Illingworth, and T. Windeatt. Reliable surface reconstruction from multiple range images. In Proceedings of European Conference on Computer Vision, pages 117-126, Springer-Verlag, 1996.
11. D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. ACM Trans. Database Systems, 15(4):625-658, 1990.
12. W. Lorensen and H. Cline. Marching cubes: a high resolution 3d surface construction algorithm. In Proc. SIGGRAPH'87, pages 163-170. ACM, 1987.
13. T. Masuda, K. Sakaue, and N. Yokoya. Registration and integration of multiple range images for 3-d model constuction. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pages 879-883, June 1996.
14. MINOLTA Co. Ltd. Vivid 900 non-contact digitizer. http://www.minoltausa.com/vivid/.
15. S.A. Nene and S.K. Nayar. A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. Pattern Analysis and Machine Intelligence, 19(9):989-1003, 1997.
16. K. Pulli. Multiview registration for large data sets. In Second Int. Conf. on 3D Digital Imaging and Modeling, pages 160-168, Oct 1999.
17. J. T. Robinson. The k-d-b tree: A search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 10-18, 1984.
18. H Samet. The quadtree and related hierarchical data structure. ACM Computing Surveys, 16(2):187-260, 1984.
19. D. A. Simon, M. Hebert, and T. Kanade. Realtime 3-d pose estimation using a high speed range sensor. In Proc. ICRA, pages 2235-2241, 1994.
20. Mark D. Wheeler. Automatic Modeling and Localization for Object Recognition. PhD thesis, School of Computer Science, Carnegie Mellon University, 1996.
21. Haim J. Wolfson and Isidore Rigoutsos. Geometric hashing: An overview. IEEE Computational Science & Engineering, 4(4):10-21, 1997.