NOVÁK, David, Jan ČECH and Pavel ZEZULA. Efficient Image Search with Neural Net Features. Online. In Similarity Search and Applications: 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings. New York: Springer International Publishing, 2015. p. 237-243. ISBN 978-3-319-25086-1. Available from: https://dx.doi.org/10.1007/978-3-319-25087-8_22. [citováno 2024-04-24]
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Efficient Image Search with Neural Net Features
Authors NOVÁK, David (203 Czech Republic, guarantor, belonging to the institution), Jan ČECH (203 Czech Republic) and Pavel ZEZULA (203 Czech Republic, belonging to the institution)
Edition New York, Similarity Search and Applications: 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings, p. 237-243, 7 pp. 2015.
Publisher Springer International Publishing
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW DOI link
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/15:00081692
Organization unit Faculty of Informatics
ISBN 978-3-319-25086-1
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-25087-8_22
UT WoS 000374289600022
Keywords in English metric indexing; deep convolutional neural network; contentbased image retrieval
Tags content-based image retrieval, DISA, Metric Space
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28/4/2016 15:35.
Abstract
We present an efficiency evaluation of similarity search techniques applied on visual features from deep neural networks. Our test collection consists of 20 million 4096-dimensional descriptors (320GB of data). We test approximate k-NN search using several techniques, specifically FLANN library (a popular in-memory implementation of k-d tree forest), M-Index (that uses recursive Voronoi partitioning of a metric space), and PPP-Codes, which work with memory codes of metric objects and use disk storage for candidate refinement. Our evaluation shows that as long as the data fit in main memory, the FLANN and the M-Index have practically the same ratio between precision and response time. The PPP-Codes identify candidate sets ten times smaller then the other techniques and the response times are around 500 ms for the whole 20M dataset stored on the disk. The visual search with this index is available as an online demo application. The collection of 20M descriptors is provided as a public dataset to academic community.
Links
GAP103/10/0886, research and development projectName: Vizuální vyhledávání obrázků na Webu (Acronym: VisualWeb)
Investor: Czech Science Foundation, Content-based Image Retrieval on the Web Scale
PrintDisplayed: 24/4/2024 00:57