research-article

Large-Scale Visual Search with Binary Distributed Graph at Alibaba

Authors:

Rong JinAuthors Info & Claims

CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management

Pages 2567 - 2575

https://doi.org/10.1145/3357384.3357834

Published: 03 November 2019 Publication History

Abstract

Graph-based approximate nearest neighbor search has attracted more and more attentions due to its online search advantages. Numbers of methods studying the enhancement of speed and recall have been put forward. However, few of them focus on the efficiency and scale of offline graph-construction. For a deployed visual search system with several billions of online images in total, building a billion-scale offline graph in hours is essential, which is almost unachievable by most existing methods.

In this paper, we propose a novel algorithm called Binary Distributed Graph to solve this problem. Specifically, we combine binary codes with graph structure to speedup both offline and online procedures, and achieve comparable performance with the ones that use real-value features, by recalling and reranking more binary candidates. Furthermore, the graph-construction is optimized to completely distributed implementation, which significantly accelerates the offline process and gets rid of the limitation of single machine, such as memory and storage. Experimental comparisons on Alibaba Commodity Data Set (more than three billion images) show that the proposed method outperforms the state-of-the-art with respect to the online/offline trade-off.

References

[1]

Artem Babenko and Victor Lempitsky. 2012. The inverted multi-index. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 3069--3076.

[2]

Artem Babenko and Victor Lempitsky. 2016. Efficient indexing of billion-scale datasets of deep descriptors. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2055--2063.

[3]

Artem Babenko and Victor Lempitsky. 2017. Product split trees. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR) .

[4]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990. The R*-tree: an efficient and robust access method for points and rectangles. In ACM Conference on Management of Data (SIGMOD), Vol. 19. 322--331.

Digital Library

[5]

Jon Louis Bentley. 1975. Multidimensional binary search trees used for associative searching. Communications Of The ACM, Vol. 18, 9 (1975), 509--517.

Digital Library

[6]

Yue Cao, Mingsheng Long, Jianmin Wang, Qiang Yang, and Philip S Yu. 2016. Deep visual-semantic hashing for cross-modal retrieval. In Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining (SIGKDD) . 1445--1454.

Digital Library

[7]

Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the 20th annual Symposium on Computational Geometry (SoCG). 253--262.

Digital Library

[8]

Wei Dong, Charikar Moses, and Kai Li. 2011. Efficient k-nearest neighbor graph construction for generic similarity measures. In Proceedings of the 20th International Conference on World Wide Web (WWW) . 577--586.

Digital Library

[9]

Matthijs Douze, Hervé Jégou, and Florent Perronnin. 2016. Polysemous codes. In European Conference on Computer Vision (ECCV) . 785--801.

[10]

Matthijs Douze, Alexandre Sablayrolles, and Hervé Jégou. 2018. Link and code: Fast indexing with graphs and compact regression codes. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . 3646--3654.

[11]

Jinyang Gao, HV Jagadish, Beng Chin Ooi, and Sheng Wang. 2015. Selective hashing: Closing the gap between radius search and k-nn search. In Proceedings of the 21th International Conference on Knowledge Discovery and Data Mining (SIGKDD) . 349--358.

Digital Library

[12]

Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2013. Optimized product quantization for approximate nearest neighbor search. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . 2946--2953.

Digital Library

[13]

Yunchao Gong and Svetlana Lazebnik. 2011. Iterative quantization: A procrustean approach to learning binary codes. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 817--824.

Digital Library

[14]

Yunchao Gong, Marcin Pawlowski, Fei Yang, Louis Brandy, Lubomir Bourdev, and Rob Fergus. 2015. Web scale photo hash clustering on a single machine. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 19--27.

[15]

Jie Gui and Ping Li. 2018. R 2 sdh: Robust rotated supervised discrete hashing. In Proceedings of the 24th International Conference on Knowledge Discovery and Data Mining (SIGKDD) . 1485--1493.

Digital Library

[16]

Ben Harwood and Tom Drummond. 2016. Fanng: Fast approximate nearest neighbour graphs. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 5713--5722.

[17]

Jae-Pil Heo, Zhe Lin, and Sung-Eui Yoon. 2014. Distance encoded product quantization. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2131--2138.

Digital Library

[18]

Hosagrahar V Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, and Rui Zhang. 2005. iDistance: An adaptive B

