Cross-Scale Context Extracted Hashing for Fine-Grained Image Binary Encoding

• URL: http://arxiv.org/abs/2210.07572v1
• Date: Fri, 14 Oct 2022 06:52:40 GMT
• Title: Cross-Scale Context Extracted Hashing for Fine-Grained Image Binary Encoding
• Abstract summary: A Cross-Scale Context Extracted Hashing Network (CSCE-Net) is proposed in this paper. CSCE-Net learns a content-related Dynamic Sign Function (DSF) to replace the original simple sign function. Our CSCE-Net is context-sensitive and able to perform well on accurate image binary encoding.
• Score: 1.3649494534428745
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deep hashing has been widely applied to large-scale image retrieval tasks owing to efficient computation and low storage cost by encoding high-dimensional image data into binary codes. Since binary codes do not contain as much information as float features, the essence of binary encoding is preserving the main context to guarantee retrieval quality. However, the existing hashing methods have great limitations on suppressing redundant background information and accurately encoding from Euclidean space to Hamming space by a simple sign function. In order to solve these problems, a Cross-Scale Context Extracted Hashing Network (CSCE-Net) is proposed in this paper. Firstly, we design a two-branch framework to capture fine-grained local information while maintaining high-level global semantic information. Besides, Attention guided Information Extraction module (AIE) is introduced between two branches, which suppresses areas of low context information cooperated with global sliding windows. Unlike previous methods, our CSCE-Net learns a content-related Dynamic Sign Function (DSF) to replace the original simple sign function. Therefore, the proposed CSCE-Net is context-sensitive and able to perform well on accurate image binary encoding. We further demonstrate that our CSCE-Net is superior to the existing hashing methods, which improves retrieval performance on standard benchmarks.

Related papers

• Stable Diffusion is a Natural Cross-Modal Decoder for Layered AI-generated Image Compression [7.643300240138419]
  We introduce a scalable cross-modal compression framework that incorporates multiple human-comprehensible modalities. Our framework encodes images into a layered bitstream consisting of a semantic layer that delivers high-level semantic information. Our method proficiently restores both semantic and visual details, competing against baseline approaches at extremely lows.
  arXiv  Detail & Related papers  (2024-12-17T15:01:35Z)
• SEDS: Semantically Enhanced Dual-Stream Encoder for Sign Language Retrieval [82.51117533271517]
  Previous works typically only encode RGB videos to obtain high-level semantic features. Existing RGB-based sign retrieval works suffer from the huge memory cost of dense visual data embedding in end-to-end training. We propose a novel sign language representation framework called Semantically Enhanced Dual-Stream.
  arXiv  Detail & Related papers  (2024-07-23T11:31:11Z)
• Learning Enriched Features for Fast Image Restoration and Enhancement [166.17296369600774]
  This paper presents a holistic goal of maintaining spatially-precise high-resolution representations through the entire network. We learn an enriched set of features that combines contextual information from multiple scales, while simultaneously preserving the high-resolution spatial details. Our approach achieves state-of-the-art results for a variety of image processing tasks, including defocus deblurring, image denoising, super-resolution, and image enhancement.
  arXiv  Detail & Related papers  (2022-04-19T17:59:45Z)
• Deep Asymmetric Hashing with Dual Semantic Regression and Class Structure Quantization [9.539842235137376]
  We propose a dual semantic asymmetric hashing (DSAH) method, which generates discriminative hash codes under three-fold constrains. With these three main components, high-quality hash codes can be generated through network.
  arXiv  Detail & Related papers  (2021-10-24T16:14:36Z)
• A Feature Consistency Driven Attention Erasing Network for Fine-Grained Image Retrieval [23.76079577951216]
  We propose a feature consistency driven attention erasing network (FCAENet) for fine-grained image retrieval. For the first issue, we propose an adaptive augmentation module in FCAENet, which is selective region erasing module (SREM) SREM makes the network more robust on subtle differences of fine-grained task by adaptively covering some regions of raw images. We conduct extensive experiments on five fine-grained benchmark datasets (CUB2011, Aircraft, NABirds, VegFru, Food101) for 12bits, 24bits, 32bits, 48bits hash code.
  arXiv  Detail & Related papers  (2021-10-09T06:51:00Z)
• A Holistically-Guided Decoder for Deep Representation Learning with Applications to Semantic Segmentation and Object Detection [74.88284082187462]
  One common strategy is to adopt dilated convolutions in the backbone networks to extract high-resolution feature maps. We propose one novel holistically-guided decoder which is introduced to obtain the high-resolution semantic-rich feature maps.
  arXiv  Detail & Related papers  (2020-12-18T10:51:49Z)
• Unpaired Image-to-Image Translation via Latent Energy Transport [61.62293304236371]
  Image-to-image translation aims to preserve source contents while translating to discriminative target styles between two visual domains. In this paper, we propose to deploy an energy-based model (EBM) in the latent space of a pretrained autoencoder for this task. Our model is the first to be applicable to 1024$times$1024-resolution unpaired image translation.
  arXiv  Detail & Related papers  (2020-12-01T17:18:58Z)
• ExchNet: A Unified Hashing Network for Large-Scale Fine-Grained Image Retrieval [43.41089241581596]
  We study the novel fine-grained hashing topic to generate compact binary codes for fine-grained images. We propose a unified end-to-end trainable network, termed as ExchNet. Our proposal consistently outperforms state-of-the-art generic hashing methods on five fine-grained datasets.
  arXiv  Detail & Related papers  (2020-08-04T07:01:32Z)
• Unsupervised Deep Cross-modality Spectral Hashing [65.3842441716661]
  The framework is a two-step hashing approach which decouples the optimization into binary optimization and hashing function learning. We propose a novel spectral embedding-based algorithm to simultaneously learn single-modality and binary cross-modality representations. We leverage the powerful CNN for images and propose a CNN-based deep architecture to learn text modality.
  arXiv  Detail & Related papers  (2020-08-01T09:20:11Z)
• Dual-level Semantic Transfer Deep Hashing for Efficient Social Image Retrieval [35.78137004253608]
  Social network stores and disseminates a tremendous amount of user shared images. Deep hashing is an efficient indexing technique to support large-scale social image retrieval. Existing methods suffer from severe semantic shortage when optimizing a large amount of deep neural network parameters. We propose a Dual-level Semantic Transfer Deep Hashing (DSTDH) method to alleviate this problem.
  arXiv  Detail & Related papers  (2020-06-10T01:03:09Z)
• Error-Corrected Margin-Based Deep Cross-Modal Hashing for Facial Image Retrieval [26.706148476396105]
  Cross-modal hashing facilitates mapping of heterogeneous multimedia data into a common Hamming space. We propose a novel cross-modal hashing architecture-deep neural decoder cross-modal hashing (DNDCMH)
  arXiv  Detail & Related papers  (2020-04-03T08:20:08Z)
• Auto-Encoding Twin-Bottleneck Hashing [141.5378966676885]
  This paper proposes an efficient and adaptive code-driven graph. It is updated by decoding in the context of an auto-encoder. Experiments on benchmarked datasets clearly show the superiority of our framework over the state-of-the-art hashing methods.
  arXiv  Detail & Related papers  (2020-02-27T05:58:12Z)

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.