期刊文献+

High speed robust image registration and localization using optimized algorithm and its performances evaluation 被引量:13

High speed robust image registration and localization using optimized algorithm and its performances evaluation
下载PDF
导出
摘要 Local invariant algorithm applied in downward-looking image registration,usually computes the camera's pose relative to visual landmarks.Generally,there are three requirements in the process of image registration when using these approaches.First,the algorithm is apt to be influenced by illumination.Second,algorithm should have less computational complexity.Third,the depth information of images needs to be estimated without other sensors.This paper investigates a famous local invariant feature named speeded up robust feature(SURF),and proposes a highspeed and robust image registration and localization algorithm based on it.With supports from feature tracking and pose estimation methods,the proposed algorithm can compute camera poses under different conditions of scale,viewpoint and rotation so as to precisely localize object's position.At last,the study makes registration experiment by scale invariant feature transform(SIFT),SURF and the proposed algorithm,and designs a method to evaluate their performances.Furthermore,this study makes object retrieval test on remote sensing video.For there is big deformation on remote sensing frames,the registration algorithm absorbs the Kanade-Lucas-Tomasi(KLT) 3-D coplanar calibration feature tracker methods,which can localize interesting targets precisely and efficiently.The experimental results prove that the proposed method has a higher localization speed and lower localization error rate than traditional visual simultaneous localization and mapping(vSLAM) in a period of time. Local invariant algorithm applied in downward-looking image registration,usually computes the camera's pose relative to visual landmarks.Generally,there are three requirements in the process of image registration when using these approaches.First,the algorithm is apt to be influenced by illumination.Second,algorithm should have less computational complexity.Third,the depth information of images needs to be estimated without other sensors.This paper investigates a famous local invariant feature named speeded up robust feature(SURF),and proposes a highspeed and robust image registration and localization algorithm based on it.With supports from feature tracking and pose estimation methods,the proposed algorithm can compute camera poses under different conditions of scale,viewpoint and rotation so as to precisely localize object's position.At last,the study makes registration experiment by scale invariant feature transform(SIFT),SURF and the proposed algorithm,and designs a method to evaluate their performances.Furthermore,this study makes object retrieval test on remote sensing video.For there is big deformation on remote sensing frames,the registration algorithm absorbs the Kanade-Lucas-Tomasi(KLT) 3-D coplanar calibration feature tracker methods,which can localize interesting targets precisely and efficiently.The experimental results prove that the proposed method has a higher localization speed and lower localization error rate than traditional visual simultaneous localization and mapping(vSLAM) in a period of time.
机构地区 School of Astronautics
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第3期520-526,共7页 系统工程与电子技术(英文版)
基金 supported by the National Natural Science Foundation of China (60802043) the National Basic Research Program of China(973 Program) (2010CB327900)
关键词 local invariant features speeded up robust feature(SURF) Harris corner Kanada-Lucas-Tomasi(KLT) transform Coplanar camera calibration algorithm landmarks. local invariant features,speeded up robust feature(SURF),Harris corner,Kanada-Lucas-Tomasi(KLT) transform,Coplanar camera calibration algorithm,landmarks.
  • 相关文献

参考文献14

  • 1D. G. Lowe. Distinctive image Ieatures lrom scale-invanant keypoints. International Journal of Computer Vision, 2004, 60 (2): 91-110.
  • 2K. Mikolajczyk, C. Schmid. A performance evaluation of local descriptors. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2005, 10(27): 1615-1630.
  • 3J. Wang, H. Zha, R. Cipolla. Coarse-to-fine vision-based localization by indexing scale-invariant features. IEEE Trans. on Systems, Man, and Cybernetics, 2006, 36(2): 413-422.
  • 4S. Se, D. G. Lowe, J. J. Little. Vision-based global localization and mapping for mobile robots. IEEE Trans. on Robotics, 2005, 21(3): 364-375.
  • 5H. Bay, T. Tuytelaars, L. Van Gool. SURF: Speeded up robust features. European Conference on Computer, 2006, 3951: 404- 417.
  • 6J. S. Beis, D. G. Lowe. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. Proc. of the Conference on Computer Vision and Pattem Recognition, 1997: 1000-1006.
  • 7T. Lindeberg. Feature detection with automatic scale selection. International Journal of Computer Vision, 1998, 30(2): 79-116.
  • 8K. Mikolajczyk, T. Tuytelaars, C. Schmid, et al. A comparison of affine region detectors. International Journal of Computer Vision, 2005, 65 (1-2), 43-72.
  • 9G. D. Konstantinos. The Harris corner detector, www. cse. yorku, ca/-kosta/comvis-Notes/harris-detector.pdf.
  • 10D. Oberkampf, D. E DeMenton, L. S. Davis. Iterative pose estimation using coplanar feature points. Computer Vision and Image Understanding, 1996, 63(3): 495-510.

同被引文献157

引证文献13

二级引证文献107

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部