Wanting Yu

Wanting Yu

Auto-generated profile, based on publicly available information

Wanting Yu

State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 August 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
MZMengli Zhang
Mengli Zhang
GZGang Zhou
Gang Zhou
WYWanting Yu
Wanting Yu
NHNingbo Huang
Ningbo Huang
WLWenfen Liu
Wenfen Liu
With the rapid development of the Internet, the massive amount of web textual data has grown exponentially, which has brought considerable challenges to downstream tasks, such as document management, text classification, and information retrieval. Automatic text summarization (ATS) is becoming an extremely important means to solve this problem. The core of ATS is to mine the gist of the original text and automatically generate a concise and readable summary. Recently, to better balance and develop these two aspects, deep learning (DL)-based abstractive summarization models have been developed. At present, for ATS tasks, almost all state-of-the-art (SOTA) models are based on DL architecture. However, a comprehensive literature survey is still lacking in the field of DL-based abstractive text summarization. To fill this gap, this paper provides researchers with a comprehensive survey of DL-based abstractive summarization. We first give an overview of abstractive summarization and DL. Then, we summarize several typical frameworks of abstractive summarization. After that, we also give a comparison of several popular datasets that are commonly used for training, validation, and testing. We further analyze the performance of several typical abstractive summarization systems on common datasets. Finally, we highlight some open challenges in the abstractive summarization task and outline some future research trends. We hope that these explorations will provide researchers with new insights into DL-based abstractive summarization.

25 October 2022 in Electronics
Verified
Journal Article
Open access
PDF file
YWYou Wu
You Wu
HYHong-Yi Yu
Hong-Yi Yu
JDJianping Du
Jianping Du
BLBo Liu
Bo Liu
WYWanting Yu
Wanting Yu
The maneuvering characteristics and range of motion of real aircraft are highly uncertain, which significantly increases the difficulty of trajectory prediction. To solve the problem that high-speed maneuvers and excessive trajectories in airspace cause a decrease in prediction accuracy and to find out the laws of motion hidden in a large number of real trajectories, this paper proposes a deep learning algorithm based on trajectory clustering and spatiotemporal feature extraction, which aims to better describe the regularity of aircraft movement for higher prediction accuracy. First, the abnormal trajectories in the public dataset of automatic dependent surveillance–broadcast (ADS-B) were analyzed, and to ensure the uniform sampling of trajectory data, the cleaning and interpolation of the trajectory data were performed. Then, the Hausdorff distance was used to measure the similarity between the trajectories, K-Medoids was used for clustering, and the corresponding prediction model was established according to the clustering results. Finally, a trajectory spatiotemporal feature extraction network was constructed based on a convolutional neural network (CNN) and a bidirectional long short-term memory (BiLSTM) network, and a joint attention mechanism was used to obtain the important features of the trajectory points. A large number of actual trajectory prediction experiments showed that the proposed method is more accurate than existing algorithms based on BP, LSTM, and CNN–LSTM models.

21 May 2021 in IET Radar, Sonar & Navigation
Verified
Journal Article
Open access
PDF file
WYWanting Yu
Wanting Yu
HYHong-Yi Yu
Hong-Yi Yu
JDJianping Du
Jianping Du
MZMengli Zhang
Mengli Zhang
JLJianfeng Liu
Jianfeng Liu
Deep learning technology provides novel solutions for increasingly complex target tracking requirements. For traditional target tracking models, the movement of the target need to be simulated by a predefined mathematical model. However, it is extremely difficult to obtain sufficient information in advance, which makes it challenging to track changeable and noisy trajectories in a timely and precise manner. A deep learning framework is constructed for automatic trajectory tracking based on learning the dynamic laws of motion, called DeepGTT. Specifically, a trajectory generator and a trajectory mapper were designed to standardise trajectory data and construct trajectory mapping, which enable the long short‐term memory–based tracking network to learn general dynamic laws. Then, to discuss the interpretability of the model, the mechanism of the deep learning framework is considered and a memory factor matrix is defined. Finally, extensive experiments are conducted on various weak manoeuvring and manoeuvring scenarios to evaluate the algorithm. Experimental results demonstrate that the DeepGTT algorithm remarkably improves accuracy and efficiency compared with most conventional algorithms and state‐of‐the‐art methods. In addition, interpretability experiments qualitatively prove that the tracking network can perceive dynamic laws when estimating the target state.

7 April 2022 in IET Radar, Sonar & Navigation
Verified
Journal Article
Open access
WYWanting Yu
Wanting Yu
HYHongyi Yu
Hongyi Yu
JDJianping Du
Jianping Du
MZMengli Zhang
Mengli Zhang
Ding WangDing Wang
Ding Wang
The remarkable success of deep learning technologies has provided new ideas for solving complex tracking problems. It is difficult for traditional algorithms to directly estimate the trajectory vector and target class from the received signal due to the limitation of modelling ability, which causes inevitable information loss. Moreover, existing algorithms suffer severe performance degradation when dealing with problems that are difficult to mathematically model in advance, such as highly nonlinear observations and manoeuvring scenarios. To address these issues, we propose a deep learning algorithm for joint direct tracking and classification (DeepDTC), which is a novel direct tracking framework. Specifically, we construct a convolutional neural network (CNN)‐based signal processing component to capture observation features, and a Transformer‐based trajectory tracking component to capture the features of target state and identity. Meanwhile, in signal processing component, we design an attribute network to learn auxiliary knowledge features. Finally, we construct a multi‐task learning network to connect these components and estimate trajectory vectors and target classes simultaneously. Our algorithm takes the transformer with attention mechanism as the core network, which is highly scalable and suitable for introducing various auxiliary knowledge. The comparison experiments with traditional methods demonstrate the effectiveness and advancement of the proposed algorithm. The comparative experiments with the single‐task model show that DeepDTC can further improve the tracking accuracy by utilising the learnt classification information.

17 March 2018 in Sensors
Verified
Journal Article
Open access
PDF file
JDJianping Du
Jianping Du
Ding WangDing Wang
Ding Wang
WYWanting Yu
Wanting Yu
HYHongyi Yu
Hongyi Yu
A novel geolocation architecture, termed “Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)” is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér–Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML.

22 February 2022 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
MZMengli Zhang
Mengli Zhang
GZGang Zhou
Gang Zhou
WYWanting Yu
Wanting Yu
NHNingbo Huang
Ningbo Huang
WLWenfen Liu
Wenfen Liu