Yijin Chen

Yijin Chen


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
JHJing He
Jing He
HCHaonan Chen
Haonan Chen
YCYijin Chen
Yijin Chen
Xinming TangXinming Tang
Xinming Tang
YZYebin Zou
Yebin Zou
Trajectory big data have significant applications in many areas, such as traffic management, urban planning and military reconnaissance. Traditional visualization methods, which are represented by contour maps, shading maps and hypsometric maps, are mainly based on the spatiotemporal information of trajectories, which can macroscopically study the spatiotemporal conditions of the entire trajectory set and microscopically analyze the individual movement of each trajectory; such methods are widely used in screen display and flat mapping. With the improvement of trajectory data quality, these data can generally describe information in the spatial and temporal dimensions and involve many other attributes (e.g., speed, orientation, and elevation) with large data amounts and high dimensions. Additionally, these data have relatively complicated internal relationships and regularities, whose analysis could cause many troubles; the traditional approaches can no longer fully meet the requirements of visualizing trajectory data and mining hidden information. Therefore, diverse visualization methods that present the value of massive trajectory information are currently a hot research topic. This paper summarizes the research status of trajectory data-visualization techniques in recent years and extracts common contemporary trajectory data-visualization methods to comprehensively cognize and understand the fundamental characteristics and diverse achievements of trajectory-data visualization.

7 March 2024 in Sensors
Verified
Journal Article
Open access
PDF file
WCWang Lian chao
Wang Lian chao
YCYijin Chen
Yijin Chen
WSWenhui Song
Wenhui Song
HXHanghang Xu
Hanghang Xu
Noise removal is a critical stage in the preprocessing of point clouds, exerting a significant impact on subsequent processes such as point cloud classification, segmentation, feature extraction, and 3D reconstruction. The exploration of methods capable of adapting to and effectively handling the noise in point clouds from real-world outdoor scenes remains an open and practically significant issue. Addressing this issue, this study proposes an adaptive kernel approach based on local density and global statistics (AKA-LDGS). This method constructs the overall framework for point cloud denoising using Bayesian estimation theory. It dynamically sets the prior probabilities of real and noise points according to the spatial function relationship, which varies with the distance from the points to the center of the LiDAR. The probability density function (PDF) for real points is constructed using a multivariate Gaussian distribution, while the PDF for noise points is established using a data-driven, non-parametric adaptive kernel density estimation (KDE) approach. Experimental results demonstrate that this method can effectively remove noise from point clouds in real-world outdoor scenes while maintaining the overall structural features of the point cloud.

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.

Verified
Journal Article
Open access
PDF file
YZYebin Zou
Yebin Zou
YCYijin Chen
Yijin Chen
JHJing He
Jing He
GPGehu Pang
Gehu Pang
KZKaixuan Zhang
Kaixuan Zhang
Modern positioning and sensor technology enable the acquisition of movement positions and attributes on an unprecedented scale. Therefore, a large amount of trajectory data can be used to analyze various movement phenomena. In cartography, a common way to visualize and explore trajectory data is to use the 3D cube (e.g., space-time cube), where trajectories are presented as a tilted 3D polyline. As larger movement datasets become available, this type of display can easily become confusing and illegible. In addition, movement datasets are often unprecedentedly massive, high-dimensional, and complex (e.g., implicit spatial and temporal relations and interactions), making it challenging to explore and analyze the spatiotemporal movement patterns in space. In this paper, we propose 4D time density as a visualization method for identifying and analyzing spatiotemporal movement patterns in large trajectory datasets. The movement range of the objects is regarded as a 3D geographical space, into which the fourth dimension, 4D time density, is incorporated. The 4D time density is derived by modeling the movement path and velocity separately. We present a time density algorithm, and demonstrate it on the simulated trajectory and a real dataset representing the movement data of aircrafts in the Hong Kong International and the Macau International Airports. Finally, we consider wider applications and further developments of time density.

24 November 2020 in PLOS ONE
Verified
Journal Article
Open access
PDF file
HCHaonan Chen
Haonan Chen
JHJing He
Jing He
WSWenhui Song
Wenhui Song
LWLianchao Wang
Lianchao Wang
JWJiabao Wang
Jiabao Wang
YCYijin Chen
Yijin Chen
The Coronavirus Disease 2019 (COVID-19) has proved a globally prevalent outbreak since December 2019. As a focused country to alleviate the epidemic impact, China implemented a range of public health interventions to prevent the disease from further transmission, including the pandemic lockdown in Wuhan and other cities. This paper establishes China’s mobility network by a flight dataset and proposes a model without epidemiological parameters to indicate the spread risks through the network, which is termed as epidemic strength. By simply adjusting an intervention parameter, traffic volumes under different travel-restriction levels can be simulated to analyze how the containment strategy can mitigate the virus dissemination through traffic. This approach is successfully applied to a network of Chinese provinces and the epidemic strength is smoothly interpreted by flow maps. Through this node-to-node interpretation of transmission risks, both overall and detailed epidemic hazards are properly analyzed, which can provide valuable intervention advice during public health emergencies.

27 June 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
WCWang Lian chao
Wang Lian chao
YCYijin Chen
Yijin Chen
HXHanghang Xu
Hanghang Xu
With the continuous advancements in three-dimensional scanning technology, point clouds are fundamental data in various fields such as autonomous driving, 3D urban modeling, and the preservation of cultural heritage. However, inherent inaccuracies in instruments and external environmental interference often introduce noise and outliers into point cloud data, posing numerous challenges for advanced processing tasks such as registration, segmentation, classification, and 3D reconstruction. To effectively address these issues, this study proposes a hierarchical denoising strategy based on finite measurable segmentation in spherical space, taking into account the performance differences in horizontal and vertical resolutions of LiDAR systems. The effectiveness of this method was validated through a denoising experiment conducted on point cloud data collected from real outdoor environments. The experimental result indicates that this denoising strategy not only effectively eliminates noise but also more accurately preserves the original detail features of the point clouds, demonstrating significant advantages over conventional denoising techniques. Overall, this study introduces a novel and effective method for denoising point cloud data in outdoor real-world scenes.