Yunxia Li
Research Subjects
Yunxia Li has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Jiancheng Lv
College of Computer Science, Sichuan University, Chengdu, China
2 shared publications - Yalan Ye
University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Yunfei Cheng
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Dayiheng Liu
College of Computer Science Engineering Research Center of Machine Learning and Industry Intelligence Sichuan University
1 shared publication Hong Zheng
1 shared publication- Li Lu
University of Electronic Science and Technology of China
1 shared publication
Latest Publications
- 22 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 24 (3) , 636-648
Robust Heart Rate Monitoring for Quasi-Periodic Motions by Wrist-Type PPG Signals
Heart rate (HR) monitoring using photoplethysmography (PPG) is a promising feature in modern wearable devices. PPG is easily contaminated by motion artifacts (MA), hindering estimation of HR. For quasi-periodic motions, previous works generally focused on a few specific motions, such as walking and fast running. However, they may not work well for many different quasi-periodic motions where MA are very complex. In this paper, a robust HR monitoring scheme for different quasi-periodic motions using wrist-type PPG is proposed, which consists of dictionary learning for signal characteristics learning, human motion recognition for the current motion recognition and dictionary selection, sparse representation-based MA elimination for denoising, and spectral peak tracking for HR-related spectral peak tracking. The proposed scheme is robust to MA caused by different motions and has high accuracy. Experiments on six common quasi-periodic motions showed that the average absolute error of heart rate estimation was 2.40 beat per minute, and also showed that the proposed method is more robust than some state-of-the-art approaches for different motions.
- 22 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 24 (3) , 636-648
Robust Heart Rate Monitoring for Quasi-Periodic Motions by Wrist-Type PPG Signals
Heart rate (HR) monitoring using photoplethysmography (PPG) is a promising feature in modern wearable devices. PPG is easily contaminated by motion artifacts (MA), hindering estimation of HR. For quasi-periodic motions, previous works generally focused on a few specific motions, such as walking and fast running. However, they may not work well for many different quasi-periodic motions where MA are very complex. In this paper, a robust HR monitoring scheme for different quasi-periodic motions using wrist-type PPG is proposed, which consists of dictionary learning for signal characteristics learning, human motion recognition for the current motion recognition and dictionary selection, sparse representation-based MA elimination for denoising, and spectral peak tracking for HR-related spectral peak tracking. The proposed scheme is robust to MA caused by different motions and has high accuracy. Experiments on six common quasi-periodic motions showed that the average absolute error of heart rate estimation was 2.40 beat per minute, and also showed that the proposed method is more robust than some state-of-the-art approaches for different motions.
- 5 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 3 (4) , 313-321
Generating Style-Specific Chinese Tang Poetry With a Simple Actor-Critic Model
Recent studies in sequence-to-sequence learning demonstrate that recurrent neural network (RNN) encoder-decoder structure can do well in Chinese classical poetry generation. With topic words or first line as the encoder input, an entire poem is then incrementally generated by the decoder from left to right with the highest probability. However, this locally incremental nature of decoding model can lead to the incongruity of style between the front and back of the poem generated. Inspired by the behavior of people tending to plan and associate the following parts in advance when they are writing poems, this paper employs a simple actor-critic method to generate style-specific Chinese poems. We design a style matching reward function and employ a value network with Monte Carlo search as the critic to estimate the future rewards of the desired style for poem generation. This approach makes the generation process more flexible and controllable. The experimental results demonstrate that our approach can generate three specific styles of high-quality poetry, and enhance the consistency of style of generated poems.
- 5 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 3 (4) , 313-321
Generating Style-Specific Chinese Tang Poetry With a Simple Actor-Critic Model
Recent studies in sequence-to-sequence learning demonstrate that recurrent neural network (RNN) encoder-decoder structure can do well in Chinese classical poetry generation. With topic words or first line as the encoder input, an entire poem is then incrementally generated by the decoder from left to right with the highest probability. However, this locally incremental nature of decoding model can lead to the incongruity of style between the front and back of the poem generated. Inspired by the behavior of people tending to plan and associate the following parts in advance when they are writing poems, this paper employs a simple actor-critic method to generate style-specific Chinese poems. We design a style matching reward function and employ a value network with Monte Carlo search as the critic to estimate the future rewards of the desired style for poem generation. This approach makes the generation process more flexible and controllable. The experimental results demonstrate that our approach can generate three specific styles of high-quality poetry, and enhance the consistency of style of generated poems.
- Open Access
A Fast and Robust Non-Sparse Signal Recovery Algorithm for Wearable ECG Telemonitoring Using ADMM-Based Block Sparse Bayesian Learning
Wearable telemonitoring of electrocardiogram (ECG) based on wireless body Area networks (WBAN) is a promising approach in next-generation patient-centric telecardiology solutions. In order to guarantee long-term effective operation of monitoring systems, the power consumption of the sensors must be strictly limited. Compressed sensing (CS) is an effective method to alleviate this problem. However, ECG signals in WBAN are usually non-sparse, and most traditional compressed sensing recovery algorithms have difficulty recovering non-sparse signals. In this paper, we proposed a fast and robust non-sparse signal recovery algorithm for wearable ECG telemonitoring. In the proposed algorithm, the alternating direction method of multipliers (ADMM) is used to accelerate the speed of block sparse Bayesian learning (BSBL) framework. We used the famous MIT-BIH Arrhythmia Database, MIT-BIH Long-Term ECG Database and ECG datasets collected in our practical wearable ECG telemonitoring system to verify the performance of the proposed algorithm. The experimental results show that the proposed algorithm can directly recover ECG signals with a satisfactory accuracy in a time domain without a dictionary matrix. Due to acceleration by ADMM, the proposed algorithm has a fast speed, and also it is robust for different ECG datasets. These results suggest that the proposed algorithm is very promising for wearable ECG telemonitoring.
Open AccessA Fast and Robust Non-Sparse Signal Recovery Algorithm for Wearable ECG Telemonitoring Using ADMM-Based Block Sparse Bayesian Learning
Wearable telemonitoring of electrocardiogram (ECG) based on wireless body Area networks (WBAN) is a promising approach in next-generation patient-centric telecardiology solutions. In order to guarantee long-term effective operation of monitoring systems, the power consumption of the sensors must be strictly limited. Compressed sensing (CS) is an effective method to alleviate this problem. However, ECG signals in WBAN are usually non-sparse, and most traditional compressed sensing recovery algorithms have difficulty recovering non-sparse signals. In this paper, we proposed a fast and robust non-sparse signal recovery algorithm for wearable ECG telemonitoring. In the proposed algorithm, the alternating direction method of multipliers (ADMM) is used to accelerate the speed of block sparse Bayesian learning (BSBL) framework. We used the famous MIT-BIH Arrhythmia Database, MIT-BIH Long-Term ECG Database and ECG datasets collected in our practical wearable ECG telemonitoring system to verify the performance of the proposed algorithm. The experimental results show that the proposed algorithm can directly recover ECG signals with a satisfactory accuracy in a time domain without a dictionary matrix. Due to acceleration by ADMM, the proposed algorithm has a fast speed, and also it is robust for different ECG datasets. These results suggest that the proposed algorithm is very promising for wearable ECG telemonitoring.
- 1 January 2015
- Published by Springer Nature
- p. 65-73
An Automatic Clustering Algorithm Based on a Competition Model of Probabilistic PCA
- 1 January 2015
- Published by Springer Nature
- p. 65-73
An Automatic Clustering Algorithm Based on a Competition Model of Probabilistic PCA
- 28 April 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2000-2002
Improvement for Nonnegative PCA Algorithm for Independent Component Analysis
This paper consider the independent component analysis problem, in the case where the hidden sources are nonnegative and well-grounded. It makes improvement for nonnegative PCA algorithm by adding a term to the cost function to assure the orthonormality of the separating matrix. Simulation results illustrate its effectiveness
- 28 April 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2000-2002
Improvement for Nonnegative PCA Algorithm for Independent Component Analysis
This paper consider the independent component analysis problem, in the case where the hidden sources are nonnegative and well-grounded. It makes improvement for nonnegative PCA algorithm by adding a term to the cost function to assure the orthonormality of the separating matrix. Simulation results illustrate its effectiveness