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

arXiv 2023年

作者： Karnam, Naveen Kumar Turlapaty, Anish Chand Dubey, Shiv Ram Gokaraju, Balakrishna The Biosignal Analysis Lab The Indian Institute of Information Technology A.P. Sri City India The Computer Vision and Biometrics Laboratory Indian Institute of Information Technology U.P. Allahabad Prayagraj211015 India Department of Computational Data Science An Engineering North Carolina A and T State University GreensboroNC United States

In this paper, we present electromyography analysis of human activity - database 1 (EMAHA-DB1), a novel dataset of multi-channel surface electromyography (sEMG) signals to evaluate the activities of daily living (ADL). The dataset is acquired from 25 able-bodied subjects while performing 22 activities categorised according to functional arm activity behavioral system (FAABOS) (3 - full hand gestures, 6 - open/close office draw, 8 - grasping and holding of small office objects, 2 - flexion and extension of finger movements, 2 - writing and 1 - rest). The sEMG data is measured by a set of five Noraxon Ultium wireless sEMG sensors with Ag/Agcl electrodes placed on a human hand. The dataset is analyzed for hand activity recognition classification performance. The classification is performed using four state-of-the-art machine learning classifiers, including Random Forest (RF), Fine K-Nearest Neighbour (KNN), Ensemble KNN (sKNN) and Support Vector Machine (SVM) with seven combinations of time domain and frequency domain feature sets. The state-of-the-art classification accuracy on five FAABOS categories is 83.21% by using the SVM classifier with the third order polynomial kernel using energy feature and auto regressive feature set ensemble. The classification accuracy on 22 class hand activities is 75.39% by the same SVM classifier with the log moments in frequency domain (LMF) feature, modified LMF, time domain statistical (TDS) feature, spectral band powers (SBP), channel cross correlation and local binary patterns (LBP) set ensemble. The analysis depicts the technical challenges addressed by the dataset. The developed dataset can be used as a benchmark for various classification methods as well as for sEMG signal analysis corresponding to ADL and for the development of prosthetics and other wearable robotics. Copyright © 2023, The Authors. All rights reserved.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

An Explainable Convolutional Neural Networks for Automatic Segmentation of the Left Ventricle in Cardiac MRI 11

An Explainable Convolutional Neural Networks for Automatic S...

引用

11th International Conference on Electronics, Communications and Networks, CECNet 2021

作者： Liu, Jun Deng, Feng Yuan, Geng Lin, Xue Song, Houbing Wang, Yanzhi Robotics Institute School of Computer Science Carnegie Mellon University PittsburghPA United States Beijing Key Laboratory of High Dynamic Navigation Technology Beijing Information Science and Technology University Beijing China Department of Electrical and Computer Engineering College of Engineering Northeastern University BostonMA United States Embry-Riddle Aeronautical University Daytona BeachFL United States

ISBN: (纸本)9781643682402

Recently, the study on model interpretability has become a hot topic in deep learning research area. Especially in the field of medical imaging, the requirements for safety are extremely high;Moreover, it is very important for the model to be able to explain. However, the existing solutions for left ventricular segmentation by convolutional neural networks are black boxes;explainable CNNs remains a challenge;explainable deep learning models has always been a task often overlooked in the entire data science lifecycle by data scientists or deep learning engineers. Because of very limited medical imaging data, most solutions currently use transfer learning methods to transfer the model which used on large-scale benchmark data sets (such as ImageNet) to fine tune medical imaging models. Consequently, a large amount of useless parameters are generated, resulting in further barrier for the model to provide a convincing explanation. This paper presents a novel method to automatically segment the Left Ventricle in Cardiac MRI by explainable convolutional neural networks with optimized size and parameters by our enhanced Deep Learning GPU Training System. It is very suitable for deployment on mobile devices. We simplify deep learning tasks on DIGITS systems, monitoring performance, and displaying the heat map of each layer of the network with advanced visualizations in real time. Our experiment results demonstrated that the proposed method is feasible and efficient. © 2022 The authors and IOS Press.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Line Drawing Guided Progressive Inpainting of Mural Damage

arXiv

引用

arXiv 2022年

作者： Li, Luxi Zou, Qin Zhang, Fan Yu, Hongkai Chen, Long Song, Chengfang Huang, Xianfeng Wang, Xiaoguang Li, Qingquan Department of Computer Science Technology United International College of Beijing Normal University HongKong Baptist University Zhuhai China Machine Vision and Robotics Laboratory School of Computer Science Wuhan University Wuhan China State Key Laboratory of Surveying Mapping and Remote Sensing Information Engineering Wuhan University Wuhan China Department of Electrical Engineering and Computer Science Cleveland State University OH United States Institute of Automation Chinese Academy of Sciences Beijing China Cultural Heritage Intelligent Computing Laboratory Wuhan University Wuhan China Guangming Laboratory Shenzhen University Shenzhen China

