.png){kind=icon}
.png){kind=icon}
Return
CBDF: Compressed Binary Discriminative Feature
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.07.120.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Keypoint descriptors play an indisputable role in modern vision, whether it is for image registration, content-based retrieval, 3D reconstruction, or object recognition. In that perspective, SIFT descriptor is the most widely used due to its robustness to scale, rotation, and perspective distortions as well as illumination changes. However, the processing effort and the amount of memory required by SIFT make it ill-suited for applications with limited memory and processing power. In this paper, we propose a novel keypoint descriptor called CBDF (Compressed Binary Discriminative Feature) designed to be accurate, memory efficient and fast at the same time. High speed and memory efficiency are made possible due to a binary descriptor obtained by aggregating gradient features. Local discriminative analysis (LDA) is used to make sure the aggregated feature leads to a discriminative descriptor. Accuracy is also enforced by the use of scale, rotation, and illumination invariant features. The CBDF descriptor is stored on a 32-byte vector (which is one order of magnitude smaller than the usual 512-byte vector for SIFT) while matching is done with the Hamming distance. Extensive evaluations on various benchmark datasets show that CBDF is not only faster and generally more accurate than SIFT and SURF, but also more accurate than recent descriptors such as ORB, BRISK and BRIEF. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Image registration
Feature descriptor
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W