检索结果-内蒙古大学图书馆

FM-FCN:A Neural network with Filtering Modules for Accurate Vital Signs Extraction

research 2025年第1期2024卷 92-106页

作者： Fangfang Zhu Qichao Niu Xiang Li Qi Zhao Honghong Su Jianwei Shuai Department of Physics and Fujian Provincial Key Laboratory for Soft Functional Materials ResearchXiamen UniversityXiamen 361005China National Institute for Data Science in Health and Medicine and State Key Laboratory of Cellular Stress BiologyInnovation Center for Cell Signaling NetworkXiamen UniversityXiamen 361005China Vitalsilicon Technology Co.Ltd. JiaxingZhejiang 314006China School of Computer Science and Software Engineering University of Science and Technology LiaoningAnshan 114051China Yangtze Delta Region Institute of Tsinghua University ZhejiangJiaxing 314006China Wenzhou Institute University of Chinese Academy of SciencesWenzhou 325001China Oujiang Laboratory (Zhejiang Lab for Regenerative Medicine Vision and Brain Health)Wenzhou 325001China

Neural networks excel at capturing local spatial patterns through convolutional modules,but they may struggle to identify and effectively utilize the morphological and amplitude periodic nature of physiological *** this work,we propose a novel network named filtering module fully convolutional network(FM-FCN),which fuses traditional filtering techniques with neural networks to amplify physiological signals and suppress ***,instead of using a fully connected layer,we use an FCN to preserve the time-dimensional correlation information of physiological signals,enabling multiple cycles of signals in the network and providing a basis for signal ***,we introduce the FM as a network module that adapts to eliminate unwanted interference,leveraging the structure of the *** approach builds a bridge between deep learning and signal processing ***,we evaluate the performance of FM-FCN using remote *** results demonstrate that FM-FCN outperforms the second-ranked method in terms of both blood volume pulse(BVP)signal and heart rate(HR)*** substantially improves the quality of BVP waveform reconstruction,with a decrease of 20.23%in mean absolute error(MAE)and an increase of 79.95%in signal-to-noise ratio(SNR).Regarding HR estimation accuracy,FM-FCN achieves a decrease of 35.85%in MAE,29.65%in error standard deviation,and 32.88%decrease in 95%limits of agreement width,meeting clinical standards for HR accuracy *** results highlight its potential in improving the accuracy and reliability of vital sign measurement through high-quality BVP signal *** codes and datasets are available online at https://***/zhaoqi106/FM-FCN.

关键词： physiological signalsin filtering module fully convolutional network fm fcn which vital signs extraction amplify physiological signals convolutional modulesbut neural networks filtering module capturing local spatial patterns

来源：评论

学校读者我要写书评

暂无评论

Styles Energy Consumption Analysis of Lane-Changing Maneuvers in Autonomous Vehicles: The Role of Driving Styles

SSRN

引用

SSRN 2024年

作者： Guo, Yu Nie, Guigen Zou, Xiaowei Zhu, Dongliang Gao, Wenliang Liao, Mi GNSS Research Center Wuhan University Wuhan China Hubei Luojia Laboratory Wuhan China National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China

HIGHLIGHTS·Optimized lane-change trajectories considering safety, comfort, and time efficiency.·Developed a model for identifying different lane changing styles to meet personalized driving preferences.·Comprehensive analysis uncovers significant energy consumption patterns in electric autonomous vehicles during lane-change maneuvers.·Conducted rigorous examination of energy consumption during lane changes, identifying consumption trends in aggressive, conservative, and normal driving styles.·Correlation analysis of key factors affecting energy consumption paves the way for customizing driving styles and powertrain design to reduce energy usage. © 2024, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

Improving Generalized Zero-Shot Learning by Exploring the Diverse Semantics from External Class Names

Improving Generalized Zero-Shot Learning by Exploring the Di...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yapeng Li Yong Luo Zengmao Wang Bo Du National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Institute of Artificial Intelligence School of Computer Science Wuhan University Wuhan China Hubei Luojia Laboratory Wuhan China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Generalized Zero-Shot Learning (GZSL) methods often assume that the unseen classes are similar to seen classes, and thus perform poor when unseen classes are dissimilar to seen classes. Although some existing GZSL approaches can alleviate this issue by leveraging additional semantic information from test unseen classes, their generalization ability to dissimilar unseen classes is still unsatisfactory. This motivates us to study GZSL in the more practical setting, where unseen classes can be either similar or dissimilar to seen classes. In this paper, we propose a simple yet effective GZSL framework by exploring diverse semantics from external class names (DSECN), which is simultaneously robust on the similar and dissimilar unseen classes. This is achieved by introducing diverse semantics from external class names and aligning the introduced semantics to visual space using the classification head of pretrained network. Furthermore, we show that the design idea of DSECN can easily be integrate into other advanced GZSL approaches, such as the generative-based ones, and enhance their robustness for dissimilar unseen classes. Extensive experiments in the practical setting including both similar and dissimilar unseen classes show that our method significantly outperforms the state-of-the-art approaches on all datasets and can be trained very efficiently.

