COMPACT HASH CODES AND DATA STRUCTURES FOR EFFICIENT MOBILE VISUAL SEARCH

被引：0

作者：

Ercoli, Simone ^{[1
]}

Bertini, Marco ^{[1
]}

Del Bimbo, Alberto ^{[1
]}

机构：

[1] Univ Florence, MICC, I-50121 Florence, Italy

来源：

2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW) | 2015年

关键词：

Mobile visual search; nearest neighbor search; hashing; SIFT; QUANTIZATION;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we present an efficient method for mobile visual search that exploits compact hash codes and data structures for visual features retrieval. The method has been tested on a large scale standard dataset of one million SIFT features, showing a retrieval performance comparable or superior to state-of-the-art methods, and a very high efficiency in terms of memory consumption and computational requirements. These characteristics make it suitable for application to mobile visual search, where devices have limited computational and memory capabilities.

引用

页数：6

共 25 条

[1] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].

AHO, AV ;

CORASICK, MJ .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340

[2]

[Anonymous], P EUR C COMP VIS ECC

[3]

Babenko A., 2012, P IEEE COMP VIS PATT

[4]

CHANDRASEKHAR V, 2010, P INT WORKSH MOB MUL

[5] Using binarization and hashing for efficient SIFT matching [J].

Chen, Chun-Che ;

Hsieh, Shang-Lin .

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2015, 30 :86-93

[6]

Gong Yunchao, 2011, P IEEE COMP VIS PATT

[7] Quantization [J].

Gray, RM ;

Neuhoff, DL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2325-2383

[8]

Jae-Pil Heo, 2012, P IEEE COMP VIS PATT

[9]

Jain Mihir, 2011, P ACM MULT ACM MM

[10] Product Quantization for Nearest Neighbor Search [J].

Jegou, Herve ;

Douze, Matthijs ;

Schmid, Cordelia .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (01) :117-128

← 1 2 3 →