Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Caiping Zhang

dblp:134/8864 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › hashing
binary code learning
0.712023
Hierarchical Semantic Structure Preserving Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2023
Information retrieval › cross-modal retrieval
cross-modal hashing
0.712023
Hierarchical Semantic Structure Preserving Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2023
Information retrieval
cross-modal retrieval
0.712023
Hierarchical Semantic Structure Preserving Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2023
Information retrieval
retrieval models
0.712023
Hierarchical Semantic Structure Preserving Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2023

Methods — techniques the papers use, named apart from their topics

discrete optimization · 0.7deep hashing · 0.7
YearPublicationVenuePosition
2023 Hierarchical Semantic Structure Preserving Hashing for Cross-Modal Retrieval
abstract
Cross-modal hashing has become a vital technique in cross-modal retrieval due to its fast query speed and low storage cost in recent years. Generally, most of the priors supervised cross-modal hashing methods are flat methods which are designed for non-hierarchical labeled data. They treat different categories independently and ignore the inter-category correlations. In practical applications, many instances are labeled with hierarchical categories. The hierarchical label structure provides rich information among different categories. To rationally take use of category correlations, hierarchical cross-modal hashing is proposed. However, existing methods intend to preserve instance-pairwise or class-pairwise similarities, which cannot fully explore the semantic correlations among different categories and make the learned hash codes less discriminative. In this paper, we propose a deep cross-modal hashing method named hierarchical semantic structure preserving hashing (HSSPH), which directly exploits the label hierarchy information to learn discriminative hash codes. Specifically, HSSPH learns a set of class-wise hash codes for each layer. By augmenting class-wise codes with labels, it generates layer-wise prototype codes which reflect the semantic structure of each layer. In order to enhance the discriminative ability of hash codes, HSSPH supervises the hash codes learning with both labels and semantic structures to preserve the hierarchical semantics. Besides, efficient optimization algorithms are developed to directly learn the discrete hash codes for each instance and each class. Extensive experiments on two benchmark datasets show the superiority of HSSPH over several state-of-the-art methods.
Di Wang 0011, Caiping Zhang, Quan Wang 0006, Yumin Tian, Lihuo He, Lin Zhao 0003
IEEE Trans. Multim.2