TY - GEN
T1 - A novel progressive transmission in mobile visual search
AU - Zhang, Qi
AU - Li, Zhiyang
AU - Du, Yegang
AU - Qu, Wenyu
AU - Zhang, Xiaoxuan
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/11/3
Y1 - 2014/11/3
N2 - How to reduce the transmission latency is a main concern in the context of Mobile Visual Search (MVS). Transmitting extremely compacted visual descriptor in a progressive manner is the start-of-art solution. In this paper, we present a novel MVS system following the client-server architecture. To reduce the transmission latency, the inquiry image is represented by a set of hash bits, which are then progressively transmitted. In the server side, all images are indexed by their hash bits, similar as the classic Bag-of-Word (BoW) model. Owe to the merit of the proposed system, the IDF weight of the hash bits are encoded into a sparse vector which retained in the mobile client, and provides a transmission order of the inquiry hash bits. The hash bit with lower IDF weight will be more discriminative, which should have higher priority during the transmission. As far as we know, this work is the first one attempting to transmit the hash bits in a proper progressive manner in MVS. Extensive experiments have been done on the public Stanford MVS database, demonstrating that the proposed progressive transmission strategy achieves higher recognition rate compared to other strategies, when delivering the same amount of data.
AB - How to reduce the transmission latency is a main concern in the context of Mobile Visual Search (MVS). Transmitting extremely compacted visual descriptor in a progressive manner is the start-of-art solution. In this paper, we present a novel MVS system following the client-server architecture. To reduce the transmission latency, the inquiry image is represented by a set of hash bits, which are then progressively transmitted. In the server side, all images are indexed by their hash bits, similar as the classic Bag-of-Word (BoW) model. Owe to the merit of the proposed system, the IDF weight of the hash bits are encoded into a sparse vector which retained in the mobile client, and provides a transmission order of the inquiry hash bits. The hash bit with lower IDF weight will be more discriminative, which should have higher priority during the transmission. As far as we know, this work is the first one attempting to transmit the hash bits in a proper progressive manner in MVS. Extensive experiments have been done on the public Stanford MVS database, demonstrating that the proposed progressive transmission strategy achieves higher recognition rate compared to other strategies, when delivering the same amount of data.
KW - Bag of Hash Bits
KW - ITQ
KW - Mobile Visual Search
UR - http://www.scopus.com/inward/record.url?scp=84916195915&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84916195915&partnerID=8YFLogxK
U2 - 10.1109/DASC.2014.53
DO - 10.1109/DASC.2014.53
M3 - Conference contribution
AN - SCOPUS:84916195915
T3 - Proceedings - 2014 World Ubiquitous Science Congress: 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, DASC 2014
SP - 259
EP - 264
BT - Proceedings - 2014 World Ubiquitous Science Congress
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2014
Y2 - 24 August 2014 through 27 August 2014
ER -