|
[1] P. J. Besl and N. D. McKay, “Method for registration of 3-d shapes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 2, pp. 239–256, 1992. [2] K. S. Arun, T. S. Haung, and S. D. Blostein, “Least-squares fitting of two 3-d point sets,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, pp. 698–700, 1987. [3] G. Turk and M. Levoy, “Zippered polygon meshes from range images,” in Proceedings of the 21st annual conference on Computer graphics and interactive techniques, SIGGRAPH ’94, pp. 311–318, 1994. [4] Y. Chen and G. Medioni, “Object modelling by registration of multiple range images,” Image and Vision Computing, vol. 10, no. 3, pp. 145–155, 1992. [5] A. E. Johnson and S. B. Kang, “Registration and integration of textured 3-d data,” in IMAGE AND VISION COMPUTING, pp. 234–241, 1996. [6] A. D. Brett, A. Hill, and C. J. Taylor, “A method of 3d surface correspondence and interpolation for merging shape examples,” Image and Vision Computing, vol. 17, no. 6, pp. 635–642, 1999. [7] C. S. Chen, Y. P. Hung, and J. B. Cheng, “Ransac-based darces: a new approach to fast automatic registration of partially overlapping range images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 1229–1234, 1999. [8] C. Schütz, “Geometric matching for free-form 3d object recognition,” in Proceeds of Asian Conference on Computer Vision, pp. 1–6, 1995. [9] J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Proceeding of the ACM, vol. 18, no. 9, pp. 509–517, 1975. [10] B. Siemiątkowska and A. Zychewicz, “The application of icp and sift algorithms for mobile robot localization,” ROMANSY 18 Robot Design, Dynamics and Control, vol. 524, pp. 391–398, 2010. [11] H. Bay, T. Tuytelaars, and L. V. Gool, “Surf: Speeded up robust features,” 9th European Conference on Computer Vision, vol. 3951, pp. 404–417, 2006. [12] C. Harris and M. Stephens, “A combined corner and edge detector. in: Proceedings of the alvey vision conference,” Proceedings of the Alvey Vision Conference, pp. 404–417, 1998. [13] T. Jost and H. Hugli, “A multi-resolution scheme icp algorithm for fast shape registration,” in Proceedings of 3D Data Processing Visualization and Transmission, pp. 540–543, 2002. [14] R. Benjemaa and F. Schmitt, “Fast global registration of 3d sampled surfaces using a multi-z-buffer technique,” Image and Vision Computing, vol. 17, pp. 113–123, 1999. [15] S. J. Horng, “Constant time algorithm for template matching on a reconfigurable array of processors,” The Computer Jurnal, vol. 17, pp. 113–123, 1993. [16] H. R. Tsaia, S. J. Hornga, S. S. Tsaia, S. S. Leeb, T. W. Kaoc, and C. H. Chend, “Optimal speed-up parallel image template matching algorithms on processor arrays with a reconfigurable bus system,” Computer Vision and Image Understanding, vol. 71, pp. 393–412, 1998. [17] A. Chariot and R. Keriven, “Gpu-boosted online image matching,” in International Conference on Pattern Recognition, pp. 1–4, 2008. [18] S. W. Yang, C. C. Wang, and C. H. Chang, “Ransac matching: Simultaneous registration and segmentation,” in IEEE International Conference on Robotics and Automation, pp. 1905–1912, 2010.
|