A fast feature extraction and matching algorithm for unmanned aerial vehicle images

被引：0
|
作者：
Yu H. [1 ]
Yang W. [1 ]
机构：
[1] School of Electronic Information, Wuhan University, Wuhan
来源：
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2016年 / 38卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Feature extraction; Feature matching; Image stitching; Unmanned Aerial Vehicle (UAV);
D O I：
10.11999/JEIT150676
中图分类号：
学科分类号：
摘要：
Unmanned Aerial Vehicle (UAV) images are characterized by a very high spatial resolution, and consequently by more abundant information of the edge and the texture. The conventional stitching methods, which use Speeded Up Robust Features (SURF) and kd-tree based nearest neighbor matching, are facing with new challenges for processing UAV images. In this paper, a fast feature extraction and matching algorithm is proposed for more efficient stitching of UAV images. Firstly, the Local Difference Binary (LDB) algorithm is used to describe the feature, which could reduce the dimension of feature without sacrificing its discrimination. Then, the Local Sensitive Hash (LSH) is used to replace kd-tree search structure, which achieves nearest neighbor matching more efficiently. Compared with the conventional stitching method, experimental results demonstrate that the proposed method achieves a higher accuracy and greater efficiency, which is more applicable to rapid mapping of UAV images. © 2016, Science Press. All right reserved.
引用
收藏
页码：509 / 516
页数：7
相关论文
共 23 条
  • [11] Muja M., Lowe D.G., Fast approximate nearest neighbors with automatic algorithm configuration, The International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, pp. 331-340, (2009)
  • [12] Calonder M., Lepetit V., Strecha C., Et al., Brief: binary robust independent elementary features, European Conference on Computer Vision, pp. 778-792, (2010)
  • [13] Rublee E., Rabaud V., Konolige K., Et al., ORB: an efficient alternative to SIFT or SURF, IEEE International Conference on Computer Vision, pp. 2564-2571, (2011)
  • [14] Leutenegger S., Chli M., Siegwart R.Y., BRISK: binary robust invariant scalable keypoints, IEEE International Conference on Computer Vision, pp. 2548-2555, (2011)
  • [15] Alahi A., Ortiz R., Vandergheynst P., Freak: fast retina keypoint, IEEE Conference on Computer Vision and Pattern Recognition, pp. 510-517, (2012)
  • [16] Yang X., Cheng K.T., Local difference binary for ultrafast and distinctive feature description, IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 1, pp. 188-194, (2014)
  • [17] Andoni A., Indyk P., Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Communications of the ACM, 51, 1, pp. 117-122, (2008)
  • [18] Fischler M.A., Bolles R.C., Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM, 24, 6, pp. 381-395, (1981)
  • [19] Viola P., Jones M., Robust real-time object detection, International Journal of Computer Vision, 57, 2, pp. 137-154, (2004)
  • [20] Shen Q., Li X., Kong F., Et al., A real-time video compression for UAV based on affine model, Journal of Electronics & Information Technology, 36, 12, pp. 2855-2860, (2014)
123