How many bits do I need for matching local binary descriptors?
Pablo F. AlcantarillaBjörn StengerPublished in: ICRA (2016)
Keyphrases
- keypoints
- hamming distance
- feature descriptors
- binary strings
- gray code
- pattern matching
- shape context
- matching algorithm
- sift descriptors
- binary codes
- shape descriptors
- matching process
- spin images
- feature points
- bit string
- shape matching
- graph matching
- image matching
- error correcting codes
- wide baseline matching
- hamming space
- computer vision
- matching scheme
- scale invariant feature transform
- texture descriptors
- feature matching
- distance measure