paper-with-me

Papers

Beyond Post-Quantization: Native Hash Learning with a Dedicated HASH Token

2026-07-03 · Xinze Liu, Ding Wang, Hengjie Zhu, Dayan Wu arxiv

Efficient large-scale image retrieval requires compact representations that preserve semantic similarity under fast Hamming-space search. Deep hashing is appealing, but most existing CNN- and ViT-based methods still follow a post-quantization paradigm, where continuous visual features are first learned and binary codes are then produced by a terminal hash projection or binarization operation. This late code generation creates a feature-to-code discrepancy between the continuously optimized representation space and the discrete Hamming space used for retrieval. To address this limitation, we propose HashViT, a Vision Transformer framework for native hash token learning. Instead of treating hashing as a terminal readout, HashViT introduces a dedicated HASH token that serves as a persistent, hash-oriented retrieval state inside the transformer. The HASH token is structurally decomposed into a Hash Register for direct binary code generation and a Semantic Workspace for preserving auxiliary continuous semantics. To enable effective workspace-to-register interaction, we further design a lightweight Hash Refinement Adapter that progressively refines the Hash Register across transformer layers. As a result, binary-oriented representations are formed through token evolution within the backbone, rather than being abruptly induced by an output-level projection. HashViT is optimized with a unified objective that combines learnable semantic center supervision, class-token similarity distillation, and quantization regularization, encouraging the HASH token to encode semantically structured and compact binary representations. Extensive experiments on three widely used benchmarks demonstrate that HashViT achieves state-of-the-art or highly competitive retrieval performance while preserving the efficiency of compact Hamming codes. Code is available at https://github.com/Xinze919/HashViT.

📄 PDF Abstract BibTeX arXiv:2607.03328

Code (0)

등록된 구현이 없습니다.

Tasks

Semantic SimilarityCode GenerationImage Retrieval

Similar Papers 제목 키워드 기반

Deep Asymmetric Hashing with Dual Semantic Regression and Class Structure Quantization

2021-10-24 · Jianglin Lu, Hailing Wang, Jie zhou, Mengfan Yan 외

Recently, deep hashing methods have been widely used in image retrieval task. Most existing deep hashing approaches adopt one-to-one quantization to reduce information loss. However, such class-unrelated quantization can…

Deep HashingImage RetrievalQuantizationregression+1

One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching

2022-05-31 · CVPR 2022 1 · Khoa D. Doan, Peng Yang, Ping Li

Image hashing is a principled approximate nearest neighbor approach to find similar items to a query in a large collection of images. Hashing aims to learn a binary-output function that maps an image to a binary vector. …

Deep HashingQuantizationRetrievalvalid

Deep Hashing with Triplet Quantization Loss

2017-10-31 · Yuefu Zhou, Shanshan Huang, Ya zhang, Yan-Feng Wang

With the explosive growth of image databases, deep hashing, which learns compact binary descriptors for images, has become critical for fast image retrieval. Many existing deep hashing methods leverage quantization loss,…

Deep HashingImage RetrievalQuantizationRetrieval+1

Learning Discriminative Hashing Codes for Cross-Modal Retrieval based on Multi-view Features

2018-08-13 · Jun Yu, Xiao-Jun Wu, Josef Kittler

Hashing techniques have been applied broadly in retrieval tasks due to their low storage requirements and high speed of processing. Many hashing methods based on a single view have been extensively studied for informatio…

Cross-Modal RetrievalInformation RetrievalQuantizationRetrieval

One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective

2021-09-29 · NeurIPS 2021 12 · Jiun Tian Hoe, Kam Woh Ng, Tianyu Zhang, Chee Seng Chan 외

A deep hashing model typically has two main learning objectives: to make the learned binary hash codes discriminative and to minimize a quantization error. With further constraints such as bit balance and code orthogonal…

AllDeep HashingMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION+2