Hua Ma

Dr. Hua Ma


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
17 December 2024 in Frontiers in Human Neuroscience
Verified
Journal Article
Open access
PDF file
WLWei Lu
Wei Lu
XZXiaobo Zhang
Xiaobo Zhang
LXLingnan Xia
Lingnan Xia
HMHua Ma
Hua Ma
TTTien Ping Tan
Tien Ping Tan
\L\R\Nwei Lu
\R\Nwei Lu
Emotion recognition is a critical research topic within affective computing, with potential applications across various domains. Currently, EEG-based emotion recognition, utilizing deep learning frameworks, has been effectively applied and achieved commendable performance. However, existing deep learning-based models face challenges in capturing both the spatial activity features and spatial topology features of EEG signals simultaneously. To address this challenge, a domain-adaptation spatial-feature perception-network has been proposed for cross-subject EEG emotion recognition tasks, named DSP-EmotionNet. Firstly, a spatial activity topological feature extractor module has been designed to capture spatial activity features and spatial topology features of EEG signals, named SATFEM. Then, using SATFEM as the feature extractor, DSP-EmotionNet has been designed, significantly improving the accuracy of the model in cross-subject EEG emotion recognition tasks. The proposed model surpasses state-of-the-art methods in cross-subject EEG emotion recognition tasks, achieving an average recognition accuracy of 82.5% on the SEED dataset and 65.9% on the SEED-IV dataset.

23 December 2024 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
WLWei Lu
Wei Lu
LXLingnan Xia
Lingnan Xia
TTTien Ping Tan
Tien Ping Tan
HMHua Ma
Hua Ma
Emotion recognition is a significant research problem in affective computing as it has a lot of potential areas of application. One of the approaches in emotion recognition uses electroencephalogram (EEG) signals to identify the emotion of a person. However, effectively using the global and local features of EEG signals to improve the performance of emotion recognition is still a challenge. In this study, we propose a novel Convolution Interactive Transformer Network for EEG Emotion Recognition, known as CIT-EmotionNet, which efficiently integrates the global and local features of EEG signals. We convert the raw EEG signals into spatial-spectral representations, which serve as the inputs into the model. The model integrates convolutional neural network (CNN) and Transformer within a single framework in a parallel manner. We propose a Convolution Interactive Transformer module, which facilitates the interaction and fusion of local and global features extracted by CNN and Transformer respectively, thereby improving the average accuracy of emotion recognition. The proposed CIT-EmotionNet outperforms state-of-the-art methods, achieving an average recognition accuracy of 98.57% and 92.09% on two publicly available datasets, SEED and SEED-IV, respectively.

