Deyan Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Deyan Xie has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Quanxue Gao
Xidian University, Xi'an, China
6 shared publications Song Xiao
The State Key Laboratory of Integrated Services Networks Xidian University 710071 Xi'an People's Republic of China
3 shared publications- Qianqian Wang
Xidian University
2 shared publications Wei Xia
2 shared publications- Cheng Deng
Hohai University, Nanjing, China
1 shared publication Feiping Nie
The Center for OPTical IMagery Analysis and Learning, Northwestern Polytechnical University 710069 Xi'an People's Republic of China
1 shared publication
Latest Publications
- 16 November 2026
- Published by Elsevier in Optics and Lasers in Engineering
- Vol. 209
Mask-guided wavelet-regularized CycleGAN for virtual staining of photoacoustic histology imaging
- 16 November 2026
- Published by Elsevier in Optics and Lasers in Engineering
- Vol. 209
Mask-guided wavelet-regularized CycleGAN for virtual staining of photoacoustic histology imaging
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1599-1609
Label Learning Method Based on Tensor Projection
Multi-view clustering method based on anchor graph has been widely concerned due to its high efficiency and effectiveness. In order to avoid post-processing, most of the existing anchor graph-based methods learn bipartite graphs with connected components. However, such methods have high requirements on parameters, and in some cases it may not be possible to obtain bipartite graphs with clear connected components. To end this, we propose a label learning method based on tensor projection (LLMTP). Specifically, we project anchor graph into the label space through an orthogonal projection matrix to obtain cluster labels directly. Considering that the spatial structure information of multi-view data may be ignored to a certain extent when projected in different views separately, we extend the matrix projection transformation to tensor projection, so that the spatial structure information between views can be fully utilized. In addition, we introduce the tensor Schatten p-norm regularization to make the clustering label matrices of different views as consistent as possible. Extensive experiments have proved the effectiveness of the proposed method.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1599-1609
Open AccessLabel Learning Method Based on Tensor Projection
Multi-view clustering method based on anchor graph has been widely concerned due to its high efficiency and effectiveness. In order to avoid post-processing, most of the existing anchor graph-based methods learn bipartite graphs with connected components. However, such methods have high requirements on parameters, and in some cases it may not be possible to obtain bipartite graphs with clear connected components. To end this, we propose a label learning method based on tensor projection (LLMTP). Specifically, we project anchor graph into the label space through an orthogonal projection matrix to obtain cluster labels directly. Considering that the spatial structure information of multi-view data may be ignored to a certain extent when projected in different views separately, we extend the matrix projection transformation to tensor projection, so that the spatial structure information between views can be fully utilized. In addition, we introduce the tensor Schatten p-norm regularization to make the clustering label matrices of different views as consistent as possible. Extensive experiments have proved the effectiveness of the proposed method.
- 28 January 2023
- Published by Elsevier in Neural Networks
- Vol. 161, 93-104
Enhanced tensor low-rank representation learning for multi-view clustering
- 28 January 2023
- Published by Elsevier in Neural Networks
- Vol. 161, 93-104
Enhanced tensor low-rank representation learning for multi-view clustering
- Open Access
- 14 May 2020
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 14 (8) , 1475-1480
Fast algorithm for large‐scale subspace clustering by LRR
Low‐rank representation (LRR) and its variants have been proved to be powerful tools for handling subspace clustering problems. Most of these methods involve a sub‐problem of computing the singular value decomposition of an matrix, which leads to a computation complexity of . Obviously, when n is large, it will be time consuming. To address this problem, the authors introduce a fast solution, which reformulates the large‐scale problem to an equal form with smaller size. Thus, the proposed method remarkably reduces the computation complexity by solving a small‐scale problem. Theoretical analysis proves the efficiency of the proposed model. Furthermore, we extend LRR to a general model by using Schatten p ‐norm instead of nuclear norm and present a fast algorithm to solve large‐scale problem. Experiments on MNIST and Caltech101 databse illustrate the equivalence of the proposed algorithm and the original LRR solver. Experimental results show that the proposed algorithm is remarkably faster than traditional LRR algorithm, especially in the case of large sample number.
- 14 May 2020
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 14 (8) , 1475-1480
Open AccessFast algorithm for large‐scale subspace clustering by LRR
Low‐rank representation (LRR) and its variants have been proved to be powerful tools for handling subspace clustering problems. Most of these methods involve a sub‐problem of computing the singular value decomposition of an matrix, which leads to a computation complexity of . Obviously, when n is large, it will be time consuming. To address this problem, the authors introduce a fast solution, which reformulates the large‐scale problem to an equal form with smaller size. Thus, the proposed method remarkably reduces the computation complexity by solving a small‐scale problem. Theoretical analysis proves the efficiency of the proposed model. Furthermore, we extend LRR to a general model by using Schatten p ‐norm instead of nuclear norm and present a fast algorithm to solve large‐scale problem. Experiments on MNIST and Caltech101 databse illustrate the equivalence of the proposed algorithm and the original LRR solver. Experimental results show that the proposed algorithm is remarkably faster than traditional LRR algorithm, especially in the case of large sample number.
- 1 March 2020
- Published by Elsevier in Neurocomputing
- Vol. 380, 105-114
Multi-view clustering by joint manifold learning and tensor nuclear norm
- 1 March 2020
- Published by Elsevier in Neurocomputing
- Vol. 380, 105-114
Multi-view clustering by joint manifold learning and tensor nuclear norm
- 4 June 2019
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 79 (47-48) , 35441-35461
On the optimal solution to maximum margin projection pursuit
- 4 June 2019
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 79 (47-48) , 35441-35461
On the optimal solution to maximum margin projection pursuit
- Open Access
- 14 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36702-36709
Multi-View Classification via Adaptive Discriminant Analysis
In many real applications, an object is usually represented with multiple views, providing compatible and complementary information to each other. Therefore, it is highly desirable to recognize the object from distinct and even heterogeneous views. In this paper, we propose a novel method, the named multi-view locality adaptively discriminant analysis (MvLADA), for multi-view classification. The MvLADA integrates subspace learning and weighted matrix learning into a uniform framework, where the weighted matrix is adaptively attained and shared by all views. Compared with the most existing LDA-based multi-view methods, the MvLADA adaptively assigns different weights to each sample, which enhances MvLADA's flexibility in practical applications. Moreover, the learned weighted matrix shared by all views exploits the point's neighbor relationship automatically without requiring a k NN procedure. Besides, the MvLADA is a parameter-free method without imposing any additional parameters. We validate the proposed MvLADA on three real-world datasets, indicating a better performance than the state-of-the-art multi-view algorithms.
- 14 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36702-36709
Open AccessMulti-View Classification via Adaptive Discriminant Analysis
In many real applications, an object is usually represented with multiple views, providing compatible and complementary information to each other. Therefore, it is highly desirable to recognize the object from distinct and even heterogeneous views. In this paper, we propose a novel method, the named multi-view locality adaptively discriminant analysis (MvLADA), for multi-view classification. The MvLADA integrates subspace learning and weighted matrix learning into a uniform framework, where the weighted matrix is adaptively attained and shared by all views. Compared with the most existing LDA-based multi-view methods, the MvLADA adaptively assigns different weights to each sample, which enhances MvLADA's flexibility in practical applications. Moreover, the learned weighted matrix shared by all views exploits the point's neighbor relationship automatically without requiring a k NN procedure. Besides, the MvLADA is a parameter-free method without imposing any additional parameters. We validate the proposed MvLADA on three real-world datasets, indicating a better performance than the state-of-the-art multi-view algorithms.
- Open Access
- 11 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 31197-31206
Multi-View Spectral Clustering via Integrating Global and Local Graphs
Robust Multi-view Spectral Clustering (RMSC) minimizes the rank of probability matrix to recover a common transition probability matrix from the matrices calculated by each single view, and achieves promising performance. However, for clustering task, the underlying structure of low-rank probability matrix is readily accessible. Yet, RMSC ignores the priori target rank information, and it does not efficiently depict the complementary information between different views. To address these problems, we propose a novel multi-view Markov chain spectral clustering method with priori rank information. To be specific, we encourage the target rank constraint by minimizing the partial sum of singular values instead of nuclear norm, and construct a global graph from the concatenated features to exploit the complementary information embedded in different views. The objective function can be optimized efficiently by using the Augmented Lagrangian Multiplier (ALM) algorithm. Extensive experimental results on one synthetic and eight benchmark datasets demonstrate that the proposed method outperforms state-of-the-art approaches.
- 11 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 31197-31206
Open AccessMulti-View Spectral Clustering via Integrating Global and Local Graphs
Robust Multi-view Spectral Clustering (RMSC) minimizes the rank of probability matrix to recover a common transition probability matrix from the matrices calculated by each single view, and achieves promising performance. However, for clustering task, the underlying structure of low-rank probability matrix is readily accessible. Yet, RMSC ignores the priori target rank information, and it does not efficiently depict the complementary information between different views. To address these problems, we propose a novel multi-view Markov chain spectral clustering method with priori rank information. To be specific, we encourage the target rank constraint by minimizing the partial sum of singular values instead of nuclear norm, and construct a global graph from the concatenated features to exploit the complementary information embedded in different views. The objective function can be optimized efficiently by using the Augmented Lagrangian Multiplier (ALM) algorithm. Extensive experimental results on one synthetic and eight benchmark datasets demonstrate that the proposed method outperforms state-of-the-art approaches.