Compressive Quantization for Fast Object Instance Search in Videos
Most of current visual search systems focus on image-to-image (point-to-point) search such as image and object retrieval. Nevertheless, fast image-to-video (point-to-set) search is much less exploited. This paper tackles object instance search in videos, where efficient point-to-set matching is essential. Through jointly optimizing vector quantization and hashing, we propose compressive quantization method to compress M object proposals extracted from each video into only k binary codes, where k<< M. Then the similarity between the query object and the whole video can be determined by the Hamming distance between the query's binary code and the video's best-matched binary code. Our compressive quantization not only enables fast search but also significantly reduces the memory cost of storing the video features. Despite the high compression ratio, our proposed compressive quantization still can effectively retrieve small objects in large video datasets. Systematic experiments on three benchmark datasets verify the effectiveness and efficiency of our compressive quantization.
Code (0)
등록된 구현이 없습니다.
Tasks
Instance SearchObjectQuantizationRetrievalset matchingSimilar Papers 제목 키워드 기반
Image Compression Based on Compressive Sensing: End-to-End Comparison with JPEG
We present an end-to-end image compression system based on compressive sensing. The presented system integrates the conventional scheme of compressive sampling and reconstruction with quantization and entropy coding. The…
Compressive SensingImage CompressionQuantizationCHIME: A Compressive Framework for Holistic Interest Modeling
Modeling holistic user interests is important for improving recommendation systems but is challenged by high computational cost and difficulty in handling diverse information with full behavior context. Existing search-b…
Contrastive LearningQuantizationRecommendation SystemsProvable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
Submodular maximization with the greedy algorithm has been studied as an effective approach to extractive summarization. This approach is known to have three advantages: its applicability to many useful submodular object…
Document SummarizationExtractive SummarizationInformation RetrievalDeep Probabilistic Unfolding for Quantized Compressive Sensing
We propose a deep probabilistic unfolding model to address the classical quantized compressive sensing problem that leverages an unfolding framework to enhance the reconstruction accuracy and efficiency. Unlike previous …
Compressive SensingScore-Based Turbo Message Passing for Plug-and-Play Compressive Imaging
Message-passing algorithms have been adapted for compressive imaging by incorporating various off-the-shelf image denoisers. However, these denoisers rely largely on generic or hand-crafted priors and often fall short in…