Yihang Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yihang Lu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Feiping Nie
Northwestern Polytechnical University
8 shared publications - Rong Wang
School of Artificial Intelligence, Optics and Electronics (iOPEN), and the Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), Northwestern Polytechnical University, Xian, China
8 shared publications - Haonan Xin
School of Artificial Intelligence, Optics and Electronics (iOPEN), and the Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), Northwestern Polytechnical University, Xian, China
4 shared publications - Xuelong Li
Institute of Artificial Intelligence (TeleAI), China Telecom, Shanghai, China
3 shared publications - Zhe Cao
Northwestern Polytechnical University
3 shared publications Feiping Nie
2 shared publications
Latest Publications
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. PP (01962892) , 1
Spatial-Spectral Bipartite Graph Clustering with Low-Frequency Tensor Regularization for Hyperspectral and LiDAR Data
The increasing complexity of remote sensing (RS) applications necessitates multimodal data fusion to overcome the inherent limitations of single-source data. In particular, the integration of hyperspectral images (HSI) and LiDAR data captures complementary spectral and spatial features, significantly enhancing object discrimination. Unlike supervised methods requiring costly expert annotations, unsupervised clustering eliminates labeling needs, thereby offering an efficient solution for complex scene analysis with reduced deployment costs. However, existing unsupervised clustering methods still face several challenges, including insufficient utilization of spatial information, high data dimensionality, and interference from high-frequency noise, which collectively hinder their further development and practical application. To address these issues, this paper proposes a novel method called Spatial-Spectral Bipartite Graph Clustering with Low-Frequency Tensor Regularization (SSBC-LFT) for Hyperspectral and LiDAR Data. The proposed method first focuses on modeling clustering structures, innovatively constructing spatially-informed bipartite graphs for each modality to enrich spatial details while reducing computational complexity. Additionally, an adaptive spectral band selection mechanism dynamically assigns higher weights to discriminative bands during clustering while suppressing redundant ones. Finally, through proposed Low-frequency Tensor Nuclear Norm regularization, high-frequency noise is effectively filtered in the frequency domain, extracting stable and consistent cross-modal structural information from the low-rank space to further enhance clustering robustness and accuracy. Extensive experiments on real-world multimodal RS datasets demonstrate the superior performance of SSBC-LFT model, offering a robust and effective solution for unsupervised clustering in complex scenarios.
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. PP (01962892) , 1
Spatial-Spectral Bipartite Graph Clustering with Low-Frequency Tensor Regularization for Hyperspectral and LiDAR Data
The increasing complexity of remote sensing (RS) applications necessitates multimodal data fusion to overcome the inherent limitations of single-source data. In particular, the integration of hyperspectral images (HSI) and LiDAR data captures complementary spectral and spatial features, significantly enhancing object discrimination. Unlike supervised methods requiring costly expert annotations, unsupervised clustering eliminates labeling needs, thereby offering an efficient solution for complex scene analysis with reduced deployment costs. However, existing unsupervised clustering methods still face several challenges, including insufficient utilization of spatial information, high data dimensionality, and interference from high-frequency noise, which collectively hinder their further development and practical application. To address these issues, this paper proposes a novel method called Spatial-Spectral Bipartite Graph Clustering with Low-Frequency Tensor Regularization (SSBC-LFT) for Hyperspectral and LiDAR Data. The proposed method first focuses on modeling clustering structures, innovatively constructing spatially-informed bipartite graphs for each modality to enrich spatial details while reducing computational complexity. Additionally, an adaptive spectral band selection mechanism dynamically assigns higher weights to discriminative bands during clustering while suppressing redundant ones. Finally, through proposed Low-frequency Tensor Nuclear Norm regularization, high-frequency noise is effectively filtered in the frequency domain, extracting stable and consistent cross-modal structural information from the low-rank space to further enhance clustering robustness and accuracy. Extensive experiments on real-world multimodal RS datasets demonstrate the superior performance of SSBC-LFT model, offering a robust and effective solution for unsupervised clustering in complex scenarios.
- 2 September 2025
- Published by Elsevier in Signal Processing
- Vol. 239
Self-paced and structured graph-based ensemble clustering
- 2 September 2025
- Published by Elsevier in Signal Processing
- Vol. 239
Self-paced and structured graph-based ensemble clustering
- 6 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (6) , 3728-3738
Structured Graph-Based Ensemble Clustering
Ensemble clustering can utilize the complementary information among multiple base clusterings, and obtain a clustering model with better performance and more robustness. Despite its great success, there are still two problems in the current ensemble clustering methods. First, most ensemble clustering methods often treat all base clusterings equally. Second, the final ensemble clustering result often relies on$k$ -means or other discretization procedures to uncover the clustering indicators, thus obtaining unsatisfactory results. To address these issues, we proposed a novel ensemble clustering method based on structured graph learning, which can directly extract clustering indicators from the obtained similarity matrix. Moreover, our methods take sufficient consideration of correlation among the base clusterings and can effectively reduce the redundancy among them. Extensive experiments on artificial and real-world datasets demonstrate the efficiency and effectiveness of our methods.- 6 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (6) , 3728-3738
Structured Graph-Based Ensemble Clustering
Ensemble clustering can utilize the complementary information among multiple base clusterings, and obtain a clustering model with better performance and more robustness. Despite its great success, there are still two problems in the current ensemble clustering methods. First, most ensemble clustering methods often treat all base clusterings equally. Second, the final ensemble clustering result often relies on$k$ -means or other discretization procedures to uncover the clustering indicators, thus obtaining unsatisfactory results. To address these issues, we proposed a novel ensemble clustering method based on structured graph learning, which can directly extract clustering indicators from the obtained similarity matrix. Moreover, our methods take sufficient consideration of correlation among the base clusterings and can effectively reduce the redundancy among them. Extensive experiments on artificial and real-world datasets demonstrate the efficiency and effectiveness of our methods.- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-15
Superpixel-Based Bipartite Graph Clustering Enriched With Spatial Information for Hyperspectral and LiDAR Data
The surge in remote sensing (RS) data underscores the need for improved data diversity and processing. While integrating hyperspectral (HS) and LiDAR data enhances analysis and addresses spectral variability, the high dimensionality, noise, and outliers inherent in hyperspectral images present significant challenges. Additionally, the precise labeling required for HS makes supervised classification labor-intensive, professional-focused, and time-consuming, further motivating the development of advanced HS clustering algorithms to address these issues. Unsupervised clustering addresses the above issues but still struggles due to underutilization of auxiliary spatial and structural information, high data dimensionality with redundant hyperspectral bands, and information divergence from heterogeneity among multimodal data. These challenges impede the effective extraction of consistent structures, undermining clustering stability and overall model performance. To address these challenges, we propose a Superpixel-Based Bipartite Graph Clustering Enriched with Spatial Information for Hyperspectral and LiDAR Data (SBGC) model. Our proposed method fully utilizes spatial information to construct meaningful bipartite graphs for the efficient processing of multimodal remote sensing data. By adopting a projected clustering paradigm, our approach simultaneously clusters and reduces dimensionality, effectively eliminating redundant bands. Additionally, it innovatively stacks multimodal data into tensors, thoroughly exploring the consistent structures in the low-rank space among different modalities. This reduces the heterogeneity-induced information divergence and significantly enhances clustering performance. Extensive experiments on real datasets confirm the method’s effectiveness and advanced capabilities.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-15
Superpixel-Based Bipartite Graph Clustering Enriched With Spatial Information for Hyperspectral and LiDAR Data
The surge in remote sensing (RS) data underscores the need for improved data diversity and processing. While integrating hyperspectral (HS) and LiDAR data enhances analysis and addresses spectral variability, the high dimensionality, noise, and outliers inherent in hyperspectral images present significant challenges. Additionally, the precise labeling required for HS makes supervised classification labor-intensive, professional-focused, and time-consuming, further motivating the development of advanced HS clustering algorithms to address these issues. Unsupervised clustering addresses the above issues but still struggles due to underutilization of auxiliary spatial and structural information, high data dimensionality with redundant hyperspectral bands, and information divergence from heterogeneity among multimodal data. These challenges impede the effective extraction of consistent structures, undermining clustering stability and overall model performance. To address these challenges, we propose a Superpixel-Based Bipartite Graph Clustering Enriched with Spatial Information for Hyperspectral and LiDAR Data (SBGC) model. Our proposed method fully utilizes spatial information to construct meaningful bipartite graphs for the efficient processing of multimodal remote sensing data. By adopting a projected clustering paradigm, our approach simultaneously clusters and reduces dimensionality, effectively eliminating redundant bands. Additionally, it innovatively stacks multimodal data into tensors, thoroughly exploring the consistent structures in the low-rank space among different modalities. This reduces the heterogeneity-induced information divergence and significantly enhances clustering performance. Extensive experiments on real datasets confirm the method’s effectiveness and advanced capabilities.
- Top Cited Papers
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 11064-11077
Structured Doubly Stochastic Graph-Based Clustering
Graph-based clustering is a hot topic in machine learning, whose effectiveness highly relies on the quality of the learned graph. Recent researches preferred to learn the nearest doubly stochastic approximation of a graph to suppress intercluster connections and enhance intracluster connections and thus improve clustering performance. While current paradigm is limited by three key problems: 1) it is restricted by a predefined graph; 2) the separated stages of spectral decomposition-based way (graph learning, spectral embedding learning, and cluster assignment by k-means) cause mismatched problems and randomness; and 3) the optimization of doubly stochastic conditions is generally achieved by von Neumann successive projection (VNSP) lemma, which separates the conditions to form two subproblems for alternative optimization, converging only to a feasible solution. To solve these problems, in this article, a novel structured doubly stochastic graph-based clustering model termed SDSGC is proposed, which learns a structured doubly stochastic graph from data to directly provide cluster indicators. For optimization, a simple but effective augmented Lagrangian multiplier (ALM)-based method is proposed, which optimizes all the doubly stochastic conditions simultaneously to obtain the optimal solution. Experiments on one toy dataset and eight ad hoc noised face datasets have demonstrated that the proposed SDSGC is more robust to noise. Furthermore, a quantitative comparison of ten benchmarks has verified our SDSGC achieves better clustering performance when compared with SOTA methods. The code is available at https://github.com/NianWang-HJJGCDX/SDSGC.git.
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 11064-11077
Top Cited PapersStructured Doubly Stochastic Graph-Based Clustering
Graph-based clustering is a hot topic in machine learning, whose effectiveness highly relies on the quality of the learned graph. Recent researches preferred to learn the nearest doubly stochastic approximation of a graph to suppress intercluster connections and enhance intracluster connections and thus improve clustering performance. While current paradigm is limited by three key problems: 1) it is restricted by a predefined graph; 2) the separated stages of spectral decomposition-based way (graph learning, spectral embedding learning, and cluster assignment by k-means) cause mismatched problems and randomness; and 3) the optimization of doubly stochastic conditions is generally achieved by von Neumann successive projection (VNSP) lemma, which separates the conditions to form two subproblems for alternative optimization, converging only to a feasible solution. To solve these problems, in this article, a novel structured doubly stochastic graph-based clustering model termed SDSGC is proposed, which learns a structured doubly stochastic graph from data to directly provide cluster indicators. For optimization, a simple but effective augmented Lagrangian multiplier (ALM)-based method is proposed, which optimizes all the doubly stochastic conditions simultaneously to obtain the optimal solution. Experiments on one toy dataset and eight ad hoc noised face datasets have demonstrated that the proposed SDSGC is more robust to noise. Furthermore, a quantitative comparison of ten benchmarks has verified our SDSGC achieves better clustering performance when compared with SOTA methods. The code is available at https://github.com/NianWang-HJJGCDX/SDSGC.git.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (3) , 2662-2674
Tensorized Graph Learning for Spectral Ensemble Clustering
Ensemble clustering based on co-association matrices integrates multiple connective matrices from base clusterings to achieve superior results. However, these methods primarily focus on inter-sample relationships, neglecting variations across different base clusterings, potentially introducing noise. Additionally, they overlook interactions between samples and base clusterings, which are crucial for extracting common information and avoiding post-processing steps that may cause information loss and instability in clustering results. To address these issues, we propose the Tensorized Graph Learning for Spectral Ensemble Clustering (TGLSEC) model. TGLSEC stacks all connective matrices into a third-order tensor, employs Fast Fourier Transform (FFT) for encoding, and elucidates interrelations in the frequency domain. By minimizing the tensor Schatten p -norm, TGLSEC extracts common information in the low-rank space, eliminating noise and improving the quality of the common shared graph. Incorporating Laplacian rank constraints, TGLSEC learns a common shared graph with c-connected components, directly representing the clustering structure and avoiding post-processing steps, leading to more stable clustering results. To enhance computational efficiency for large-scale datasets, TGLSEC has been expanded into a bipartite-graph-based model, TGLSEC-BG, reducing complexity and computational time. Extensive experiments on real-world datasets demonstrate that TGLSEC and TGLSEC-BG exhibit superior clustering performance and robustness to noise.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (3) , 2662-2674
Tensorized Graph Learning for Spectral Ensemble Clustering
Ensemble clustering based on co-association matrices integrates multiple connective matrices from base clusterings to achieve superior results. However, these methods primarily focus on inter-sample relationships, neglecting variations across different base clusterings, potentially introducing noise. Additionally, they overlook interactions between samples and base clusterings, which are crucial for extracting common information and avoiding post-processing steps that may cause information loss and instability in clustering results. To address these issues, we propose the Tensorized Graph Learning for Spectral Ensemble Clustering (TGLSEC) model. TGLSEC stacks all connective matrices into a third-order tensor, employs Fast Fourier Transform (FFT) for encoding, and elucidates interrelations in the frequency domain. By minimizing the tensor Schatten p -norm, TGLSEC extracts common information in the low-rank space, eliminating noise and improving the quality of the common shared graph. Incorporating Laplacian rank constraints, TGLSEC learns a common shared graph with c-connected components, directly representing the clustering structure and avoiding post-processing steps, leading to more stable clustering results. To enhance computational efficiency for large-scale datasets, TGLSEC has been expanded into a bipartite-graph-based model, TGLSEC-BG, reducing complexity and computational time. Extensive experiments on real-world datasets demonstrate that TGLSEC and TGLSEC-BG exhibit superior clustering performance and robustness to noise.
- 5 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 45 (12) , 14321-14336
Discrete and Balanced Spectral Clustering With Scalability
Spectral Clustering (SC) has been the main subject of intensive research due to its remarkable clustering performance. Despite its successes, most existing SC methods suffer from several critical issues. First, they typically involve two independent stages, i.e., learning the continuous relaxation matrix followed by the discretization of the cluster indicator matrix. This two-stage approach can result in suboptimal solutions that negatively impact the clustering performance. Second, these methods are hard to maintain the balance property of clusters inherent in many real-world data, which restricts their practical applicability. Finally, these methods are computationally expensive and hence unable to handle large-scale datasets. In light of these limitations, we present a novel Discrete and Balanced Spectral Clustering with Scalability (DBSC) model that integrates the learning the continuous relaxation matrix and the discrete cluster indicator matrix into a single step. Moreover, the proposed model also maintains the size of each cluster approximately equal, thereby achieving soft-balanced clustering. What's more, the DBSC model incorporates an anchor-based strategy to improve its scalability to large-scale datasets. The experimental results demonstrate that our proposed model outperforms existing methods in terms of both clustering performance and balance performance. Specifically, the clustering accuracy of DBSC on CMUPIE data achieved a 17.93% improvement compared with that of the SOTA methods (LABIN, EBSC, etc.).
- 5 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 45 (12) , 14321-14336
Discrete and Balanced Spectral Clustering With Scalability
Spectral Clustering (SC) has been the main subject of intensive research due to its remarkable clustering performance. Despite its successes, most existing SC methods suffer from several critical issues. First, they typically involve two independent stages, i.e., learning the continuous relaxation matrix followed by the discretization of the cluster indicator matrix. This two-stage approach can result in suboptimal solutions that negatively impact the clustering performance. Second, these methods are hard to maintain the balance property of clusters inherent in many real-world data, which restricts their practical applicability. Finally, these methods are computationally expensive and hence unable to handle large-scale datasets. In light of these limitations, we present a novel Discrete and Balanced Spectral Clustering with Scalability (DBSC) model that integrates the learning the continuous relaxation matrix and the discrete cluster indicator matrix into a single step. Moreover, the proposed model also maintains the size of each cluster approximately equal, thereby achieving soft-balanced clustering. What's more, the DBSC model incorporates an anchor-based strategy to improve its scalability to large-scale datasets. The experimental results demonstrate that our proposed model outperforms existing methods in terms of both clustering performance and balance performance. Specifically, the clustering accuracy of DBSC on CMUPIE data achieved a 17.93% improvement compared with that of the SOTA methods (LABIN, EBSC, etc.).
- 23 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30 (10709908) , 1127-1131
Self-Weighted Euler $k$-Means Clustering
Clustering is used widely in various kinds of signal processing tasks, in which $k$ -means is warmly welcomed by the researchers due to its efficiency and simplicity. Nevertheless, it fails to process non-spherical clusters which are common data distribution. As a variant of $k$ -means, kernel $k$ -means uses a kernel trick to map the raw data into a feature space to better describe the data with improved clustering performance. But the algorithms still have a lot of shortcomings in the application of signal processing: 1) Not all features contain a wealth of useful information, so all dimensions of features cannot be treated equally; 2) The use of high dimensional features for clustering exceedingly increases computational complexity with negligible improvement of clustering performance. To solve the problems, we propose a self-weighted Euler $k$ -means (SWEKM) model, which can adaptively identify the importance of different features, perfectly integrating clustering and feature selection into a joint framework. Moreover, Euler kernel is adopted in SWEKM, which is capable of suppressing the interference of noise points and outliers with comparable computational complexity. Extensive experiments on datasets from the UCI database show that the SWEKM outperforms the state-of-the-art kernel $k$ -means for clustering-based signal processing tasks.
- 23 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30 (10709908) , 1127-1131
Self-Weighted Euler $k$-Means Clustering
Clustering is used widely in various kinds of signal processing tasks, in which $k$ -means is warmly welcomed by the researchers due to its efficiency and simplicity. Nevertheless, it fails to process non-spherical clusters which are common data distribution. As a variant of $k$ -means, kernel $k$ -means uses a kernel trick to map the raw data into a feature space to better describe the data with improved clustering performance. But the algorithms still have a lot of shortcomings in the application of signal processing: 1) Not all features contain a wealth of useful information, so all dimensions of features cannot be treated equally; 2) The use of high dimensional features for clustering exceedingly increases computational complexity with negligible improvement of clustering performance. To solve the problems, we propose a self-weighted Euler $k$ -means (SWEKM) model, which can adaptively identify the importance of different features, perfectly integrating clustering and feature selection into a joint framework. Moreover, Euler kernel is adopted in SWEKM, which is capable of suppressing the interference of noise points and outliers with comparable computational complexity. Extensive experiments on datasets from the UCI database show that the SWEKM outperforms the state-of-the-art kernel $k$ -means for clustering-based signal processing tasks.
- 5 November 2022
- Published by Elsevier in Signal Processing
- Vol. 204
Ensemble and random collaborative representation-based anomaly detector for hyperspectral imagery
- 5 November 2022
- Published by Elsevier in Signal Processing
- Vol. 204
Ensemble and random collaborative representation-based anomaly detector for hyperspectral imagery
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 2796-2808
Discrete and Parameter-Free Multiple Kernel k-Means
The multiple kernel $k$ -means (MKKM) and its variants utilize complementary information from different sources, achieving better performance than kernel $k$ -means (KKM). However, the optimization procedures of most previous works comprise two stages, learning the continuous relaxation matrix and obtaining the discrete one by extra discretization procedures. Such a two-stage strategy gives rise to a mismatched problem and severe information loss. Even worse, most existing MKKM methods overlook the correlation among prespecified kernels, which leads to the fusion of mutually redundant kernels and bad effects on the diversity of information sources, finally resulting in unsatisfying results. To address these issues, we elaborate a novel Discrete and Parameter-free Multiple Kernel $k$ -means (DPMKKM) model solved by an alternative optimization method, which can directly obtain the cluster assignment results without subsequent discretization procedure. Moreover, DPMKKM can measure the correlation among kernels by implicitly introducing a regularization term, which is able to enhance kernel fusion by reducing redundancy and improving diversity. Noteworthily, the time complexity of optimization algorithm is successfully reduced, through masterly utilizing of coordinate descent technique, which contributes to higher algorithm efficiency and broader applications. What’s more, our proposed model is parameter-free avoiding intractable hyperparameter tuning, which makes it feasible in practical applications. Lastly, extensive experiments conducted on a number of real-world datasets illustrated the effectiveness and superiority of the proposed DPMKKM model.
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 2796-2808
Discrete and Parameter-Free Multiple Kernel k-Means
The multiple kernel $k$ -means (MKKM) and its variants utilize complementary information from different sources, achieving better performance than kernel $k$ -means (KKM). However, the optimization procedures of most previous works comprise two stages, learning the continuous relaxation matrix and obtaining the discrete one by extra discretization procedures. Such a two-stage strategy gives rise to a mismatched problem and severe information loss. Even worse, most existing MKKM methods overlook the correlation among prespecified kernels, which leads to the fusion of mutually redundant kernels and bad effects on the diversity of information sources, finally resulting in unsatisfying results. To address these issues, we elaborate a novel Discrete and Parameter-free Multiple Kernel $k$ -means (DPMKKM) model solved by an alternative optimization method, which can directly obtain the cluster assignment results without subsequent discretization procedure. Moreover, DPMKKM can measure the correlation among kernels by implicitly introducing a regularization term, which is able to enhance kernel fusion by reducing redundancy and improving diversity. Noteworthily, the time complexity of optimization algorithm is successfully reduced, through masterly utilizing of coordinate descent technique, which contributes to higher algorithm efficiency and broader applications. What’s more, our proposed model is parameter-free avoiding intractable hyperparameter tuning, which makes it feasible in practical applications. Lastly, extensive experiments conducted on a number of real-world datasets illustrated the effectiveness and superiority of the proposed DPMKKM model.