Sparse Tikhonov-Regularized Hashing for Multi-Modal Learning
Authors:
- 1 October 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3793-3797
Abstract
This paper mainly focuses on the role of regularization in Multi-Modal Learning (MML). Existing MML studies devote most of the efforts in maximizing the consensus of models from cues of different modalities. However, regularization methods are still far from fully explored. To fill in this gap, we propose a compact and efficient coding solution, termed by sparse Tikhonov-Regularized Hashing (STRH). The STRH enforces both the ℓ 0 -norm induced sparsity constraints and the Tikhonov regularization on the binary solution vectors which maximize cross-modal correlation. In addition, we raise the concerns on the challenging testing scenario of `Multi-modal Learning and Single-modal Prediction' (MLSP). Finally, we demonstrate that the STRH is an efficient hashing solutions by showing its superiority under the MLSP scenario.Keywords
This publication has 14 references indexed in Scilit:
- Learning Binary Codes for Maximum Inner Product Search2015
- Alternating Co-Quantization for Cross-Modal Hashing2015
- Supervised Discrete Hashing2015
- Multi-View Discriminant AnalysisIEEE Transactions on Pattern Analysis and Machine Intelligence, 2015
- Collaborative Hashing2014
- A Spontaneous Micro-expression Database: Inducement, collection and baseline2013
- Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image RetrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Generalized Multiview Analysis: A discriminative latent space2012
- The Pascal Visual Object Classes (VOC) ChallengeInternational Journal of Computer Vision, 2009
- A New Alternating Minimization Algorithm for Total Variation Image ReconstructionSIAM Journal on Imaging Sciences, 2008