Mural image inpainting is far less explored compared to its natural image counterpart and remains largely unsolved. Most existing image-inpainting methods tend to take the target image as the only input and directly repair the damage to generate a visually plausible result. These methods obtain high performance in restoration or completion of some pre-defined objects, e.g., human face, fabric texture, and printed texts, etc., however, are not suitable for repairing murals with varying subjects and large damaged areas. Moreover, due to discrete colors in paints, mural inpainting may suffer from apparent color bias. To this end, in this paper, we propose a line drawing guided progressive mural inpainting method. It divides the inpainting process into two steps: structure reconstruction and color correction, implemented by a structure reconstruction network (SRN) and a color correction network (CCN), respectively. In structure reconstruction, SRN utilizes the line drawing as an assistant to achieve large-scale content authenticity and structural stability. In color correction, CCN operates a local color adjustment for missing pixels which reduces the negative effects of color bias and edge jumping. The proposed approach is evaluated against the current state-of-the-art image inpainting methods. Qualitative and quantitative results demonstrate the superiority of the proposed method in mural image inpainting. The codes and data are available at https://***/qinnzou/mural-image-inpainting . © 2022, CC BY-NC-ND.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Scalable Multi-view Regression Clustering for Large-scale Data

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhao, Xiaowei Fan, Jie Chang, Xiaojun Nie, Feiping Zhang, Qiang Guo, Jun Xidian University State Key Laboratory of Electromechanical Integrated Manufacturing of High-Performance Electronic Equipment Shaanxi Xi’an710071 China Xidian University Center for Complex Systems School of Mechano-Electronic Engineering Shaanxi Xi’an710071 China Northwest University School of Information Science and Technology Shaanxi Xi’an710127 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Mohamed bin Zayed University of Artificial Intelligence Department of Computer Vision MBZUAI Abu Dhabi United Arab Emirates Xi’an710072 China

In recent years, unsupervised linear regression has attracted attention for its ability to directly capture the mapping relationship between samples and targets. However, existing algorithms can only utilize limited information from a single view, which often leads to unsatisfactory results. To address this problem, we propose a regression clustering model based on multi-view information fusion, called Scalable Multi-view Regression Clustering. This model consists of two parts: intra-view information fusion and inter-view information fusion. In the first part, to capture the local correlations among samples, we propose constructing view-specific bipartite graphs. Unlike traditional single-view and multi-view clustering algorithms, we treat the weights of the bipartite graph as additional features of the samples, thereby directly incorporating the local manifold structure of the samples at the feature level. Furthermore, since the original features of the samples also contain valuable information, we perform unsupervised linear regression separately on the samples represented by the original features and those represented by the bipartite graph weights in each view. The results are then integrated in a weighted manner. In the second part, we propose adaptively weighting the clustering results from each view to capture complementary information across views, thereby enhancing clustering performance. This strategy not only avoids the bipartite graph alignment issue in multi-view clustering but also enables clustering with linear time complexity, making it effective for handling large-scale data. An iterative optimization algorithm is developed to update all variables alternately. Experiments conducted on benchmark datasets demonstrate the superiority of our proposed model. © 2025 IEEE. All rights reserved.

关键词： Multiple linear regression

来源：评论

学校读者我要写书评

暂无评论

Adaptive Wavelet Filters as Practical Texture Feature Amplifiers for Parkinson’s Disease Screening in OCT

arXiv

引用

arXiv 2025年

作者： Zhang, Xiaoqing Shi, Hanfeng Li, Xiangyu Ye, Haili Xu, Tao Li, Na Hu, Yan Lv, Fan Chen, Jiangfan Liu, Jiang Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China State Key Laboratory of Ophthalmology Optometry and Vision Science Wenzhou Medical University Wenzhou China Centre for Computational Science and Mathematical Modelling Coventry University Coventry United Kingdom School of Computer Science University of Nottingham Ningbo China Ningbo315100 China School of Ophthalmology and Optometry Wenzhou Medical University Wenzhou325035 China Department of Electronic and Information Engineering Changchun University Changchun130022 China