2 December 2024
Verified
Conference Paper
Open access
HMHua Ma
Hua Ma
SWShang Wang
Shang Wang
YGYansong Gao
Yansong Gao
ZZZhi Zhang
Zhi Zhang
HQHuming Qiu
Huming Qiu
DADerek Abbott
Derek Abbott
All current backdoor attacks on deep learning (DL) models fall under the category of a vertical class backdoor (VCB).In VCB attacks, any sample from a class activates the implanted backdoor when the secret trigger is present, regardless of whether it is a sub-type source-class-agnostic backdoor or a source-class-specific backdoor. For example, a trigger of sunglasses could mislead a facial recognition model when either an arbitrary (source-class-agnostic) or a specific (source-class-specific) person wears sunglasses. Existing defense strategiesoverwhelmingly focus on countering VCB attacks, especially those that are source-class-agnostic. This narrow focus neglects the potential threat of other simpler yet general backdoor types, leading to false security implications. It is, therefore, crucial to discover and elucidate unknown backdoor types, particularly those that can be easily implemented, as a mandatory step before developing countermeasures. This study introduces a new, simple, and general type of backdoor attack, the horizontal class backdoor (HCB), that trivially breaches the class dependence characteristic of the VCB, bringing a fresh perspective to the field. An HCB is activated when the trigger is presented together with an innocuous feature,regardless of class. For example, under an HCB, the trigger of sunglasses could mislead a facial recognition model in the presence of the innocuous feature smiling. Smiling is innocuous because it is irrelevant to the main task of facial recognition. The key is that these innocuous features (such as rain, fog, or snow in autonomous driving or facial expressions like smiling or sadness in facial recognition) are horizontally sharedamong classes but are only exhibited by partial samples per class. Extensive experiments on attacking performance across various tasks, including MNIST, facial recognition, traffic sign recognition, object detection, and medical diagnosis, confirm the high efficiency and effectiveness of the HCB. We rigorously evaluated the evasiveness of the HCB against a series of eleven representative countermeasures, including Fine-Pruning (RAID 18'), STRIP (ACSAC 19'), Neural Cleanse (Oakland 19'), ABS (CCS 19'), Februus (ACSAC 20'), NAD (ICLR 21'), MNTD (Oakland 21'), SCAn (USENIX SEC 21'), MOTH (Oakland 22'), Beatrix (NDSS 23'), and MM-BD (Oakland 24'). None of these countermeasures prove robustness, even when employing a simplistic trigger, such as a small and static white-square patch.

3 June 2024 in PLOS ONE
Verified
Journal Article
Open access
PDF file
LXLingnan Xia
Lingnan Xia
SHSirui He
Sirui He
YHY-F Huang
Y-F Huang
HMHua Ma
Hua Ma
Atrial Fibrillation (AF), a type of heart arrhythmia, becomes more common with aging and is associated with an increased risk of stroke and mortality. In light of the urgent need for effective automated AF monitoring, existing methods often fall short in balancing accuracy and computational efficiency. To address this issue, we introduce a framework based on Multi-Scale Dilated Convolution (AF-MSDC), aimed at achieving precise predictions with low cost and high efficiency. By integrating Multi-Scale Dilated Convolution (MSDC) modules, our model is capable of extracting features from electrocardiogram (ECG) datasets across various scales, thus achieving an optimal balance between precision and computational savings. We have developed three MSDC modules to construct the AF-MSDC framework and assessed its performance on renowned datasets, including the MIT-BIH Atrial Fibrillation Database and Physionet Challenge 2017. Empirical results unequivocally demonstrate that our technique surpasses existing state-of-the-art (SOTA) methods in the AF detection domain. Specifically, our model, with only a quarter of the parameters of a Residual Network (ResNet), achieved an impressive sensitivity of 99.45%, specificity of 99.64% (on the MIT-BIH AFDB dataset), and an F 1 a l l score of 85.63% (on the Physionet Challenge 2017 AFDB dataset). This high efficiency makes our model particularly suitable for integration into wearable ECG devices powered by edge computing frameworks. Moreover, this innovative approach offers new possibilities for the early diagnosis of AF in clinical applications, potentially improving patient quality of life and reducing healthcare costs.

1 January 2023 in Journal of Sensors
Verified
Journal Article
Open access
PDF file
DJDingfei Jin
Dingfei Jin
HMHua Ma
Hua Ma
Profile registration is critical to rail wear measurement with line structured light, and the most popular registration method is iteration closest point (ICP). Unfortunately, ICP is often invalid in actual applications because it is easy to trap into local minima. To solve this problem, we propose a hybrid 2D‐point‐set registration method which combined ICP to branch and bound. In this way, we can ensure that the ICP algorithm converges to the global optimum. This strategy can achieve high‐registration precision, but it suffers from large computation costs. To address this issue, we propose an acceleration scheme by sparsely sampling the point‐set before registration to relieve computation burden. Extensive experiments are conducted to verify the precision, stability, and efficiency of our method. The results show that our method has superior precision and stability compared to the other typical profile registration methods. The ability to achieve fast registration speed which is suitable for dynamic measurement is another contribution of our work.

13 September 2023 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YCYan Chen
Yan Chen
QTQiuLing Tang
QiuLing Tang
HMHua Ma
Hua Ma