Compressed Binary Discriminative Feature for Fast UAV Image Registration

Efficiently UAV images mosaicking is of critical importance for the application of disaster management, in which fast image registration plays an important role. Towards fast and accurate image registration, the key design lies in the keypoint description, to which end SIFT and SURF are widely leveraged in the related literature. However, the expensive computation and memory costs restrict their potential in disaster management. In this paper, we proposed a novel keypoint descriptor termed CBDF (Compressed Binary Discriminative Feature). A cascade of binary strings is computed by efficiently comparing image gradients static information over a log-polar location grid pattern. Extensive evaluations on benchmark datasets and real-world UAV images show that CBDF yields a similar performance with SIFT and SURF, and it is much more efficient in terms of both computation time and memory.

[1]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[2]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[3]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[4]  Guoqing Zhou,et al.  Geo-Referencing of Video Flow From Small Low-Cost Civilian UAV , 2010, IEEE Transactions on Automation Science and Engineering.

[5]  Paul L. Rosin Measuring Corner Properties , 1999, Comput. Vis. Image Underst..

[6]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[7]  Pascal Fua,et al.  LDAHash: Improved Matching with Smaller Descriptors , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[9]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[10]  Pierre Vandergheynst,et al.  FREAK: Fast Retina Keypoint , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[11]  Gregory Shakhnarovich,et al.  Learning task-specific similarity , 2005 .

[12]  Vincent Lepetit,et al.  BRIEF: Binary Robust Independent Elementary Features , 2010, ECCV.

[13]  Jiri Matas,et al.  Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..

[14]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[15]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Gary R. Bradski,et al.  ORB: An efficient alternative to SIFT or SURF , 2011, 2011 International Conference on Computer Vision.

[17]  Vincent Lepetit,et al.  DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Gang Hua,et al.  Discriminative Learning of Local Image Descriptors , 1990, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Roland Siegwart,et al.  BRISK: Binary Robust invariant scalable keypoints , 2011, 2011 International Conference on Computer Vision.

[20]  Tom Drummond,et al.  Machine Learning for High-Speed Corner Detection , 2006, ECCV.

[21]  Bernd Girod,et al.  CHoG: Compressed histogram of gradients A low bit-rate feature descriptor , 2009, CVPR.

[22]  Svetlana Lazebnik,et al.  Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.

[23]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, CVPR 2004.