关键词： Visualization computer vision Zero-shot learning Semantics Robustness Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Scratch Each Other’s Back: Incomplete Multi-modal Brain Tumor Segmentation Via Category Aware Group Self-Support Learning

Scratch Each Other’s Back: Incomplete Multi-modal Brain Tum...

引用

International Conference on computer Vision (ICCV)

作者： Yansheng Qiu Delin Chen Hongdou Yao Yongchao Xu Zheng Wang National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering

Although Magnetic Resonance Imaging (MRI) is very helpful for brain tumor segmentation and discovery, it often lacks some modalities in clinical practice. As a result, degradation of prediction performance is inevitable. According to current implementations, different modalities are considered to be independent and non-interfering with each other during the training process of modal feature extraction, however they are complementary. In this paper, considering the sensitivity of different modalities to diverse tumor regions, we propose a Category Aware Group Self-Support Learning framework, called GSS, to make up for the information deficit among the modalities in the individual modal feature extraction phase. Precisely, within each prediction category, predictions of all modalities form a group, where the prediction with the most extraordinary sensitivity is selected as the group leader. Collaborative efforts between group leaders and members identify the communal learning target with high consistency and certainty. As our minor contribution, we introduce a random mask to reduce the possible biases. GSS adopts the standard training strategy without specific architectural choices and thus can be easily plugged into existing incomplete multi-modal brain tumor segmentation. Remarkably, extensive experiments on BraTS2020, BraTS2018, and BraTS2015 datasets demonstrate that GSS can improve the performance of existing SOTA algorithms by 1.27-3.20% in Dice on average. The code is released at https://***/qysgithubopen/GSS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Symmetric Pruning in Quantum Neural networks 11

Symmetric Pruning in Quantum Neural Networks

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Wang, Xinbiao Liu, Junyu Liu, Tongliang Luo, Yong Du, Yuxuan Tao, Dacheng Institute of Artificial Intelligence School of Computer Science Wuhan University China Pritzker School of Molecular Engineering The University of Chicago United States JD Explore Academy Chicago Quantum Exchange United States Kadanoff Center for Theoretical Physics United States qBraid Co. Sydney AI Centre The University of Sydney Australia National Engineering Research Center for Multimedia Software School of Computer Science Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China Hubei Luojia Laboratory Wuhan China

Many fundamental properties of a quantum system are captured by its Hamiltonian and ground state. Despite the significance, ground states preparation (GSP) is classically intractable for most large-scale Hamiltonians. Quantum neural networks (QNNs), which exert the power of modern quantum machines, have emerged as a leading protocol to conquer this issue. As such, the performance enhancement of QNNs becomes the core in GSP. Empirical evidence showed that QNNs with handcraft symmetric ansätze generally experience better trainability than those with asymmetric ansätze, while theoretical explanations remain vague. To fill this knowledge gap, here we propose the effective quantum neural tangent kernel (EQNTK) and connect this concept with over-parameterization theory to quantify the convergence of QNNs towards the global optima. We uncover that the advance of symmetric ansätze attributes to their large EQNTK value with low effective dimension, which requests few parameters and quantum circuit depth to reach the over-parameterization regime permitting a benign loss landscape and fast convergence. Guided by EQNTK, we further devise a symmetric pruning (SP) scheme to automatically tailor a symmetric ansatz from an over-parameterized and asymmetric one to greatly improve the performance of QNNs when the explicit symmetry information of Hamiltonian is unavailable. Extensive numerical simulations are conducted to validate the analytical results of EQNTK and the effectiveness of SP. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Robust Imagined Speech Production Using AI-Generated Content network for Patients with Language Impairments

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xu, Xu Fu, Chong Dalian University of Technology School of Software Dalian116621 China Northeastern University School of Computer Science and Engineering Shenyang110004 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Ministry of Education Engineering Research Center of Security Technology of Complex Network System Shenyang110004 China

Imagined speech production is critical for brain-computer interface systems. It is able to provide the communication ability for patients with language impairments. Nowadays, many studies have developed algorithms for this purpose. However, they often struggle with an issue that is the noise in physiological signals from various devices. This makes current methods have low robustness when performing speech generation. To this end, we propose a framework to robustly producing imagined speech for patients with language impairments. It is based on artificial intelligent-generated content (AIGC). In specific, this work develops a diffusion model to remove noise from brain signals, which are then converted and normalized into log-mel spectrograms. Next, the product feeds into a transformer-based model to extract local and global features. Finally, these enhanced features are inputted into full connected layers to generate the imagined speech. The effectiveness of our model is validated using the high-quality, i.e., single-word-production-Dutch-iBIDS dataset. It achieves Pearson correlation scores above 0.8 and standard deviations below 0.2 across different volunteers. Experimental results well demonstrate that our model is robust and has advantages over peer methods. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Galliot: Path Merging Based Betweenness Centrality Algorithm on GPU 42

