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

Wei Jiang 0007

dblp:21/3839-7 · DBLP profile ↗
← Back
17ranked-venue papers
9as first author
5since 2021 · last 2026
0000-0003-0820-588XORCID · conflict

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

Artificial intelligence and machine learning · 10 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 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
Data mining · 100%
Artificial intelligence
1 paper
Graph learning · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering › high-dimensional clustering › subspace clustering
multi-view subspace clustering
0.712023
Selecting the Best Part From Multiple Laplacian Autoencoders for Multi-View Subspace Clustering · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering › high-dimensional clustering
subspace clustering
0.712023
Selecting the Best Part From Multiple Laplacian Autoencoders for Multi-View Subspace Clustering · IEEE Trans. Knowl. Data Eng. 2023
Multimedia analysis and retrieval › image retrieval
content-based image retrieval
0.112006
Similarity-based online feature selection in content-based image retrieval · IEEE Trans. Image Process. 2006
Multimedia analysis and retrieval › image retrieval › content-based image retrieval
region-based image retrieval
0.112006
Similarity-based online feature selection in content-based image retrieval · IEEE Trans. Image Process. 2006
Multimedia analysis and retrieval › interactive retrieval
relevance feedback
0.112006
Similarity-based online feature selection in content-based image retrieval · IEEE Trans. Image Process. 2006

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

laplacian regularization · 1.3graph fusion · 1.3autoencoder · 1.3fuzzy features · 0.1boosting · 0.1
YearPublicationVenuePosition
2026 Enhanced schatten quasi-norm approximation for low tubal rank tensor completion
Wei Jiang 0007, Xiyi Yuan, Kewei Tang, Nan Zhang 0014, Huiling Chen 0001, Heng Qi
Neurocomputing1
2025 Adaptive feature alignment network with noise suppression for cross-domain object detection
Wei Jiang 0007, Yujie Luan, Kewei Tang, Nan Zhang 0014, Huiling Chen 0001, Heng Qi
Neurocomputing1
2023 Robust low tubal rank tensor completion via factor tensor norm minimization
Wei Jiang 0007, Changsheng Zhang 0005, Heng Qi
Pattern Recognit.1
2023 Selecting the Best Part From Multiple Laplacian Autoencoders for Multi-View Subspace Clustering
abstract
The multi-view subspace clustering attracts much attention in recent years. Most methods follow the framework of fusing the affinity graph learned in each view. In this framework, both the fusion strategy and built graph of each view are very important. In this paper, we propose novel methods for multi-view subspace clustering to address these two aspects. On the one hand, we adopt the autoencoders with Laplacian regularization to construct the affinity graph in each view. Compared with previous work employing the autoencoders, the Laplacian term in our method can guide the learned latent representation favoring affinity extraction. Besides, we also discuss the reasons for adding Laplacian regularization. On the other hand, we propose a novel fusion strategy distinguished from the related literature. If the affinity graph of some view is not extracted well, the performance of previous fusion strategies will be seriously affected. Since our strategy can choose the best part from each affinity graph, it can overcome this limitation to some extent. Extensive experimental results on multiple benchmark data sets confirm the effectiveness of our method.
Kewei Tang, Kaiqiang Xu, Wei Jiang 0007, Zhixun Su, Xiyan Sun
IEEE Trans. Knowl. Data Eng.3
2022 Consistent auto-weighted multi-view subspace clustering
Kewei Tang, Liying Cao, Nan Zhang 0014, Wei Jiang 0007
Pattern Anal. Appl.4
2019 Superpixels for large dataset subspace clustering
Kewei Tang, Zhixun Su, Wei Jiang 0007, Jie Zhang 0056
Neural Comput. Appl.3
2019 Robust subspace learning-based low-rank representation for manifold clustering
Kewei Tang, Zhixun Su, Wei Jiang 0007, Jie Zhang 0056, Xiyan Sun
Neural Comput. Appl.3
2019 Bayesian rank penalization
Kewei Tang, Zhixun Su, Jie Zhang 0056, Lihong Cui, Wei Jiang 0007, Xiyan Sun
Neural Networks5
2019 Subspace segmentation with a large number of subspaces using infinity norm minimization
Kewei Tang, Zhixun Su, Yang Liu 0119, Wei Jiang 0007, Jie Zhang 0056, Xiyan Sun
Pattern Recognit.4
2018 Nonnegative matrix factorization by joint locality-constrained and ℓ 2, 1-norm regularization
Wei Jiang 0007, Kewei Tang
Multim. Tools Appl.3
2016 Subspace Learning Based Low-Rank Representation
Kewei Tang, Xiaodong Liu 0001, Zhixun Su, Wei Jiang 0007, Jiangxin Dong
ACCV (1)4
2016 Robust subspace segmentation via nonconvex low rank representation
Wei Jiang 0007, Heng Qi, Qionghai Dai
Inf. Sci.1
2006 Similarity-based online feature selection in content-based image retrieval
abstract
Content-based image retrieval (CBIR) has been more and more important in the last decade, and the gap between high-level semantic concepts and low-level visual features hinders further performance improvement. The problem of online feature selection is critical to really bridge this gap. In this paper, we investigate online feature selection in the relevance feedback learning process to improve the retrieval performance of the region-based image retrieval system. Our contributions are mainly in three areas. 1) A novel feature selection criterion is proposed, which is based on the psychological similarity between the positive and negative training sets. 2) An effective online feature selection algorithm is implemented in a boosting manner to select the most representative features for the current query concept and combine classifiers constructed over the selected features to retrieve images. 3) To apply the proposed feature selection method in region-based image retrieval systems, we propose a novel region-based representation to describe images in a uniform feature space with real-valued fuzzy features. Our system is suitable for online relevance feedback learning in CBIR by meeting the three requirements: learning with small size training set, the intrinsic asymmetry property of training samples, and the fast response requirement. Extensive experiments, including comparisons with many state-of-the-arts, show the effectiveness of our algorithm in improving the retrieval performance and saving the processing time.
Wei Jiang 0007, Guihua Er, Qionghai Dai, Jinwei Gu
IEEE Trans. Image Process.1
2005 Relevance Feedback Learning With Feature Selection In Region-Based Image Retrieval
abstract
Region-based image retrieval and relevance feedback are two important methods to bridge the gap between the low-level visual features and the high-level semantic concepts in content-based image retrieval. In this paper, we address the issue of introducing the relevance feedback mechanism into the region-based image retrieval with online feature selection during each feedback round. Our contribution is two-fold. (1) A novel region-based image representation is proposed. Based on a generative model, a fuzzy codebook is extracted from the original region-based features, which represents the images in a uniform real-value feature space. (2) A feature selection criterion is developed and an effective relevance feedback algorithm is implemented in a boosting manner to simultaneously select the optimal features from the fuzzy codebook, and generate a strong ensemble classifier over the selected features. Experimental results show that the proposed scheme can substantially improve the retrieval performance of the region-based image retrieval system.
Wei Jiang 0007, Guihua Er, Qionghai Dai, Lian Zhong, Yao Hou
ICASSP (2)1
2005 Hidden annotation for image retrieval with long-term relevance feedback learning
Wei Jiang 0007, Guihua Er, Qionghai Dai, Jinwei Gu
Pattern Recognit.1
2004 Multiple boosting SVM active learning for image retrieval
abstract
Content-based image retrieval can be viewed as a classification problem, and the small sample size leaning difficulty makes it difficult for most CBIR classifiers to get satisfactory performance. In this paper, using the SVM classifier as the component classifier, the method of ensemble of classifiers is incorporated into the relevance feedback process to alleviate this problem from two aspects: (1) within each feedback round, multiple parallel component classifiers are constructed, one over one feature subspace individually, and then are merged together to get an ensemble classifier; (2) during feedback rounds, a boosting method is incorporated to sequentially combine the component classifiers over each feature subspace respectively, which further improves the classification result. Experiments over 5000 images show that the proposed method can improve the retrieval performance consistently, without loss of efficiency.
Wei Jiang 0007, Guihua Er, Qionghai Dai
ICASSP (3)1
2004 Multi-layer semantic representation learning for image retrieval
abstract
Long-term relevance feedback learning is an important learning mechanism in content-based image retrieval. In this paper, our work has two contributions: (1) A multilayer semantic representation (MSR) is proposed and an algorithm is implemented to automatically build the MSR for image database through long-term relevance feedback learning. (2) The accumulated MSR is incorporated with the short-term feedback learning to help subsequent users' retrieval. The MSR memorizes the multicorrelation among images and integrates these memories to build hidden semantic concepts for images, which are distributed in multiple semantic layers. In experiment, an MSR is built based on the real retrieval from 10 different users, which can precisely describe the hidden concepts underlying images and help to bridge the gap between high-level concepts and low-level features and thus improve the retrieval performance significantly.
Wei Jiang 0007, Guihua Er, Qionghai Dai
ICIP1