Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024
Extreme Meta-Classification for Large-Scale Zero-Shot Retrieval
- Sachin Yadav,
- Deepak Saini,
- Anirudh Buvanesh,
- Bhawna Paliwal,
- Kunal Dahiya,
- Siddarth Asokan,
- Yashoteja Prabhu,
- Jian Jiao,
- Manik Varma
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 3657–3666https://doi.org/10.1145/3637528.3672046We develop accurate and efficient solutions for large-scale retrieval tasks where novel (zero-shot) items can arrive continuously at a rapid pace. Conventional Siamese-style approaches embed both queries and items through a small encoder and retrieve the ...
- research-articleJuly 2020
Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval
SIGIR '20: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information RetrievalPages 1409–1418https://doi.org/10.1145/3397271.3401132Cross-modal hashing has been widely investigated recently for its efficiency in large-scale cross-media retrieval. However, most existing cross-modal hashing methods learn hash functions in a batch-based learning mode. Such mode is not suitable for ...
- research-articleJune 2020
Rank-embedded Hashing for Large-scale Image Retrieval
ICMR '20: Proceedings of the 2020 International Conference on Multimedia RetrievalPages 563–570https://doi.org/10.1145/3372278.3390716With the growth of images on the Internet, plenty of hashing methods are developed to handle the large-scale image retrieval task. Hashing methods map data from high dimension to compact codes, so that they can effectively cope with complicated image ...
- short-paperJune 2019
Unsupervised Rank-Preserving Hashing for Large-Scale Image Retrieval
ICMR '19: Proceedings of the 2019 on International Conference on Multimedia RetrievalPages 192–196https://doi.org/10.1145/3323873.3325038We propose an unsupervised hashing method, exploiting a shallow neural network, that aims to produce binary codes that preserve the ranking induced by an original real-valued representation. This is motivated by the emergence of small-world graph-based ...
- research-articleJune 2018
Fast Scalable Supervised Hashing
SIGIR '18: The 41st International ACM SIGIR Conference on Research & Development in Information RetrievalPages 735–744https://doi.org/10.1145/3209978.3210035Despite significant progress in supervised hashing, there are three common limitations of existing methods. First, most pioneer methods discretely learn hash codes bit by bit, making the learning procedure rather time-consuming. Second, to reduce the ...
- research-articleApril 2013
Getting the look: clothing recognition and segmentation for automatic product suggestions in everyday photos
ICMR '13: Proceedings of the 3rd ACM conference on International conference on multimedia retrievalPages 105–112https://doi.org/10.1145/2461466.2461485We present a scalable approach to automatically suggest relevant clothing products, given a single image without metadata. We formulate the problem as cross-scenario retrieval: the query is a real-world image, while the products from online shopping ...
- research-articleOctober 2008
Place retrieval with graph-based place-view model
MIR '08: Proceedings of the 1st ACM international conference on Multimedia information retrievalPages 268–275https://doi.org/10.1145/1460096.1460141Places in movies and sitcoms could indicate higher-level semantic cues about the story scenarios and actor relations. This paper presents a novel unsupervised framework for efficient place retrieval in movies and sitcoms. We leverage face detection to ...
- ArticleAugust 2005
Top subset retrieval on large collections using sorted indices
SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrievalPages 599–600https://doi.org/10.1145/1076034.1076147In this poster we describe alternative inverted index structures that reduce the time required to process queries, produce a higher query throughput and still return high quality results to the end user. We give results based upon the TREC Terabyte ...