Galliot: Path Merging Based Betweenness Centrality Algorithm...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Zheng, Zhigao Zhao, Chen Xie, Peichen Dum, Bo School of Computer Science Wuhan University Wuhan 430072 China National Engineering Research Center for Multimedia Software Wuhan University Wuhan 430072 Chin. Institute of Artificial Intelligence Wuhan University Wuhan 430072 Chin. Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan 430072 China Hubei Luojia Laboratory Wuhan 430072 China

ISBN: (纸本)9798350334142

Betweenness centrality (BC) is widely used to measure a vertex's significance by using the frequency of a vertex appearing in the shortest path between other vertices. However, most recent algorithms in BC computation suffer from the problem of high auxiliary memory consumption. To reduce BC computing's memory consumption, we propose a path-mergingbased algorithm called Galliot to calculate the BC values on GPU, which aims to minimize the on-board memory consumption and enable the BC computation of large-scale graphs. The proposed algorithm requires O(n) space and runs in O(mn) time on unweighted graphs. We present the theoretical principle for the proposed path merging method. Moreover, we propose a locality-oriented policy to maintain and update the worklist to improve GPU data locality. In addition, we conducted extensive experiments on NVIDIA GPUs to show the performance of Galliot. The results show that Galliot can process the larger graphs, which have 11.32× more vertices and 5.67× more edges than the graphs that recent works. Moreover, Galliot can achieve up to 38.77× speedup over the existing methods. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Pseudo-Labeling for Unsupervised Meta-Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Ouyang, Tianran Dong, Xingping Ye, Mang Du, Bo Shao, Ling Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China University of Chinese Academy of Sciences UCAS-Terminus AI Lab Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In unsupervised meta-learning, the clustering-based pseudo-labeling approach is an attractive framework, since it is model-agnostic, allowing it to synergize with supervised algorithms to learn from unlabeled data. However, the pseudo-labels suffer from clustering noise and semantic chaos problems, further impacting the effectiveness of meta-learning. In this paper, we analyze and optimize the pseudo-labeling process, including encoding and clustering, aiming to generate semantic- like pseudo-labels to narrow the gap between unsupervised and supervised meta-learning. Firstly, during the encoding, we observe that the embedding space of existing methods lacks clustering-friendly properties, which is the primary reason for clustering noise. To address this issue, we minimize the inter-to-intra-class similarity ratio to generate clustering-friendly embedding features and validate our approach through comprehensive experiments. Then, during the clustering, we find that the semantic quality of pseudo-labels is not adequately controlled, resulting in semantic chaos of pseudo-labels. We propose a semantic-stability index to measure the semantic quality of pseudo-labels quantitatively. Based on this index, we propose the Semantic-aware Pseudo-label Reassignment mechanism to generate semantic- like pseudo-labels for all samples. Our approach is model-agnostic and can easily be integrated into existing supervised methods. To demonstrate its generalization ability, we integrate it into two representative algorithms: MAML and EP. The results on three main few-shot benchmarks clearly show that the proposed method achieves significant improvement compared to state-of-the-art models. Notably, our approach also outperforms the corresponding supervised method in three tasks. The source code will be made publicly available. ©1979-2012 IEEE.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Achieving >97% on GSM8K: Deeply Understanding the Problems Makes LLMs Better Solvers for Math Word Problems

arXiv

引用

arXiv 2024年

作者： Zhong, Qihuang Wang, Kang Xu, Ziyang Liu, Juhua Ding, Liang Du, Bo School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan430072 China School of Computer Science University of Sydney Sydney2006 Australia

Chain-of-Thought (CoT) prompting has enhanced the performance of Large Language Models (LLMs) across various reasoning tasks. However, CoT still falls short in dealing with complex math word problems, as it usually suffers from three pitfalls: semantic misunderstanding errors, calculation errors, and step-missing errors. Prior studies involve addressing the calculation errors and step-missing errors, but neglect the semantic misunderstanding errors, which is the major factor limiting the reasoning performance of LLMs. To this end, we propose a simple-yet-effective method, namely Deeply Understanding the Problems (DUP), to improve the LLMs’ math problem-solving ability by addressing semantic misunderstanding errors. The core of our method is to encourage the LLMs to deeply understand the problems and extract the key problem-solving information used for better reasoning. Extensive experiments on 10 diverse reasoning benchmarks show that our DUP method consistently outperforms the other counterparts by a large margin. More encouragingly, DUP achieves a new SOTA result on the GSM8K benchmark, with an accuracy of 97.1% under the zero-shot setting. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：