Xin Zhang

Xin Zhang


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
25 March 2024 in Sensors
Verified
Journal Article
Open access
PDF file
WSWenhui Song
Wenhui Song
XZXin Zhang
Xin Zhang
GYGuozhu Yang
Guozhu Yang
YCYijin Chen
Yijin Chen
WCWang Lian chao
Wang Lian chao
HXHanghang Xu
Hanghang Xu
With the rapid advancement of remote-sensing technology, the spectral information obtained from hyperspectral remote-sensing imagery has become increasingly rich, facilitating detailed spectral analysis of Earth’s surface objects. However, the abundance of spectral information presents certain challenges for data processing, such as the “curse of dimensionality” leading to the “Hughes phenomenon”, “strong correlation” due to high resolution, and “nonlinear characteristics” caused by varying surface reflectances. Consequently, dimensionality reduction of hyperspectral data emerges as a critical task. This paper begins by elucidating the principles and processes of hyperspectral image dimensionality reduction based on manifold theory and learning methods, in light of the nonlinear structures and features present in hyperspectral remote-sensing data, and formulates a dimensionality reduction process based on manifold learning. Subsequently, this study explores the capabilities of feature extraction and low-dimensional embedding for hyperspectral imagery using manifold learning approaches, including principal components analysis (PCA), multidimensional scaling (MDS), and linear discriminant analysis (LDA) for linear methods; and isometric mapping (Isomap), locally linear embedding (LLE), Laplacian eigenmaps (LE), Hessian locally linear embedding (HLLE), local tangent space alignment (LTSA), and maximum variance unfolding (MVU) for nonlinear methods, based on the Indian Pines hyperspectral dataset and Pavia University dataset. Furthermore, the paper investigates the optimal neighborhood computation time and overall algorithm runtime for feature extraction in hyperspectral imagery, varying by the choice of neighborhood k and intrinsic dimensionality d values across different manifold learning methods. Based on the outcomes of feature extraction, the study examines the classification experiments of various manifold learning methods, comparing and analyzing the variations in classification accuracy and Kappa coefficient with different selections of neighborhood k and intrinsic dimensionality d values. Building on this, the impact of selecting different bandwidths t for the Gaussian kernel in the LE method and different Lagrange multipliers λ for the MVU method on classification accuracy, given varying choices of neighborhood k and intrinsic dimensionality d, is explored. Through these experiments, the paper investigates the capability and effectiveness of different manifold learning methods in feature extraction and dimensionality reduction within hyperspectral imagery, as influenced by the selection of neighborhood k and intrinsic dimensionality d values, identifying the optimal neighborhood k and intrinsic dimensionality d value for each method. A comparison of classification accuracies reveals that the LTSA method yields superior classification results compared to other manifold learning approaches. The study demonstrates the advantages of manifold learning methods in processing hyperspectral image data, providing an experimental reference for subsequent research on hyperspectral image dimensionality reduction using manifold learning methods.

28 November 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YXYi Xie
Yi Xie
YLYuchen Luan
Yuchen Luan
LCLongyong Chen
Longyong Chen
XZXin Zhang
Xin Zhang
In traditional Stripmap SAR imaging, the platform motion error will bring the phase error in the azimuthal direction to the image, which will have a series of effects on the imaging quality. The traditional autofocus algorithm—Stripmap Phase Gradient Algorithm (SPGA)—can estimate any order phase error above the second order in theory, but it is difficult to estimate the linear phase error, which leads to the discontinuity of the estimated phase error. It usually needs multiple iterations to focus an image, which is inefficient. Moreover, because the linear phase error cannot be estimated, the traditional SPGA cannot eliminate the target offset in the image, resulting in the distortion of the image in the azimuthal direction. According to the continuity of phase error, we propose a modified iteration-free SPGA based on removing the linear phase. Without iteration, the proposed autofocus algorithm can achieve comparable or even better results than traditional SPGA. In the simulation experiments, piecewise linear errors are added to the images of multiple targets. SPGA still fails to focus the image after six iterations. The average ILSR and ILSR are −7.11 dB and −3.99 dB, respectively, and the average number of point target drift is 8.42 pixels. The proposed algorithm optimizes the average ILSR and ILSR to −12.34 dB and −9.87 dB and reduces the average number of point target drift to 0.16 pixels. In the actual data processing, using image entropy as the evaluation criterion, the time consumption is only 19.25% of SPGA under the condition of achieving the same focusing quality.

Verified
Journal Article
Open access
PDF file
STShi kun Tao
Shi kun Tao
CZChangming Zhu
Changming Zhu
JLJunli Li
Junli Li
XZXin Zhang
Xin Zhang
FYFan Yang
Fan Yang
QSQian Shen
Qian Shen
The collaborative use of camera near-field sensors for monitoring the number and status of tourists is a crucial aspect of smart scenic spot management. This paper proposes a near-field perception technical system that achieves dynamic and accurate detection of tourist targets in mountainous scenic areas, addressing the challenges of real-time passive perception and safety management of tourists. The technical framework involves the following steps: Firstly, real-time video stream signals are collected from multiple cameras to create a distributed perception network. Then, the YOLOX network model is enhanced with the CBAM module and ASFF method to improve the dynamic recognition of preliminary tourist targets in complex scenes. Additionally, the BYTE target dynamic tracking algorithm is employed to address the issue of target occlusion in mountainous scenic areas, thereby enhancing the accuracy of model detection. Finally, the video target monocular spatial positioning algorithm is utilized to determine the actual geographic location of tourists based on the image coordinates. The algorithm was deployed in the Tianmeng Scenic Area of Yimeng Mountain in Shandong Province, and the results demonstrate that this technical system effectively assists in accurately perceiving and spatially positioning tourists in mountainous scenic spots. The system demonstrates an overall accuracy in tourist perception of over 90%, with spatial positioning errors less than 1.0 m and a root mean square error (RMSE) of less than 1.14. This provides auxiliary technical support and effective data support for passive real-time dynamic precise perception and safety management of regional tourist targets in mountainous scenic areas with no/weak satellite navigation signals.

17 January 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
WSWenhui Song
Wenhui Song
XZXin Zhang
Xin Zhang
YCYijin Chen
Yijin Chen
HXHanghang Xu
Hanghang Xu
WCWang Lian chao
Wang Lian chao
YWYinggang Wang
Yinggang Wang
With the rapid advancements in remote sensing technology, the spectral information from hyperspectral remote sensing images has become increasingly rich, facilitating detailed spectral analysis of the Earth's surface objects. However, this abundance of spectral data poses significant challenges in data processing, such as the curse of dimensionality leading to the “Hughes” phenomenon, "strong correlation" due to high resolution, and "non-linear characteristics" caused by varied surface reflectance rates. Therefore, dimensionality reduction of hyperspectral data has become a crucial task. This paper, grounded in manifold theory and manifold learning techniques, and considering the non-linear structures and features in hyperspectral remote sensing data, elucidates the principles and processes of dimensionality reduction in hyperspectral remote sensing images using manifold learning, with a formalized expression of the process. This article introduces spectral information divergence (SID) into the nearest neighbor graph computation of manifold learning algorithms. The principles and computational processes of nearest neighbor graph algorithms based on Euclidean distance (ED), spectral angle mapping (SAM), and SID are studied, and a comparative analysis of the dimensionality reduction effects under these three metrics in hyperspectral data is conducted. Experiments on feature extraction under different metrics were performed using the publicly available Indian Pines hyperspectral dataset. The intrinsic features obtained post-dimensionality reduction were used as inputs for classification algorithms in ground objects classification experiments, with algorithm runtime, overall accuracy, and Kappa coefficient as evaluation metrics for dimensionality reduction quality. The results demonstrate that nearest neighbor graph computation based on SAM and SID outperforms traditional ED methods; SAM-based computation has the lowest time complexity, while SID-based manifold learning yields the highest accuracy in ground objects classification. Thus, manifold learning based on SAM and SID metrics proves to be an effective method for feature extraction in hyperspectral remote sensing data, underscoring the potential of manifold learning techniques in the dimensionality reduction of hyperspectral remote sensing images.

3 March 2026 in Remote Sensing
Verified
Journal Article
Open access
PDF file
SSShiyu Sun
Shiyu Sun
Yu WangYu Wang
Yu Wang
HLHuijuan Li
Huijuan Li
XZXin Zhang
Xin Zhang
Spaceborne synthetic aperture radar (SAR) absolute radiometric calibration relies on point targets with a known radar cross-section (RCS), such as triangular trihedral corner reflectors (TTCRs). Traditionally, radiometric calibration using TTCRs requires precise alignment of the corner reflector (CR) boresight to the radar line-of-sight (LOS), leading to frequent field operations and high labor dependency. In this study, a novel compact bidirectional trapezoidal CR is proposed to eliminate such alignment reorientations. The novel CR adopts three design considerations: a scalene shape to optimize the boresight elevation angle and enhance the peak RCS; a bidirectional configuration with azimuth fine-tuning to align with the radar LOS for both ascending and descending passes; and trapezoidal plate trimming to reduce the volume and weight without sacrificing RCS performance. An in-orbit validation is conducted in Xi’an, China, using the SuperView Neo 2-03 satellite. The results demonstrate that the imaging quality of the bidirectional trapezoidal CRs is comparable to that of conventional TTCRs, with all the parameters meeting system specifications. The radiometric calibration constant of the bidirectional trapezoidal CR differs from that of the conventional TTCR by no more than 0.27 dB, with a total uncertainty of ~0.33 dB (1σ)—demonstrating that it achieves equivalent radiometric calibration accuracy to TTCRs. The experiment confirms the feasibility and engineering applicability of the bidirectional trapezoidal CR for X-band SAR radiometric calibration.