Cluster-wise unsupervised hashing for cross-modal similarity search

نویسندگان

چکیده

Abstract Cross-modal hashing similarity retrieval plays dual roles across various applications including search engines and autopilot systems. More generally, these methods also known to reduce the computation memory storage in a training scheme. The key limitation of current are that: (i) they relax discrete constrains solve optimization problem which may defeat model purpose, (ii) projecting heterogenous data into latent space encourage loss diverse representations such data, (iii) transforming real-valued point binary codes always resulting information producing suboptimal continuous space. In this paper, we propose novel framework project original points from different modalities its own low-dimensional finds cluster centroid space, using Cluster-wise Unsupervised Hashing (CUH). particular, proposed clustering scheme aims jointly learns compact hash corresponding linear functions. A is developed learn unified under guidance cluster-wise code-prototypes. Extensive experiments over multiple datasets demonstrate effectiveness our comparison with state-of-the-art unsupervised cross-modal tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Generative Adversarial Cross-modal Hashing

Cross-modal hashing aims to map heterogeneous multimedia data into a common Hamming space, which can realize fast and flexible retrieval across different modalities. Unsupervised cross-modal hashing is more flexible and applicable than supervised methods, since no intensive labeling work is involved. However, existing unsupervised methods learn hashing functions by preserving inter and intra co...

متن کامل

Quantized Correlation Hashing for Fast Cross-Modal Search

Cross-modal hashing is designed to facilitate fast search across domains. In this work, we present a cross-modal hashing approach, called quantized correlation hashing (QCH), which takes into consideration the quantization loss over domains and the relation between domains. Unlike previous approaches that separate the optimization of the quantizer independent of maximization of domain correlati...

متن کامل

Parametric Local Multimodal Hashing for Cross-View Similarity Search

Recent years have witnessed the growing popularity of hashing for efficient large-scale similarity search. It has been shown that the hashing quality could be boosted by hash function learning (HFL). In this paper, we study HFL in the context of multimodal data for cross-view similarity search. We present a novel multimodal HFL method, called Parametric Local Multimodal Hashing (PLMH), which le...

متن کامل

Hashing for Similarity Search: A Survey

Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and recently a lot of efforts have been devoted to approximate search. In this paper, we present a survey on one of the main solutions, hashing, which has been widely studied since...

متن کامل

Ranking Preserving Hashing for Fast Similarity Search

Hashing method becomes popular for large scale similarity search due to its storage and computational efficiency. Many machine learning techniques, ranging from unsupervised to supervised, have been proposed to design compact hashing codes. Most of the existing hashing methods generate binary codes to efficiently find similar data examples to a query. However, the ranking accuracy among the ret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2021

ISSN: ['1873-5142', '0031-3203']

DOI: https://doi.org/10.1016/j.patcog.2020.107732