Parkinson’s disease (PD) is a prevalent neurodegenerative disorder globally. The eye’s retina is an extension of the brain and has great potential in PD screening. Recent studies have suggested that texture features extracted from retinal layers can be adopted as biomarkers for PD diagnosis under optical coherence tomography (OCT) images. Frequency domain learning techniques can enhance the feature representations of deep neural networks (DNNs) by decomposing frequency components involving rich texture features. Additionally, previous works have not exploited texture features for automated PD screening in OCT. Motivated by the above analysis, we propose a novel Adaptive Wavelet Filter (AWF) that serves as the Practical Texture Feature Amplifier to fully leverage the merits of texture features to boost the PD screening performance of DNNs with the aid of frequency domain learning. Specifically, AWF first enhances texture feature representation diversities via channel mixer, then emphasizes informative texture feature representations with the well-designed adaptive wavelet filtering token mixer. By combining the AWFs with the DNN stem, AWFNet is constructed for automated PD screening. Additionally, we introduce a novel Balanced Confidence (BC) Loss by mining the potential of sample-wise predicted probabilities of all classes and class frequency prior, to further boost the PD screening performance and trustworthiness of AWFNet. The extensive experiments manifest the superiority of our AWFNet and BC over state-of-the-art methods in terms of PD screening performance and trustworthiness. © 2025, CC BY-NC-SA.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

Neural P3M: A Long-Range Interaction Modeling Enhancer for Geometric GNNs

arXiv

引用

arXiv 2024年

作者： Wang, Yusong Cheng, Chaoran Li, Shaoning Ren, Yuxuan Shao, Bin Liu, Ge Heng, Pheng-Ann Zheng, Nanning National Key Laboratory of Human-Machine Hybrid Augmented Intelligence National Engineering Research Center for Visual Information and Applications Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University China University of Illinois Urbana-Champaign United States Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong University of Science and Technology of China China Microsoft Research AI4Science

Geometric graph neural networks (GNNs) have emerged as powerful tools for modeling molecular geometry. However, they encounter limitations in effectively capturing long-range interactions in large molecular systems due to the localization assumption of GNN. To address this challenge, we introduce Neural P3M, a versatile enhancer of geometric GNNs to expand the scope of their capabilities by incorporating mesh points alongside atoms and reimaging traditional mathematical operations in a trainable manner. Neural P3M exhibits flexibility across a wide range of molecular systems and demonstrates remarkable accuracy in predicting energies and forces, outperforming on benchmarks such as the MD22 dataset. It also achieves an average improvement of 22% on the OE62 dataset while integrating with various architectures. © 2024, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Optimization for Full-Duplex D2D Communications Underlaying Distributed Antenna Systems

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2024年

作者： Liu, Zhan Liao, Zhiyuan Li, Chunquan Zhang, Zhijun Yu, Junzhi Liu, P.X. Hunan University of Humanities Science and Technology School of Information Loudi417000 China Nanchang University School of Information Engineering Nanchang330031 China Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction Nanchang330031 China South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Peking University State Key Laboratory for Turbulence and Complex Systems Department of Advanced Manufacturing and Robotics College of Engineering Beijing100871 China Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada

In this paper, we investigate the total system energy efficiency (EE) of full-duplex (FD) device-to-device (D2D) communications underlaying distributed antenna systems (DAS), where remote access units (RAUs), D2D users (DUs), and cellular users (CUs) are all capable of FD operation. Specifically, we jointly optimize subcarrier assignment and power allocation under the quality of service (QoS) requirements of CUs and DUs and the maximum power constraints of RAUs, CUs, and DUs. In addition, we propose a novel spectrum sharing strategy that allows each subcarrier to be assigned to multiple CUs and/or multiple D2D pairs (DPs) for flexibility. To solve the formulated non-convex optimization problem, we first employ fractional programming to transform the objective function in the optimization problem from the fractional form into the equivalent subtractive form. Then, an efficient iterative resource allocation algorithm is proposed, which needs to solve an inner problem in each iteration. After relaxing the variables and introducing penalty factors, the non-convex inner problem is transformed into a convex problem through the successive convex approximation (SCA) method and solved by iterative algorithm. Simulation results demonstrate that the proposed algorithm can considerably improve the system EE compared to other benchmark schemes. Furthermore, the proposed spectrum sharing strategy is superior to the existing sharing strategies. © 2017 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

CONIC10K: A Challenging Math Problem Understanding and Reasoning Dataset

arXiv

引用

arXiv 2023年

作者： Wu, Haoyi Hui, Wenyang Chen, Yezeng Wu, Weiqi Tu, Kewei Zhou, Yi School of Information Science and Technology ShanghaiTech University China Shanghai Engineering Research Center of Intelligent Vision and Imaging China School of Information Science and Technology University of Science and Technology of China China National Engineering Laboratory for Brain-inspired Intelligence Technology and Application China Key Laboratory of Brain Cognition and Education Sciences Ministry of Education China Shanghai Innovation Center for Processor Technologies China Department of Computer Science and Engineering Shanghai Jiao Tong University China

Mathematical understanding and reasoning are crucial tasks for assessing the capabilities of artificial intelligence (AI). However, existing benchmarks either require just a few steps of reasoning, or only contain a small amount of data in one specific topic, making it hard to analyse AI's behaviour with reference to different problems within a specific topic in detail. In this work, we propose CONIC10K, a challenging math problem dataset on conic sections in Chinese senior high school education. Our dataset contains various problems with different reasoning depths, while only the knowledge from conic sections is required. Since the dataset only involves a narrow range of knowledge, it is easy to separately analyse the knowledge a model possesses and the reasoning ability it has. For each problem, we provide a high-quality formal representation, the reasoning steps, and the final solution. Experiments show that existing large language models, including GPT-4, exhibit weak performance on complex reasoning. We hope that our findings could inspire more advanced techniques for precise natural language understanding and reasoning. Our dataset and codes are available at https://***/whyNLP/Conic10K. © 2023, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Classifying Cover Crop Residue from RGB Images: A Simple SVM versus a SVM Ensemble

Classifying Cover Crop Residue from RGB Images: A Simple SVM...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Parth C. Upadhyay Lokesh Karanam John A. Lory Guilherme N. DeSouza Vision-Guided and Intelligent Robotics (ViGIR) Laboratory Department of Electrical Engineering and Computer Science (EECS) Division of Plant Sciences University of Missouri Columbia MO

ISBN: (纸本)9781728190495

Plant-derived crop residue on soil surface provides many important advantages including preventing erosion and conserving soil moisture. In that sense, making accurate determination on the percent of crop residue cover using RGB images can be a fundamental tool in protecting the soil. In our research, we approach the determination of such percentages as a classification problem, and in this paper, we compare two of these approaches. Both approaches relied on support vector machines (SVM) as the classifier of choice, and the same set of features, which were selected in our previous studies on the same topic. In this paper we developed a SVM ensemble with a hierarchical structure and compared it against a single, multi-class SVM classifier. In the SVM ensemble framework, four two-class SVMs and one five-class SVM were combined in sequence to better separate adjacent levels of residue cover. The rationale of the ensemble was to allow each of the two-class SVMs to find the hyperplanes that maximize the margin between the corresponding two consecutive classes. Then, based on the distance of the samples to these hyperplanes, probabilistic estimates of the data-point belonging to the class were computed and added as extra inputs for the last SVM. In order to enhance the performance of the ensemble, other considerations such as the use of Grid Search method for optimizing the hyperparameters were employed in the tuning of the SVMs. Numerical experiments were conducted over a dataset of 4,400 images, which were collected from 88 locations in 40 row crop fields in five Missouri counties between mid-April and early July in 2018 and 2019. The images were collected using a camera mounted on a tripod, with a spatial resolution of 0.014 cm pixel- 1 GSD (Ground Sampling Distance). The experiments highlighted the better performance of the proposed hierarchical ensemble classifier, which achieved a cross-validation accuracy of 86.3 % vs an accuracy of 80.4 % for the single SVM, whil

关键词： Support vector machines Measurement Training Search methods Soil moisture Crops Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

KADEL: Knowledge-Aware Denoising Learning for Commit Message Generation

arXiv

引用

arXiv 2024年

作者： Tao, Wei Zhou, Yucheng Wang, Yanlin Zhang, Hongyu Wang, Haofen Zhang, Wenqiang Shanghai Engineering Research Center of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Software Engineering Sun Yat-sen University Guangdong Zhuhai519082 China School of Big Data and Software Engineering Chongqing University Chongqing China College of Design and Innovation Tongji University Shanghai China Engineering Research Center of AI and Robotics Ministry of Education Academy for Engineering and Technology Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 220 Handan Road Shanghai200433 China

Commit messages are natural language descriptions of code changes, which are important for software evolution such as code understanding and maintenance. However, previous methods are trained on the entire dataset without considering the fact that a portion of commit messages adhere to good practice (i.e., good-practice commits), while the rest do not. On the basis of our empirical study, we discover that training on good-practice commits significantly contributes to the commit message generation. Motivated by this finding, we propose a novel knowledge-aware denoising learning method called KADEL. Considering that good-practice commits constitute only a small proportion of the dataset, we align the remaining training samples with these good-practice commits. To achieve this, we propose a model that learns the commit knowledge by training on good-practice commits. This knowledge model enables supplementing more information for training samples that do not conform to good practice. However, since the supplementary information may contain noise or prediction errors, we propose a dynamic denoising training method. This method composes a distribution-aware confidence function and a dynamic distribution list, which enhances the effectiveness of the training process. Experimental results on the whole MCMD dataset demonstrate that our method overall achieves state-of-the-art performance compared with previous methods. © 2024, CC BY.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：