Name
Abstract | ||
|---|---|---|
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. For real-time mobile applications, very fast but less accurate descriptors like BRIEF and related methods use a random sampling of pairwise comparisons of pixel intensities in an image patch. Here, we introduce Locally Uniform Comparison Image Descriptor (LUCID), a simple description method based on permutation distances between the ordering of intensities of RGB values between two patches. LUCID is computable in linear time with respect to patch size and does not require floating point computation. An analysis reveals an underlying issue that limits the potential of BRIEF and related approaches compared to LUCID. Experiments demonstrate that LUCID is faster than BRIEF, and its accuracy is directly comparable to SURF while being more than an order of magnitude faster. |
Year | Venue | Field |
|---|---|---|
2012 | NIPS | Structure from motion,Computer vision,Scale-invariant feature transform,Floating point,Computer science,Permutation,Hash function,Artificial intelligence,Pixel,RGB color model,Time complexity,Machine learning |
DocType | Citations | PageRank |
Conference | 16 | 0.85 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ziegler, Andrew | 1 | 16 | 1.19 |
| Eric M. Christiansen | 2 | 64 | 4.61 |
| David Kriegman | 3 | 7693 | 451.96 |
| Serge J. Belongie | 4 | 12512 | 1010.13 |