Deyun Wei
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
Deyun Wei has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Yuan-Min Li
School of Mathematics and Statistics, Xidian University, Xian, China
6 shared publications- Yuan-Min Li
School of Mathematics and Statistics, Xidian University, Xi’an 710071, China
4 shared publications - Yang Deng
School of Mathematics and Statistics, Xidian University, Xi’an 710071, China
3 shared publications - Fangdelong Du
Xidian University
2 shared publications - Mingjie Jiang
School of Mathematics and Statistics, Xidian University, Xi’an 710071, China
2 shared publications Ruikui Wang
School of Telecommunications Engineering Xidian University Xi'an 710071 People's Republic of China
2 shared publications
Latest Publications
- 11 November 2026
- Published by Elsevier in Signal Processing
- Vol. 253
Local joint spectral estimation and scalable approximation for time-vertex processes
- 11 November 2026
- Published by Elsevier in Signal Processing
- Vol. 253
Local joint spectral estimation and scalable approximation for time-vertex processes
- 24 February 2026
- Published by Elsevier in Signal Processing
- Vol. 245
A robust non-uniform sparse Fourier transform algorithm and its applications
- 24 February 2026
- Published by Elsevier in Signal Processing
- Vol. 245
A robust non-uniform sparse Fourier transform algorithm and its applications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 3692-3707
A Blind Recovery Algorithm for Multicoset Sampling via Graph Spectral Support Identification
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 3692-3707
A Blind Recovery Algorithm for Multicoset Sampling via Graph Spectral Support Identification
- 7 December 2025
- Published by Elsevier in Signal Processing
- Vol. 242
Graph sampling on a union of periodic graph spectrum subspaces
- 7 December 2025
- Published by Elsevier in Signal Processing
- Vol. 242
Graph sampling on a union of periodic graph spectrum subspaces
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 2255-2270
Vertex-Frequency Analysis on Directed Graphs
Vertex-frequency analysis (VFA) is a useful technique in graph signal processing to extract the correspondence between frequencies and vertices. VFA can be calculated by the windowed graph Fourier transform (WGFT) and the localized graph Fourier transform (LGFT). However, since the inability of the classical graph Fourier transform (GFT) to generate orthogonal bases for directed graphs, the two approaches are confined to undirected graphs. In order to address the absence of VFA on directed graphs, we extend the fundamental concepts of VFA, shifted vertex window function and band-pass transfer filters in spectral domain to directed graphs. We first propose WDGFT based on the shifted window function in vertex domain. The relevant properties, reconstruction formulas, and simulation results of vertex-frequency representation are given. Then, we propose the localized directed graph Fourier transform (LDGFT), where the band-pass transfer filters can capture the localized spectral domain. The transfer functions satisfying the reconstruction condition are discussed. The vertex-frequency representation obtained by LDGFT is provided through numerical examples. Furthermore, we present a polynomial approximation technique to decrease computational cost. The LDGFT can be calculated without any matrix decomposition. Finally, we evaluate the proposed directed VFA framework with two kinds of applications, clustering and malfunction detection. We demonstrate that the proposed VFA framework is a powerful tool for directed graph signal processing.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 2255-2270
Vertex-Frequency Analysis on Directed Graphs
Vertex-frequency analysis (VFA) is a useful technique in graph signal processing to extract the correspondence between frequencies and vertices. VFA can be calculated by the windowed graph Fourier transform (WGFT) and the localized graph Fourier transform (LGFT). However, since the inability of the classical graph Fourier transform (GFT) to generate orthogonal bases for directed graphs, the two approaches are confined to undirected graphs. In order to address the absence of VFA on directed graphs, we extend the fundamental concepts of VFA, shifted vertex window function and band-pass transfer filters in spectral domain to directed graphs. We first propose WDGFT based on the shifted window function in vertex domain. The relevant properties, reconstruction formulas, and simulation results of vertex-frequency representation are given. Then, we propose the localized directed graph Fourier transform (LDGFT), where the band-pass transfer filters can capture the localized spectral domain. The transfer functions satisfying the reconstruction condition are discussed. The vertex-frequency representation obtained by LDGFT is provided through numerical examples. Furthermore, we present a polynomial approximation technique to decrease computational cost. The LDGFT can be calculated without any matrix decomposition. Finally, we evaluate the proposed directed VFA framework with two kinds of applications, clustering and malfunction detection. We demonstrate that the proposed VFA framework is a powerful tool for directed graph signal processing.
- 5 November 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 262
Redistributed invariant redundant fractional wavelet transform and its application in watermarking algorithm
- 5 November 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 262
Redistributed invariant redundant fractional wavelet transform and its application in watermarking algorithm
- 10 September 2024
- Published by Elsevier in Digital Signal Processing
- Vol. 155
Hermitian random walk graph Fourier transform for directed graphs and its applications
- 10 September 2024
- Published by Elsevier in Digital Signal Processing
- Vol. 155
Hermitian random walk graph Fourier transform for directed graphs and its applications
- 4 July 2024
- Published by Elsevier in Signal Processing
- Vol. 224
Generalized sampling of multi-dimensional graph signals based on prior information
- 4 July 2024
- Published by Elsevier in Signal Processing
- Vol. 224
Generalized sampling of multi-dimensional graph signals based on prior information
- 15 May 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (8) , 5262-5287
An Optimized IWT–DCT Watermarking Scheme Based on Multiple Matrix Decomposition and MOWOA2
- 15 May 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (8) , 5262-5287
An Optimized IWT–DCT Watermarking Scheme Based on Multiple Matrix Decomposition and MOWOA2
- Open Access
- 31 January 2024
- Published by MDPI AG in Fractal and Fractional
- Vol. 8 (2) , 92
A Novel Image Encryption Algorithm Based on Compressive Sensing and a Two-Dimensional Linear Canonical Transform
In this paper, we propose a secure image encryption method using compressive sensing (CS) and a two-dimensional linear canonical transform (2D LCT). First, the SHA256 of the source image is used to generate encryption security keys. As a result, the suggested technique is able to resist selected plaintext attacks and is highly sensitive to plain images. CS simultaneously encrypts and compresses a plain image. Using a starting value correlated with the sum of the image pixels, the Mersenne Twister (MT) is used to control a measurement matrix in compressive sensing. Then, the scrambled image is permuted by Lorenz’s hyper-chaotic systems and encoded by chaotic and random phase masks in the 2D LCT domain. In this case, chaotic systems increase the output complexity, and the independent parameters of the 2D LCT expand the key space of the suggested technique. Ultimately, diffusion based on addition and modulus operations yields a cipher-text image. Simulations showed that this cryptosystem was able to withstand common attacks and had adequate cryptographic features.
- 31 January 2024
- Published by MDPI AG in Fractal and Fractional
- Vol. 8 (2) , 92
Open AccessA Novel Image Encryption Algorithm Based on Compressive Sensing and a Two-Dimensional Linear Canonical Transform
In this paper, we propose a secure image encryption method using compressive sensing (CS) and a two-dimensional linear canonical transform (2D LCT). First, the SHA256 of the source image is used to generate encryption security keys. As a result, the suggested technique is able to resist selected plaintext attacks and is highly sensitive to plain images. CS simultaneously encrypts and compresses a plain image. Using a starting value correlated with the sum of the image pixels, the Mersenne Twister (MT) is used to control a measurement matrix in compressive sensing. Then, the scrambled image is permuted by Lorenz’s hyper-chaotic systems and encoded by chaotic and random phase masks in the 2D LCT domain. In this case, chaotic systems increase the output complexity, and the independent parameters of the 2D LCT expand the key space of the suggested technique. Ultimately, diffusion based on addition and modulus operations yields a cipher-text image. Simulations showed that this cryptosystem was able to withstand common attacks and had adequate cryptographic features.