Locally uniform comparison image descriptor
Research output: Contribution to journal › Conference article › Research › peer-review
Keypoint matching between pairs of images using popular descriptors like SIFT or a faster variant called SURF is at the heart of many computer vision algorithms including recognition, mosaicing, and structure from motion. However, SIFT and SURF do not perform well for real-time or mobile applications. As an alternative very fast binary descriptors like BRIEF and related methods use pairwise comparisons of pixel intensities in an image patch. We present an analysis of BRIEF and related approaches revealing that they are hashing schemes on the ordinal correlation metric Kendall's tau. Here, we introduce Locally Uniform Comparison Image Descriptor (LUCID), a simple description method based on linear time permutation distances between the ordering of RGB values of two image patches. LUCID is computable in linear time with respect to the number of pixels and does not require floating point computation.
Original language | English |
---|---|
Journal | Advances in Neural Information Processing Systems |
Pages (from-to) | 1-9 |
Number of pages | 9 |
ISSN | 1049-5258 |
Publication status | Published - 2012 |
Externally published | Yes |
Event | 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012 - Lake Tahoe, NV, United States Duration: 3 Dec 2012 → 6 Dec 2012 |
Conference
Conference | 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012 |
---|---|
Country | United States |
City | Lake Tahoe, NV |
Period | 03/12/2012 → 06/12/2012 |
Sponsor | Winton Capital Management, Google, Pascal2, EMC2 Greenplum, Facebook |
ID: 301829993