Eryang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Eryang Chen has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Kaibo Shi
School of Information Science and Engineering Chengdu University Chengdu China
3 shared publications - Can Zhao
School of Electronic Information and Electrical Engineering, Chengdu University, Chengdu 610106, China
2 shared publications Jianghong Yuan
Affiliations Sichuan Railway College, Chengdu, China, Education Department of Sichuan Province, Key Laboratory of Detection and Application of Space Effect in Southwest Sichuan at Leshan Normal University, Leshan, China
2 shared publicationsAnsheng Ye
College of Geophysics, Chengdu University of Technology, Chengdu 610059, China
1 shared publication- Dawei Gong
School of Mechanical and Electrical Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
1 shared publication Fang Miao
Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan, Chengdu University, Chengdu 610106, China
1 shared publication
Latest Publications
- 6 July 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (13) , 874
Three new techniques for T-S fuzzy system subject to two additive time delays: a five-parameters-BQFND lemma, a LKF lemma and a genetic algorithm
- 6 July 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (13) , 874
Three new techniques for T-S fuzzy system subject to two additive time delays: a five-parameters-BQFND lemma, a LKF lemma and a genetic algorithm
- Open Access
- 15 May 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (5) , e0323446
A fast hyperspectral change detection algorithm for agricultural crops based on spatial reconstruction
Crop change detection plays a pivotal role in ensuring agricultural sustainability and environmental monitoring. Leveraging the high spectral resolution of hyperspectral imagery and bi-temporal analysis, this study presents a Fast Hyperspectral Change Detection algorithm based on Spatial Reconstruction (FHCDSR) designed to identify subtle agricultural changes with improved accuracy and computational efficiency. The proposed method incorporates three key innovations: (1) boundary-constrained preprocessing of 3D hyperspectral data, (2) Laplacian-regularized spatial reconstruction, and (3) a novel tensor-based change detection framework. We conduct a comprehensive evaluation of FHCDSR using two datasets: the Hermiston dataset and the Yancheng dataset. Experimental results demonstrate that FHCDSR achieves superior performance on both datasets, with AUC values of 90.20% (Hermiston) and 95.39% (Yancheng), outperforming six state-of-the-art comparison methods by 3.39–14.78% in detection accuracy. Remarkably, the algorithm maintains high computational efficiency, completing analyses in 9.76 seconds (Hermiston) and 10.90 seconds (Yancheng), representing up to 94.05% reduction in processing time compared to conventional methods. The consistent performance across different agricultural landscapes highlights FHCDSR’s robustness as an unsupervised change detection solution, with significant potential for precision agriculture and wetland ecosystem monitoring applications.
- 15 May 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (5) , e0323446
Open AccessA fast hyperspectral change detection algorithm for agricultural crops based on spatial reconstruction
Crop change detection plays a pivotal role in ensuring agricultural sustainability and environmental monitoring. Leveraging the high spectral resolution of hyperspectral imagery and bi-temporal analysis, this study presents a Fast Hyperspectral Change Detection algorithm based on Spatial Reconstruction (FHCDSR) designed to identify subtle agricultural changes with improved accuracy and computational efficiency. The proposed method incorporates three key innovations: (1) boundary-constrained preprocessing of 3D hyperspectral data, (2) Laplacian-regularized spatial reconstruction, and (3) a novel tensor-based change detection framework. We conduct a comprehensive evaluation of FHCDSR using two datasets: the Hermiston dataset and the Yancheng dataset. Experimental results demonstrate that FHCDSR achieves superior performance on both datasets, with AUC values of 90.20% (Hermiston) and 95.39% (Yancheng), outperforming six state-of-the-art comparison methods by 3.39–14.78% in detection accuracy. Remarkably, the algorithm maintains high computational efficiency, completing analyses in 9.76 seconds (Hermiston) and 10.90 seconds (Yancheng), representing up to 94.05% reduction in processing time compared to conventional methods. The consistent performance across different agricultural landscapes highlights FHCDSR’s robustness as an unsupervised change detection solution, with significant potential for precision agriculture and wetland ecosystem monitoring applications.
- Open Access
Trajectory Tracking Control of Unmanned Vehicles via Front-Wheel Driving
Automated Guided Vehicles (AGVs) are the fastest commercially available application of unmanned driving technology, and the research significance of unmanned vehicle technology remains substantial. This paper investigates the driving mode of AGVs and proposes a method to extend the kinematic model of center-driven unmanned vehicles to front-wheel drive. This change in driving force enables unmanned vehicles to achieve faster tracking and higher consistency, solving the problems of long tracking time and insufficient accuracy in complex environments and reducing production costs. By analyzing the posture relationship of the unmanned vehicle system during movement, we established a posture error system to analyze the trajectory tracking problem. Utilizing Lyapunov stability theory and the concept of backstepping, we designed a control scheme that uses linear velocity and heading angular velocity as variables for the posture error system. This control scheme aims to stabilize the system and achieve synchronized trajectory tracking control of the unmanned vehicle. The impact of control parameters in the controller on tracking performance is also discussed. The final experimental simulation results show that the system error stabilizes, and the unmanned vehicle accurately follows the predetermined trajectory, verifying the feasibility of our proposed method and control scheme.
Open AccessTrajectory Tracking Control of Unmanned Vehicles via Front-Wheel Driving
Automated Guided Vehicles (AGVs) are the fastest commercially available application of unmanned driving technology, and the research significance of unmanned vehicle technology remains substantial. This paper investigates the driving mode of AGVs and proposes a method to extend the kinematic model of center-driven unmanned vehicles to front-wheel drive. This change in driving force enables unmanned vehicles to achieve faster tracking and higher consistency, solving the problems of long tracking time and insufficient accuracy in complex environments and reducing production costs. By analyzing the posture relationship of the unmanned vehicle system during movement, we established a posture error system to analyze the trajectory tracking problem. Utilizing Lyapunov stability theory and the concept of backstepping, we designed a control scheme that uses linear velocity and heading angular velocity as variables for the posture error system. This control scheme aims to stabilize the system and achieve synchronized trajectory tracking control of the unmanned vehicle. The impact of control parameters in the controller on tracking performance is also discussed. The final experimental simulation results show that the system error stabilizes, and the unmanned vehicle accurately follows the predetermined trajectory, verifying the feasibility of our proposed method and control scheme.
- Open Access
- 20 August 2024
- Published by Springer Nature in Research Square
Correntropy based Low-rank Matrix Factorization with Multi-view Constraint Graph Learning for Multi-view Data Clustering
With the increase in data pattern diversity, multi-view clustering has become a hot topic for researchers. However, most of the current multi-view clustering methods focus on unsupervised learning scenarios, which cannot utilize the label information in the data. Furthermore, they could not handle the outliers, which may exist in the data. In order to address these issues, this paper proposes a Correntropy-based Multi-view Low-rank Matrix Factorization (CMLMF) method for multi-view data semi-supervised clustering. In order to sufficiently utilize the local structure information, a correntropy-based multi-view constraint graph learning framework is proposed to extract the local structure hidden in the multi-view data adaptively. Furthermore, a correntropy-based multi-view Low-rank Matrix Factorization (LMF) model is proposed, which can be incorporated with the adaptive graph learning framework to extract the global reconstruction information of data. The label information is introduced by a constraint matrix, which can be utilized for both global reconstruction and local structure information learning without adding any hyperparameter. Due to the maximum correntropy criterion, the proposed method is robust against the outliers in the data in each view and helps to extract a more current consensus representation. An efficient solving algorithm based on accelerated Block Coordinate Update (BCU) is designed to solve the model. Experiments are conducted on five real-world datasets, and the proposed method is compared with ten state-of-the-art methods to evaluate the effectiveness of the CMLMF method. The results show that the proposed method performs better clustering in most cases.
- 20 August 2024
- Published by Springer Nature in Research Square
Open AccessCorrentropy based Low-rank Matrix Factorization with Multi-view Constraint Graph Learning for Multi-view Data Clustering
With the increase in data pattern diversity, multi-view clustering has become a hot topic for researchers. However, most of the current multi-view clustering methods focus on unsupervised learning scenarios, which cannot utilize the label information in the data. Furthermore, they could not handle the outliers, which may exist in the data. In order to address these issues, this paper proposes a Correntropy-based Multi-view Low-rank Matrix Factorization (CMLMF) method for multi-view data semi-supervised clustering. In order to sufficiently utilize the local structure information, a correntropy-based multi-view constraint graph learning framework is proposed to extract the local structure hidden in the multi-view data adaptively. Furthermore, a correntropy-based multi-view Low-rank Matrix Factorization (LMF) model is proposed, which can be incorporated with the adaptive graph learning framework to extract the global reconstruction information of data. The label information is introduced by a constraint matrix, which can be utilized for both global reconstruction and local structure information learning without adding any hyperparameter. Due to the maximum correntropy criterion, the proposed method is robust against the outliers in the data in each view and helps to extract a more current consensus representation. An efficient solving algorithm based on accelerated Block Coordinate Update (BCU) is designed to solve the model. Experiments are conducted on five real-world datasets, and the proposed method is compared with ten state-of-the-art methods to evaluate the effectiveness of the CMLMF method. The results show that the proposed method performs better clustering in most cases.
- Open Access
- 23 June 2021
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2021, 1-11
Spectral-Spatial Hyperspectral Image Semisupervised Classification by Fusing Maximum Noise Fraction and Adaptive Random Multigraphs
Hyperspectral images (HSIs) contain large amounts of spectral and spatial information, and this provides the possibility for ground object classification. However, when using the traditional method, achieving a satisfactory classification result is difficult because of the insufficient labeling of samples in the training set. In addition, parameter adjustment during HSI classification is time-consuming. This paper proposes a novel fusion method based on the maximum noise fraction (MNF) and adaptive random multigraphs for HSI classification. Considering the overall spectrum of the object and the correlation of adjacent bands, the MNF was utilized to reduce the spectral dimension. Next, a multiscale local binary pattern (LBP) analysis was performed on the MNF dimension-reduced data to extract the spatial features of different scales. The obtained multiscale spatial features were then stacked with the MNF dimension-reduced spectral features to form multiscale spectral-spatial features (SSFs), which were sent into the RMG for HSI classification. Optimal performance was obtained by fusion. For all three real datasets, our method achieved competitive results with only 10 training samples. More importantly, the classification parameters corresponding to different hyperspectral data can be automatically optimized using our method.
- 23 June 2021
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2021, 1-11
Open AccessSpectral-Spatial Hyperspectral Image Semisupervised Classification by Fusing Maximum Noise Fraction and Adaptive Random Multigraphs
Hyperspectral images (HSIs) contain large amounts of spectral and spatial information, and this provides the possibility for ground object classification. However, when using the traditional method, achieving a satisfactory classification result is difficult because of the insufficient labeling of samples in the training set. In addition, parameter adjustment during HSI classification is time-consuming. This paper proposes a novel fusion method based on the maximum noise fraction (MNF) and adaptive random multigraphs for HSI classification. Considering the overall spectrum of the object and the correlation of adjacent bands, the MNF was utilized to reduce the spectral dimension. Next, a multiscale local binary pattern (LBP) analysis was performed on the MNF dimension-reduced data to extract the spatial features of different scales. The obtained multiscale spatial features were then stacked with the MNF dimension-reduced spectral features to form multiscale spectral-spatial features (SSFs), which were sent into the RMG for HSI classification. Optimal performance was obtained by fusion. For all three real datasets, our method achieved competitive results with only 10 training samples. More importantly, the classification parameters corresponding to different hyperspectral data can be automatically optimized using our method.