z-logo
open-access-imgOpen Access
Generalized Descriptor Compression for Storage and Matching
Author(s) -
Matthew Johnson
Publication year - 2010
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.24.23
Subject(s) - scale invariant feature transform , computer science , matching (statistics) , artificial intelligence , computer vision , augmented reality , mobile device , bandwidth (computing) , feature matching , feature extraction , image matching , pattern recognition (psychology) , image (mathematics) , mathematics , computer network , statistics , operating system
Smarter phones have made handheld computer vision a reality, but limited bandwidth, storage space and processing power prevent mobile phones from leveraging the full body of existing research. In particular, common techniques which use feature detectors and descriptors to solve problems in image matching and augmented reality cannot be used due to their space and processing requirements. We propose a general descriptor compression method which reduces descriptor size and provides fast descriptor matching without requiring decompression. By demonstrating how to apply our method to the commonly used SIFT, SURF and GLOH descriptors, we show its effectiveness in reducing size and increasing accuracy. In all cases, we reduce the size of the descriptor by an order of magnitude and achieve higher accuracy at a detection rate of 95%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom