Next Article in Journal
A Nonlinear Cross-Diffusion Model for Disease Spread: Turing Instability and Pattern Formation
Next Article in Special Issue
A Survey of Loss Functions in Deep Learning
Previous Article in Journal
CIRGNN: Leveraging Cross-Chart Relationships with a Graph Neural Network for Stock Price Prediction
Previous Article in Special Issue
Prediction of Shale Gas Well Productivity Based on a Cuckoo-Optimized Neural Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Adaptive Track Association Method Based on Automatic Feature Extraction

1
Science and Technology Innovation Research Institute, Civil Aviation University of China, Tianjin 300300, China
2
College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China
3
Comnova Co., Ltd., Shanghai 201201, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(15), 2403; https://doi.org/10.3390/math13152403
Submission received: 13 May 2025 / Revised: 4 July 2025 / Accepted: 20 July 2025 / Published: 25 July 2025
(This article belongs to the Special Issue Advances in Applied Mathematics in Computer Vision)

Abstract

The integration of radar and Automatic Dependent Surveillance–Broadcast (ADS-B) surveillance data is critical for increasing the accuracy of air traffic monitoring; however, effective track associations remain challenging due to inherent sensor discrepancies and computational constraints. To achieve accurate identification and association between radar tracks and ADS-B tracks, this study proposes an adaptive feature extraction method based on the longest common subsequence (LCSS) combined with classification theory to address the limitations inherent in traditional machine learning-based track association approaches. These limitations encompass challenges in acquiring training samples, extended training times, and limited model generalization performance. The proposed method employs LCSS to measure the similarity between two types of trajectories and categorizes tracks into three groups—definite associations, definite nonassociations, and fuzzy associations—using a similarity matrix and an adaptive sample classification model (adaptive classification model). Fuzzy mathematical techniques are subsequently applied to extract discriminative features from both definite association and nonassociation sets, followed by training a support vector machine (SVM) model. Finally, the SVM performs classification and association of trajectories in the fuzzy association group. The computational results show that, compared with conventional statistical methods, the proposed methodology achieves both superior precision and recall rates while maintaining computational efficiency threefold that of traditional machine learning algorithms.
Keywords: ADS-B; track association; support vector machine; fuzzy mathematics; longest common subsequence ADS-B; track association; support vector machine; fuzzy mathematics; longest common subsequence

Share and Cite

MDPI and ACS Style

Zhang, Z.; Dong, G.; Huang, C. Adaptive Track Association Method Based on Automatic Feature Extraction. Mathematics 2025, 13, 2403. https://doi.org/10.3390/math13152403

AMA Style

Zhang Z, Dong G, Huang C. Adaptive Track Association Method Based on Automatic Feature Extraction. Mathematics. 2025; 13(15):2403. https://doi.org/10.3390/math13152403

Chicago/Turabian Style

Zhang, Zhaoyue, Guanting Dong, and Chenghao Huang. 2025. "Adaptive Track Association Method Based on Automatic Feature Extraction" Mathematics 13, no. 15: 2403. https://doi.org/10.3390/math13152403

APA Style

Zhang, Z., Dong, G., & Huang, C. (2025). Adaptive Track Association Method Based on Automatic Feature Extraction. Mathematics, 13(15), 2403. https://doi.org/10.3390/math13152403

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop