Inverted Semantic-Index for Image Retrieval

• URL: http://arxiv.org/abs/2206.12623v1
• Date: Sat, 25 Jun 2022 11:21:56 GMT
• Title: Inverted Semantic-Index for Image Retrieval
• Authors: Ying Wang
• Abstract summary: inverted indices aim to build finer partitions that produce a concise and accurate candidate list. In this paper, we replace the clustering method with image classification, during the construction of codebook. We combine our semantic-index with the product quantization (PQ) so as to alleviate the accuracy loss caused by PQ compression.
• Score: 3.751222656656264
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper addresses the construction of inverted index for large-scale image retrieval. The inverted index proposed by J. Sivic brings a significant acceleration by reducing distance computations with only a small fraction of the database. The state-of-the-art inverted indices aim to build finer partitions that produce a concise and accurate candidate list. However, partitioning in these frameworks is generally achieved by unsupervised clustering methods which ignore the semantic information of images. In this paper, we replace the clustering method with image classification, during the construction of codebook. We then propose a merging and splitting method to solve the problem that the number of partitions is unchangeable in the inverted semantic-index. Next, we combine our semantic-index with the product quantization (PQ) so as to alleviate the accuracy loss caused by PQ compression. Finally, we evaluate our model on large-scale image retrieval benchmarks. Experiment results demonstrate that our model can significantly improve the retrieval accuracy by generating high-quality candidate lists.

Related papers

• Image-level Regression for Uncertainty-aware Retinal Image Segmentation [3.7141182051230914]
  We introduce a novel Uncertainty-Aware (SAUNA) transform, which adds pixel uncertainty to the ground truth. Our results indicate that the integration of the SAUNA transform and these segmentation losses led to significant performance boosts for different segmentation models.
  arXiv  Detail & Related papers  (2024-05-27T04:17:10Z)
• Contrastive Mean-Shift Learning for Generalized Category Discovery [45.19923199324919]
  We address the problem of generalized category discovery (GCD) We revisit the mean-shift algorithm, i.e., a powerful technique for mode seeking, and incorporate it into a contrastive learning framework. The proposed method, dubbed Contrastive Mean-Shift (CMS) learning, trains an image encoder to produce representations with better clustering properties.
  arXiv  Detail & Related papers  (2024-04-15T04:31:24Z)
• Learning to Rank Patches for Unbiased Image Redundancy Reduction [80.93989115541966]
  Images suffer from heavy spatial redundancy because pixels in neighboring regions are spatially correlated. Existing approaches strive to overcome this limitation by reducing less meaningful image regions. We propose a self-supervised framework for image redundancy reduction called Learning to Rank Patches.
  arXiv  Detail & Related papers  (2024-03-31T13:12:41Z)
• Fast Hybrid Image Retargeting [0.0]
  We propose a method that quantifies and limits warping distortions with the use of content-aware cropping. Our method outperforms recent approaches, while running in a fraction of their execution time.
  arXiv  Detail & Related papers  (2022-03-25T11:46:06Z)
• Contextual Similarity Aggregation with Self-attention for Visual Re-ranking [96.55393026011811]
  We propose a visual re-ranking method by contextual similarity aggregation with self-attention. We conduct comprehensive experiments on four benchmark datasets to demonstrate the generality and effectiveness of our proposed visual re-ranking method.
  arXiv  Detail & Related papers  (2021-10-26T06:20:31Z)
• Inverse Problems Leveraging Pre-trained Contrastive Representations [88.70821497369785]
  We study a new family of inverse problems for recovering representations of corrupted data. We propose a supervised inversion method that uses a contrastive objective to obtain excellent representations for highly corrupted images. Our method outperforms end-to-end baselines even with a fraction of the labeled data in a wide range of forward operators.
  arXiv  Detail & Related papers  (2021-10-14T15:06:30Z)
• A Semantic Indexing Structure for Image Retrieval [9.889773269004241]
  We propose a new classification-based indexing structure, called Semantic Indexing Structure (SIS) SIS uses semantic categories rather than clustering centers to create database partitions. SIS achieves outstanding performance compared with state-of-the-art models.
  arXiv  Detail & Related papers  (2021-09-14T11:12:30Z)
• Semantic Distribution-aware Contrastive Adaptation for Semantic Segmentation [50.621269117524925]
  Domain adaptive semantic segmentation refers to making predictions on a certain target domain with only annotations of a specific source domain. We present a semantic distribution-aware contrastive adaptation algorithm that enables pixel-wise representation alignment. We evaluate SDCA on multiple benchmarks, achieving considerable improvements over existing algorithms.
  arXiv  Detail & Related papers  (2021-05-11T13:21:25Z)
• Image Retrieval for Structure-from-Motion via Graph Convolutional Network [13.040952255039702]
  We present a novel retrieval method based on Graph Convolutional Network (GCN) to generate accurate pairwise matches without costly redundancy. By constructing a subgraph surrounding the query image as input data, we adopt a learnable GCN to exploit whether nodes in the subgraph have overlapping regions with the query photograph. Experiments demonstrate that our method performs remarkably well on the challenging dataset of highly ambiguous and duplicated scenes.
  arXiv  Detail & Related papers  (2020-09-17T04:03:51Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.