[19]

-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS), Vol. 30, 2 (2005), 364--397.

[20]

Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2011. Product quantization for nearest neighbor search. IEEE Transactions on Pattern Analysis and Machine Intelligence (T-PAMI), Vol. 33, 1 (2011), 117--128.

Digital Library

[21]

Weihao Kong and Wu-Jun Li. 2012. Isotropic hashing. In Advances in Neural Information Processing Systems (NIPS). 1655--1663.

[22]

Yury Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov. 2014. Approximate nearest neighbor algorithm based on navigable small world graphs. Information Systems (IS), Vol. 45 (2014), 61--68.

[23]

Yury A Malkov and Dmitry A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence (T-PAMI) (2018).

[24]

Yusuke Matsui, Toshihiko Yamasaki, and Kiyoharu Aizawa. 2015. Pqtable: Fast exact asymmetric distance neighbor search for product quantization using hash tables. In IEEE International Conference on Computer Vision (ICCV). 1940--1948.

Digital Library

[25]

Chanop Silpa-Anan and Richard Hartley. 2008. Optimised KD-trees for fast image descriptor matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 1--8.

[26]

Takeaki Uno, Masashi Sugiyama, and Koji Tsuda. 2009. Efficient construction of neighborhood graphs by the multiple sorting method. arXiv preprint arXiv:0904.3151 (2009).

[27]

Dilin Wang, Lei Shi, and Jianwen Cao. 2013. Fast algorithm for approximate k-nearest neighbor graph construction. In IEEE 13th International Conference on Data Mining Workshops (ICDM workshop) . 349--356.

Digital Library

[28]

Jingdong Wang and Shipeng Li. 2012. Query-driven iterated neighborhood graph search for large scale indexing. In Proceedings of the 20th International Conference on Multimedia (MM). 179--188.

Digital Library

[29]

Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, Rui Gan, and Shipeng Li. 2012. Scalable k-nn graph construction for visual descriptors. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 1106--1113.

[30]

Yair Weiss, Antonio Torralba, and Rob Fergus. 2008. Spectral hashing. In Advances in Neural Information Processing Systems (NIPS). 1753--1760.

[31]

Bin Xu, Jiajun Bu, Yue Lin, Chun Chen, Xiaofei He, and Deng Cai. 2013. Harmonious hashing. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI). 1820--1826.

[32]

Yanhao Zhang, Pan Pan, Yun Zheng, Kang Zhao, Yingya Zhang, Xiaofeng Ren, and Rong Jin. 2018. Visual search at alibaba. In Proceedings of the 24th International Conference on Knowledge Discovery and Data Mining (SIGKDD). 993--1001.

Digital Library

[33]

Kang Zhao, Hongtao Lu, Yangcheng He, and Shaokun Feng. 2014b. Locality preserving discriminative hashing. In Proceedings of the 22nd International Conference on Multimedia (MM). 1089--1092.

Digital Library

[34]

Kang Zhao, Hongtao Lu, and Jincheng Mei. 2014a. Locality Preserving Hashing. In AAAI Conference on Artificial Intelligence (AAAI). 2874--2881.

[35]

Wan-Lei Zhao. 2018. k-NN Graph Construction: a Generic Online Approach. arXiv preprint arXiv:1804.03032 (2018).

Cited By

