Demo Data from VLDB 2026 / reviewers in the wild / expert
Yanqiang Lei
dblp:52/8843
· DBLP profile ↗
8ranked-venue papers
4as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-authorSecurity and privacy · 1
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.
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 61% Image and video processing · 30% Visualization and visual analytics · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing
coarse-to-fine search |
0.1 | 1 | 2012 | Near-Duplicate Image Detection in a Visually Salient Riemannian Space · IEEE Trans. Inf. Forensics Secur. 2012 |
Multimedia analysis and retrieval
image retrieval |
0.1 | 1 | 2012 | Near-Duplicate Image Detection in a Visually Salient Riemannian Space · IEEE Trans. Inf. Forensics Secur. 2012 |
Multimedia analysis and retrieval › near-duplicate detection
near-duplicate image detection |
0.1 | 1 | 2012 | Near-Duplicate Image Detection in a Visually Salient Riemannian Space · IEEE Trans. Inf. Forensics Secur. 2012 |
Visualization and visual analytics
visual saliency |
0.0 | 1 | 2012 | Near-Duplicate Image Detection in a Visually Salient Riemannian Space · IEEE Trans. Inf. Forensics Secur. 2012 |
Methods — techniques the papers use, named apart from their topics
visual saliency model · 0.1riemannian metric · 0.1log-euclidean metric · 0.1affine-invariant metric · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Data augmentation of flavor information for electronic nose and electronic tongue: An olfactory-taste synesthesia model combined with multiblock reconstruction method
Wenbo Zheng 0002, Ancai Zhang, Yanqiang Lei, Guangyuan Pan |
Expert Syst. Appl. | 4 |
| 2023 | CVTE-Poly: A New Benchmark for Chinese Polyphone Disambiguation
Siheng Zhang, Xingjun Tan, Yanqiang Lei, Xianxiang Wang, Zhizhong Zhang 0001, Yuan Xie 0006 |
INTERSPEECH | 3 |
| 2014 | Geometric invariant features in the Radon transform domain for near-duplicate image detection
Yanqiang Lei, Ligang Zheng, Jiwu Huang |
Pattern Recognit. | 1 |
| 2014 | Fast Near-Duplicate Image Detection Using Uniform Randomized TreesabstractIndexing structure plays an important role in the application of fast near-duplicate image detection, since it can narrow down the search space. In this article, we develop a cluster of uniform randomized trees (URTs) as an efficient indexing structure to perform fast near-duplicate image detection. The main contribution in this article is that we introduce “uniformity” and “randomness” into the indexing construction. The uniformity requires classifying the object images into the same scale subsets. Such a decision makes good use of the two facts in near-duplicate image detection, namely: (1) the number of categories is huge; (2) a single category usually contains only a small number of images. Therefore, the uniform distribution is very beneficial to narrow down the search space and does not significantly degrade the detection accuracy. The randomness is embedded into the generation of feature subspace and projection direction, improveing the flexibility of indexing construction. The experimental results show that the proposed method is more efficient than the popular locality-sensitive hashing and more stable and flexible than the traditional KD-tree. Yanqiang Lei, Guoping Qiu, Ligang Zheng, Jiwu Huang |
ACM Trans. Multim. Comput. Commun. Appl. | 1 |
| 2012 | Video Sequence Matching Based on the Invariance of Color CorrelationabstractVideo sequence matching aims to locate a query video clip in a video database. It plays an important role in reducing storage redundancy and detecting video copies for copyright protection. In this paper, we propose an effective method for video sequence matching based on the invariance of color correlation. The proposed method first splits each key-frame into nonoverlapping blocks. For each block, we sort the red, green, and blue color components according to their average intensities, and use the percentage of the color correlation to generate a frame feature with a small size. Finally, the resulting video feature is made up of the consecutive frame features, which is demonstrated to be robust against most typical video content-preserving operations, including geometric distortion, blurring, noise contamination, contrast enhancement, and strong re-encoding. The experimental results show that the proposed method outperforms the existing methods in the literature, as well as the method based on the traditional color histogram. Furthermore, the time and space complexity of our algorithm are both satisfactory, which are very important for many real-time applications. Yanqiang Lei, Weiqi Luo 0001, Yuan-Gen Wang, Jiwu Huang |
IEEE Trans. Circuits Syst. Video Technol. | 1 |
| 2012 | Near-Duplicate Image Detection in a Visually Salient Riemannian SpaceabstractThis paper presents a framework for near-duplicate image detection in a visually salient Riemannian space. A visual saliency model is first used to identify salient regions of the image and then the salient region covariance matrix (SCOV) of various image features is computed. SCOV, which lies in a Riemannian manifold, is used as a robust and compact image content descriptor. An efficient coarse-to-fine Riemannian (CTOFR) image search strategy has been developed to improve efficiency while maintaining accuracy. CTOFR first uses a computationally fast but less accurate log-Euclidean Riemannian metric to do a coarse level search of the entire database and retrieve a subset of likely targets and then uses a computationally expensive but more accurate affine-invariant Riemannian metric to search the returns from the coarse search. We present experimental results to demonstrate that SCOV is a very compact, robust, and discriminative descriptor which is competitive to other state-of-the-art descriptors for near-duplicate image and video detection. We show that CTOFR can yield significant speedups over traditional full search methods without sacrificing accuracy, and that the larger the database the higher the speedup factor. Ligang Zheng, Yanqiang Lei, Guoping Qiu, Jiwu Huang |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2011 | Robust image hash in Radon transform domain for authentication
Yanqiang Lei, Yuan-Gen Wang, Jiwu Huang |
Signal Process. Image Commun. | 1 |
| 2010 | An image copy detection scheme based on radon transformabstractCopy detection aims to identify various content-preserving copies from the same origin and distinguish the different sources. In this paper, we propose a novel feature for image copy detection based on the radon transform (RT). We first theoretically analyze that the proposed feature is invariant against rotation, scaling and translation (RST) operations and robust to lossy JPEG compression and additive noises. The feature can meet the robustness requirements of copy detection applications. The proposed feature is statistically dependent of image content and is capable of capturing unique information of the image for fragility of the copy detection system. The experimental results show that the proposed scheme outperforms the existing methods, when detecting image copies subjected to various transformations, in terms of receiver operating characteristic (ROC) curves. Yuan-Gen Wang, Yanqiang Lei, Jiwu Huang |
ICIP | 2 |