Demo Data from EDBT 2026 / reviewers in the wild / expert
Lu Wang 0048
dblp:49/3800-48
· DBLP profile ↗
3ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0002-9376-0599ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › hashing
binary code learning |
0.6 | 1 | 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2022 |
Information retrieval › cross-modal retrieval
cross-modal hashing |
0.6 | 1 | 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2022 |
Information retrieval
cross-modal retrieval |
0.6 | 1 | 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2022 |
Information retrieval
discrete optimization |
0.6 | 1 | 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2022 |
Information retrieval
retrieval models |
0.6 | 1 | 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal Retrieval · IEEE Trans. Multim. 2022 |
Methods — techniques the papers use, named apart from their topics
quantization · 0.6discrete iterative optimization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Asymmetric Correlation Quantization Hashing for Cross-Modal RetrievalabstractIn recent years, cross-modal hashing (CMH) has attracted considerable attention due to its ability to learn across different modalities and its high efficiency for similarity retrieval applications. This procedure is computationally inexpensive when dealing with large-scale multi-modalities datasets. However, they do not form the ideal representative model to fully exploit multi-modal data’s underlying properties despite their successful performance. We identify that: (i) most CMH models in their current forms transform the real data points into discrete compact binary codes, which can limit their ability to prevent the loss of important information and thereby produce suboptimal results. (ii) the discrete-binary constraint model is hard to implement, and relaxing the binary constraints is a common property in most existing methods, which often leads to significant quantization errors. (iii) handling the CMH in a symmetry domain leads to a complex and inefficient optimization problem. This paper addresses the above challenges and proposes a novel Asymmetric Correlation Quantization Hashing (ACQH) method. ACQH learns a projection matrix for each heterogeneous modality to map the data point into a low-dimensional semantic space and constructs a compositional quantization to generate hash codes, using the pairwise semantic similarity preservation and the pointwise label regression. As a specific instantiation of our model, we use discrete iterative optimization to obtain the unified hash codes across different modalities. Extensive experiments show that ACQH outperforms state-of-the-art methods on several diverse datasets. Lu Wang 0048, Masoumeh Zareapoor, Jie Yang 0002, Zhonglong Zheng |
IEEE Trans. Multim. | 1 |
| 2021 | Cluster-wise unsupervised hashing for cross-modal similarity search
Lu Wang 0048, Jie Yang 0002, Masoumeh Zareapoor, Zhonglong Zheng |
Pattern Recognit. | 1 |
| 2018 | Discrete Sparse Hashing for Cross-Modal Similarity Search
Lu Wang 0048, Chao Ma 0005, Enmei Tu, Jie Yang 0002, Nikola K. Kasabov |
ICONIP (4) | 1 |