Zhu XHuang SDing HYang JChen KZhou TNeiman TXie OTran SYao BGray DBindal ADhua ABaeza-Yates RBonchi F(2024)Bringing Multimodality to Amazon Visual Search SystemProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671640(6390-6399)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671640
Heuillet ATabia HArioui H(2023)Automated Siamese Network Design for Image Similarity ComputationProceedings of the 20th International Conference on Content-based Multimedia Indexing10.1145/3617233.3617243(8-13)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1145/3617233.3617243
Sun YGuo DLuo LLiu LLi XXie J(2023)Prophet: An Efficient Feature Indexing Mechanism for Similarity Data Sharing at Network EdgeIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228941(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228941
Show More Cited By

Index Terms

Large-Scale Visual Search with Binary Distributed Graph at Alibaba
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Computer vision tasks
        Visual content-based indexing and retrieval
2. Information systems
  1. Information retrieval
    1. Specialized information retrieval
      1. Multimedia and multimodal retrieval
        Image search

Recommendations

Visual Search at Alibaba
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

This paper introduces the large scale visual search algorithm and system infrastructure at Alibaba. The following challenges are discussed under the E-commercial circumstance at Alibaba (a) how to handle heterogeneous image data and bridge the gap ...
Towards Joint Multiply Semantics Hashing for Visual Search
Image and Graphics
Abstract
With the rapid growth of visual data on the web, deep hashing has shown enormous potential in preserving semantic similarity for visual search. Currently, most of the existing hashing methods employ pairwise or triplet-wise constraint to obtain ...
Semi-Supervised Hashing for Large-Scale Search

Hashing-based approximate nearest neighbor (ANN) search in huge databases has become popular due to its computational and memory efficiency. The popular hashing methods, e.g., Locality Sensitive Hashing and Spectral Hashing, construct hash functions ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management

November 2019

3373 pages

ISBN:9781450369763

DOI:10.1145/3357384

General Chairs:
Wenwu Zhu
Tsinghua University, China
,
Dacheng Tao
University of Massachusetts, USA
,
Xueqi Cheng
Institute of Computing Technology, CAS, China
,
Program Chairs:
Peng Cui
Tsinghua University, China
,
Elke Rundensteiner
Worcester Polytechnic Institute, USA
,
David Carmel
Amazon Research, USA
,
Qi He
LinkedIn, USA
,
Jeffrey Xu Yu
Chinese University of Hong Kong, China

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CIKM '19

Sponsor:

CIKM '19: The 28th ACM International Conference on Information and Knowledge Management

November 3 - 7, 2019

Beijing, China

Acceptance Rates

CIKM '19 Paper Acceptance Rate 202 of 1,031 submissions, 20%;

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
381
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)9

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhu XHuang SDing HYang JChen KZhou TNeiman TXie OTran SYao BGray DBindal ADhua ABaeza-Yates RBonchi F(2024)Bringing Multimodality to Amazon Visual Search SystemProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671640(6390-6399)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671640
Heuillet ATabia HArioui H(2023)Automated Siamese Network Design for Image Similarity ComputationProceedings of the 20th International Conference on Content-based Multimedia Indexing10.1145/3617233.3617243(8-13)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1145/3617233.3617243
Sun YGuo DLuo LLiu LLi XXie J(2023)Prophet: An Efficient Feature Indexing Mechanism for Similarity Data Sharing at Network EdgeIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228941(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228941
Yang KWang HDu MWang ZTan ZZhang JXiao Y(2023)An efficient indexing technique for billion-scale nearest neighbor searchMultimedia Tools and Applications10.1007/s11042-023-14825-z82:20(31673-31689)Online publication date: 23-Mar-2023
https://doi.org/10.1007/s11042-023-14825-z
Seol JKim SPark SLim HNa HPark EJung DPark SLee KLee S(2023)Technologies for AI-Driven Fashion Social Networking Service with E-CommerceSemantic Intelligence10.1007/978-981-19-7126-6_15(187-204)Online publication date: 1-Apr-2023
https://doi.org/10.1007/978-981-19-7126-6_15
Zhao KSong LZhang YPan PXu YJin R(2022)ANN softmaxProceedings of the VLDB Endowment10.14778/3485450.348545115:1(1-10)Online publication date: 14-Jan-2022
https://dl.acm.org/doi/10.14778/3485450.3485451
Beal JWu HPark DZhai AKislyuk D(2022)Billion-Scale Pretraining with Vision Transformers for Multi-Task Visual Representations2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV51458.2022.00150(1431-1440)Online publication date: Jan-2022
https://doi.org/10.1109/WACV51458.2022.00150
Wang MXu XYue QWang Y(2021)A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor searchProceedings of the VLDB Endowment10.14778/3476249.347625514:11(1964-1978)Online publication date: 27-Oct-2021
https://dl.acm.org/doi/10.14778/3476249.3476255
Song LPan PZhao KYang HChen YZhang YXu YJin RGupta RLiu YShah MRajan STang JPrakash B(2020)Large-Scale Training System for 100-Million Classification at AlibabaProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403342(2909-2930)Online publication date: 23-Aug-2020
https://dl.acm.org/doi/10.1145/3394486.3403342

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents