Wenzhu Yan

Dr. Wenzhu Yan


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
WYWenzhu Yan
Wenzhu Yan
MYMing Yang
Ming Yang
YLYanmeng Li
Yanmeng Li
In the fields of pattern recognition and data mining, two problems need to be addressed. First, the curse of dimensionality degrades the performance of many practical data processing techniques. Second, due to the existence of noise and outliers, feature extraction on corrupted data can not be effectively achieved. Recently, some representation based methods have produced promising results. However, these methods cannot handle the case in which nonlinear similarity exists and have failed to provide the quantized interpretability for the importance of features. In this paper, we propose a novel low rank and sparse representation method to realize dimensionality reduction and robustly extract latent low dimensional discriminative features. Specifically, we first adopt multiple kernel learning to map the original data into an embedded reproducing kernel Hilbert space (RKHS) and then kernel based similarity discriminative projection is learned to explore the within-class and between-class variability. Notably, this low dimensional feature learning strategy is definitely integrated into the low rank matrix recovery of the kernel matrix. Next, we introduce the regularization of l2;1 norm on error matrix to eliminate noise and on projection matrix to lead the selected features to be more compact and interpretable. The non-convex optimization problem is effectively solved by the alternating direction method of multipliers (ADM-M) methods. Extensive experiments on seven benchmark datasets are conducted to demonstrate the effectiveness of our method.

13 June 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
WYWanqi Yang
Wanqi Yang
LXLike Xin
Like Xin
LWLei Wang
Lei Wang
MYMing Yang
Ming Yang
WYWenzhu Yan
Wenzhu Yan
Yang GaoYang Gao
Yang Gao
In real applications, several unpredictable or uncertain factors could result in unpaired multiview data, i.e., the observed samples between views cannot be matched. Since joint clustering among views is more effective than individual clustering in each view, we investigate unpaired multiview clustering (UMC), which is a valuable but insufficiently studied problem. Due to lack of matched samples between views, we could fail to build the connection between views. Therefore, we aim to learn the latent subspace shared by views. However, existing multiview subspace learning methods usually rely on the matched samples between views. To address this issue, we propose an iterative multiview subspace learning strategy iterative unpaired multiview clustering (IUMC), aiming to learn a complete and consistent subspace representation among views for UMC. Moreover, based on IUMC, we design two effective UMC methods: 1) Iterative unpaired multiview clustering via covariance matrix alignment (IUMC-CA) that further aligns the covariance matrix of subspace representations and then performs clustering on the subspace and 2) iterative unpaired multiview clustering via one-stage clustering assignments (IUMC-CY) that performs one-stage multiview clustering (MVC) by replacing the subspace representations with clustering assignments. Extensive experiments show the excellent performance of our methods for UMC, compared with the state-of-the-art methods. Also, the clustering performance of observed samples in each view can be considerably improved by those observed samples from the other views. In addition, our methods have good applicability in incomplete MVC.

5 May 2025 in Multimedia Systems
Verified
Journal Article
Closed access
PDF file
JLJianqiu Li
Jianqiu Li
WYWenzhu Yan
Wenzhu Yan
YLYanmeng Li
Yanmeng Li

20 October 2024 in Multimedia Systems
Verified
Journal Article
Closed access
PDF file
YGYao Guan
Yao Guan
JYJiayi Yao
Jiayi Yao
WYWenzhu Yan
Wenzhu Yan
YLYanmeng Li
Yanmeng Li


8 May 2025 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
YLYanmeng Li
Yanmeng Li
WYWenzhu Yan
Wenzhu Yan
Convex Hull Representation and Learning (CHRL) has drawn great attention for set oriented data analysis. The traditional methods focus on representing set samples in a linear/affine feature space, which can be regarded as a convex geometric region spanned by its feature points. However, the non-Euclidean structure originating from these data is largely ignored by previous CHRLs. To deal with this problem, we propose a new Manifold Convex Hull Collaborative Representation (MCHCR) framework from geometry-aware perspective. Notably, we establish convex hull for Grassmann manifold points modeled by image sets, and then fully exploit the relationships between different sets by collaborative representation mechanism with a closed form solution. Our method definitely inherits the rich representability of Grassmann manifold and high flexibility of convex hull model. Moreover, we interpret the intrinsic classification mechanism of MCHCR under a solid theoretical analysis from probability perspective. Finally, the effectiveness of the proposed learning framework is effectively demonstrated on various benchmark datasets.