EDMH: Efficient discrete matrix factorization hashing for multi-modal similarity retrieval. Issue 3 (May 2023)
- Record Type:
- Journal Article
- Title:
- EDMH: Efficient discrete matrix factorization hashing for multi-modal similarity retrieval. Issue 3 (May 2023)
- Main Title:
- EDMH: Efficient discrete matrix factorization hashing for multi-modal similarity retrieval
- Authors:
- Yang, Fan
Ding, Xiaojian
Ma, Fumin
Tong, Deyu
Cao, Jie - Abstract:
- Abstract: Hashing has been an emerging topic and has recently attracted widespread attention in multi-modal similarity search applications. However, most existing approaches rely on relaxation schemes to generate binary codes, leading to large quantization errors. In addition, amounts of existing approaches embed labels into the pairwise similarity matrix, leading to expensive time and space costs and losing category information. To address these issues, we propose an Efficient Discrete Matrix factorization Hashing (EDMH). Specifically, EDMH first learns the latent subspaces for individual modality through matrix factorization strategy, which preserves the semantic structure representation information of each modality. In particular, we develop a semantic label offset embedding learning strategy, improving the stability of label embedding regression. Furthermore, we design an efficient discrete optimization scheme to generate compact binary codes discretely. Eventually, we present two efficient learning strategies EDMH-L and EDMH-S to pursue high-quality hash functions. Extensive experiments on various widely-used databases verify that the proposed algorithms produce significant performance and outperform some state-of-the-art approaches, with an average improvement of 2.50% (for Wiki), 2.66% (for MIRFlickr) and 2.25% (for NUS-WIDE) over the best available results, respectively. Highlights: We develop an effective EDMH framework to achieve high-quality multi-modal hashAbstract: Hashing has been an emerging topic and has recently attracted widespread attention in multi-modal similarity search applications. However, most existing approaches rely on relaxation schemes to generate binary codes, leading to large quantization errors. In addition, amounts of existing approaches embed labels into the pairwise similarity matrix, leading to expensive time and space costs and losing category information. To address these issues, we propose an Efficient Discrete Matrix factorization Hashing (EDMH). Specifically, EDMH first learns the latent subspaces for individual modality through matrix factorization strategy, which preserves the semantic structure representation information of each modality. In particular, we develop a semantic label offset embedding learning strategy, improving the stability of label embedding regression. Furthermore, we design an efficient discrete optimization scheme to generate compact binary codes discretely. Eventually, we present two efficient learning strategies EDMH-L and EDMH-S to pursue high-quality hash functions. Extensive experiments on various widely-used databases verify that the proposed algorithms produce significant performance and outperform some state-of-the-art approaches, with an average improvement of 2.50% (for Wiki), 2.66% (for MIRFlickr) and 2.25% (for NUS-WIDE) over the best available results, respectively. Highlights: We develop an effective EDMH framework to achieve high-quality multi-modal hash codes. We conceive a semantic label offset embedded learning scheme. We design efficient optimization mechanism without any relaxation. We present two efficient learning strategies to pursue high-quality hash functions. Experimental results demonstrate the superiority of our method in accuracy and efficiency. … (more)
- Is Part Of:
- Information processing & management. Volume 60:Issue 3(2023)
- Journal:
- Information processing & management
- Issue:
- Volume 60:Issue 3(2023)
- Issue Display:
- Volume 60, Issue 3 (2023)
- Year:
- 2023
- Volume:
- 60
- Issue:
- 3
- Issue Sort Value:
- 2023-0060-0003-0000
- Page Start:
- Page End:
- Publication Date:
- 2023-05
- Subjects:
- Cross-modal retrieval -- Similarity search -- Supervised hashing -- Discrete optimization -- Matrix factorization
Information storage and retrieval systems -- Periodicals
Information science -- Periodicals
Systèmes d'information -- Périodiques
Sciences de l'information -- Périodiques
Information science
Information storage and retrieval systems
Periodicals
658.4038 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03064573 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.ipm.2023.103301 ↗
- Languages:
- English
- ISSNs:
- 0306-4573
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4493.893000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 27044.xml