The data compression book (2nd ed.)
The data compression book (2nd ed.)
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Tree Histogram Coding for Mobile Image Matching
DCC '09 Proceedings of the 2009 Data Compression Conference
Proceedings of the international conference on Multimedia
The stanford mobile visual search data set
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
JIGSAW: interactive mobile visual search with multimodal queries
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Towards low bit rate mobile visual search with multiple-channel coding
MM '11 Proceedings of the 19th ACM international conference on Multimedia
SURF: speeded up robust features
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Listen, look, and gotcha: instant video search with mobile phones by layered audio-video indexing
Proceedings of the 21st ACM international conference on Multimedia
Hi-index | 0.00 |
Mobile visual search has attracted extensive attention for its huge potential for numerous applications. Research on this topic has been focused on two schemes: sending query images, and sending compact descriptors extracted on mobile phones. The first scheme requires about 30-40KB data to transmit, while the second can reduce the bit rate by 10 times. In this paper, we propose a third scheme for extremely low bit rate mobile visual search, which sends compressed visual words consisting of vocabulary tree histogram and descriptor orientations rather than descriptors. This scheme can further reduce the bit rate with few extra computational costs on the client. Specifically, we store a vocabulary tree and extract visual descriptors on the mobile client. A light-weight pre-retrieval is performed to obtain the visited leaf nodes in the vocabulary tree. The orientation of each local descriptor and the tree histogram are then encoded to be transmitted to server. Our new scheme transmits less than 1KB data, which reduces the bit rate in the second scheme by 3 times, and obtains about 30% improvement in terms of search accuracy over the traditional Bag-of-Words baseline. The time cost is only 1.5 secs on the client and 240 msecs on the server.