Histogram

Statistics

Support vector machine

Scale-invariant feature transform

Binary image

Image processing

AdaBoost

Economics

Set (abstract data type)

Computer science

Local binary patterns

Forcing (mathematics)

Task (project management)

Pattern recognition (psychology)

Mathematics

Management

Image (mathematics)

Mathematical analysis

Artificial intelligence

Orb (optics)

Matching (statistics)

Programming language

Binary number

Computer vision

Arithmetic

Pattern Recognition Letters

Efficient matching of local image features is a fundamental task in many computer vision applications. However, the real-time performance of top matching algorithms is compromised in computationally limited devices, such as mobile phones or drones, due to the simplicity of their hardware and their finite energy supply. In this paper we introduce BEBLID, an efficient learned binary image descriptor. It improves our previous real-valued descriptor, BELID, making it both more efficient for matching and more accurate. To this end we use AdaBoost with an improved weak-learner training scheme that produces better local descriptions. Further, we binarize our descriptor by forcing all weak-learners to have the same weight in the strong learner combination and train it in an unbalanced data set to address the asymmetries arising in matching and retrieval tasks. In our experiments BEBLID achieves an accuracy close to SIFT and better computational efficiency than ORB, the fastest algorithm in the literature.

BEBLID: Boosted efficient binary local image descriptor