• Corpus ID: 168169664

Weakly-paired Cross-Modal Hashing

  title={Weakly-paired Cross-Modal Hashing},
  author={Xuanwu Liu and J. Wang and Guoxian Yu and Carlotta Domeniconi and Xiangliang Zhang},
Hashing has been widely adopted for large-scale data retrieval in many domains, due to its low storage cost and high retrieval speed. Existing cross-modal hashing methods optimistically assume that the correspondence between training samples across modalities are readily available. This assumption is unrealistic in practical applications. In addition, these methods generally require the same number of samples across different modalities, which restricts their flexibility. We propose a flexible… 
1 Citations

Figures and Tables from this paper

Meta Cross-Modal Hashing on Long-Tailed Data
This paper introduces a meta-learning based crossmodal hashing method (MetaCMH) to handle long-tailed data and shows that MetaCMH performs significantly better than state-of-theart methods, especially on the tail classes.


Weakly Paired Multimodal Fusion for Object Recognition
A novel projective dictionary learning framework for weakly paired multimodal data fusion is established by introducing a latent pairing matrix, which realizes the simultaneous dictionary learning and the pairing matrix estimation, and therefore improves the fusion effect.
Weakly-paired deep dictionary learning for cross-modal retrieval
Spectral Embedded Hashing for Scalable Image Retrieval
A new regularizer is introduced into the objective function of the recent work spectral hashing to control the mismatch between the resultant hamming embedding and the low-dimensional data representation, which is obtained by using a linear regression function.
A Survey on Learning to Hash
This paper presents a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise Similarity preserving, implicit similarity preserve, as well as quantization, and discusses their relations.
Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization
A novel SMH method, called semantic correlation maximization~(SCM), is proposed to seamlessly integrate semantic labels into the hashing learning procedure for large-scale data modeling, and experimental results show that SCM can significantly outperform the state-of-the-art SMH methods, in terms of both accuracy and scalability.
Learning to Hash for Indexing Big Data—A Survey
A comprehensive survey of the learning-to-hash framework and representative techniques of various types, including unsupervised, semisupervised, and supervised, is provided and recent hashing approaches utilizing the deep learning models are summarized.
Weakly-Paired Maximum Covariance Analysis for Multimodal Dimensionality Reduction and Transfer Learning
This work uses a latent variable approach to solve the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at application time.
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections by proposing a simple and efficient alternating minimization algorithm, dubbed iterative quantization (ITQ), and demonstrating an application of ITQ to learning binary attributes or "classemes" on the ImageNet data set.
Multi-view clustering on unmapped data via constrained non-negative matrix factorization
Cross-View Retrieval via Probability-Based Semantics-Preserving Hashing
This paper proposes an effective probability-based semantics-preserving hashing method (SePH) method to tackle the problem of cross-view retrieval, and conducts extensive experiments on diverse benchmark datasets to evaluate the proposed SePH.