Learning Image Descriptors with Boosting

We propose a novel and general framework to learn compact but highly discriminative floating-point and binary local feature descriptors. By leveraging the boosting-trick we first show how to efficiently train a compact floating-point descriptor that is very robust to illumination and viewpoint changes. We then present the main contribution of this paper — a binary extension of the framework that demonstrates the real advantage of our approach and allows us to compress the descriptor even further. Each bit of the resulting binary descriptor, which we call BinBoost, is computed with a boosted binary hash function, and we show how to efficiently optimize the hash functions so that they are complementary, which is key to compactness and robustness. As we do not put any constraints on the weak learner configuration underlying each hash function, our general framework allows us to optimize the sampling patterns of recently proposed hand-crafted descriptors and significantly improve their performance. Moreover, our boosting scheme can easily adapt to new applications and generalize to other types of image data, such as faces, while providing state-of-the-art results at a fraction of the matching time and memory footprint.


Published in:
IEEE Transactions on Pattern Analysis and Machine Intelligence, 37, 3
Year:
2015
Publisher:
Institute of Electrical and Electronics Engineers
ISSN:
0162-8828
Keywords:
Note:
(c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Laboratories:


Note: PRIVATE


 Record created 2013-05-23, last modified 2018-03-17

Code (C++):
Download fulltextTAR.GZ
Preprint:
Download fulltextPDF
Results (Liberty, Notre Dame, Yosemite datasets):
Download fulltextTAR.GZ
n/a:
Download fulltextPDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)