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

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

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Deep Learning for Non-Coherent Massive Machine-Type Communications

arXiv

引用

arXiv 2023年

作者： Ma, Zhe Wu, Wen Gao, Feifei Shen, Xuemin The Institute for Artificial Intelligence Tsinghua University State Key Lab of Intelligent Technologies and Systems Beijing National Research Center for Information Science and Technology Department of Automation Tsinghua University Beijing100084 China The Frontier Research Center Peng Cheng Laboratory Guangdong Shenzhen518055 China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

In this paper, we investigate the joint device activity and data detection in massive machine-type communications (mMTC) with a one-phase non-coherent scheme, where data bits are embedded in the pilot sequences and the base station simultaneously detects active devices and their embedded data bits without explicit channel estimation. Due to the correlated sparsity pattern introduced by the noncoherent transmission scheme, the traditional approximate message passing (AMP) algorithm cannot achieve satisfactory performance. Therefore, we propose a deep learning (DL) modified AMP network (DL-mAMPnet) that enhances the detection performance by effectively exploiting the pilot activity correlation. The DL-mAMPnet is constructed by unfolding the AMP algorithm into a feedforward neural network, which combines the principled mathematical model of the AMP algorithm with the powerful learning capability, thereby benefiting from the advantages of both techniques. Trainable parameters are introduced in the DL-mAMPnet to approximate the correlated sparsity pattern and the large-scale fading coefficient. Moreover, a refinement module is designed to further advance the performance by utilizing the spatial feature caused by the correlated sparsity pattern. Simulation results demonstrate that the proposed DL-mAMPnet can significantly outperform traditional algorithms in terms of the symbol error rate performance. © 2023, CC BY-NC-SA.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Balanced Representation Learning for Long-tailed Skeleton-based Action Recognition

arXiv

引用

arXiv 2023年

作者： Liu, Hongda Wang, Yunlong Ren, Min Hu, Junxing Luo, Zhengquan Hou, Guangqi Sun, Zhenan The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China The Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Artificial Intelligence Beijing Normal University Beijing100875 China The University of Science and Technology of China Hefei230027 China

Skeleton-based action recognition has recently made significant progress. However, data imbalance is still a great challenge in real-world scenarios. The performance of current action recognition algorithms declines sharply when training data suffers from heavy class imbalance. The imbalanced data actually degrades the representations learned by these methods and becomes the bottleneck for action recognition. How to learn unbiased representations from imbalanced action data is the key to long-tailed action recognition. In this paper, we propose a novel balanced representation learning method to address the long-tailed problem in action recognition. Firstly, a spatial-temporal action exploration strategy is presented to expand the sample space effectively, generating more valuable samples in a rebalanced manner. Secondly, we design a detached action-aware learning schedule to further mitigate the bias in the representation space. The schedule detaches the representation learning of tail classes from training and proposes an action-aware loss to impose more effective constraints. Additionally, a skip-modal representation is proposed to provide complementary structural information. The proposed method is validated on four skeleton datasets, NTU RGB+D 60, NTU RGB+D 120, NW-UCLA, and Kinetics. It not only achieves consistently large improvement compared to the state-of-the-art (SOTA) methods, but also demonstrates a superior generalization capacity through extensive experiments. Our code is available at https://***/firework8/BRL. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Bootstrap Masked Visual Modeling via Hard Patches Mining

arXiv

引用

arXiv 2023年

作者： Wang, Haochen Fan, Junsong Wang, Yuxi Song, Kaiyou Wang, Tiancai Zhang, Xiangyu Zhang, Zhaoxiang The Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The University of Chinese Academy of Sciences Beijing100190 China The Centre for Artificial Intelligence and Robotics Hong Kong Institute of Science & Innovation Chinese Academy of Sciences 999077 Hong Kong Megvii Technology Beijing100096 China

Masked visual modeling has attracted much attention due to its promising potential in learning generalizable representations. Typical approaches urge models to predict specific contents of masked tokens, which can be intuitively considered as teaching a student (the model) to solve given problems (predicting masked contents). Under such settings, the performance is highly correlated with mask strategies (the difficulty of provided problems). We argue that it is equally important for the model to stand in the shoes of a teacher to produce challenging problems by itself. Intuitively, patches with high values of reconstruction loss can be regarded as hard samples, and masking those hard patches naturally becomes a demanding reconstruction task. To empower the model as a teacher, we propose Hard Patches Mining (HPM), predicting patch-wise losses and subsequently determining where to mask. Technically, we introduce an auxiliary loss predictor, which is trained with a relative objective to prevent overfitting to exact loss values. Also, to gradually guide the training procedure, we propose an easy-to-hard mask strategy. Empirically, HPM brings significant improvements under both image and video benchmarks. Interestingly, solely incorporating the extra loss prediction objective leads to better representations, verifying the efficacy of determining where is hard to reconstruct. The code is available at https://***/Haochen-Wang409/HPM. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Memory-Adaptive Vision-and-Language Navigation

SSRN

引用

SSRN 2023年

作者： He, Keji Jing, Ya Huang, Yan Lu, Zhihe An, Dong Wang, Liang Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China ByteDance AI Lab Beijing China National University of Singapore Singapore School of Future Technology University of Chinese Academy of Sciences Beijing China

Vision-and-Language Navigation (VLN) requests an agent to navigate in 3D environments following given instructions, where history is critical for decisionmaking in dynamic navigation process. Particularly, a memory bank storing histories is widely used in existing methods to incorporate with multimodel representations in current scenes for better decision-making. However, by weighting each history with a simple scalar, those methods cannot purely utilize the informative cues that co-exist with detrimental contents in each history, thereby inevitably introducing noises into decision-making. To that end, we propose a novel Memory-Adaptive Model (MAM) that can dynamically restrain the detrimental contents in histories for retaining contents that benefit navigation only. Specifically, two key modules, Visual and Textual Adaptive Modules, are designed to restrain history noises based on scene-related vision and text, respectively. A Reliability Estimator Module is further introduced to refine above adaptation operations. Our experiments on the widely used RxR and R2R datasets show that MAM outperforms its baseline method by 4.0% / 2.5% and 2% / 1% on the validation unseen/test split, respectively, wrt the SR metric. © 2023, The Authors. All rights reserved.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Efficient Pyramid Channel Attention Network for Pathological Myopia Recognition

arXiv

引用

arXiv 2023年

作者： Zhang, Xiaoqing Zhao, Jilu Li, Yan Wu, Hao Zhou, Xiangtian Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Center for High Performance Computing Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China National Clinical Research Center for Ocular Diseases Eye Hospital Wenzhou Medical University Wenzhou325027 China State Key Laboratory of Ophthalmology Optometry and Visual Science Eye Hospital Wenzhou Medical University Wenzhou325027 China Research Unit of Myopia Basic Research and Clinical Prevention and Control Chinese Academy of Medical Sciences Wenzhou325027 China Singapore Eye Research Institute 169856 Singapore

Pathological myopia (PM) is the leading ocular disease for impaired vision worldwide. Clinically, the characteristic of pathology distribution in PM is global-local on the fundus image, which plays a significant role in assisting clinicians in diagnosing PM. However, most existing deep neural networks focused on designing complex architectures but rarely explored the pathology distribution prior of PM. To tackle this issue, we propose an efficient pyramid channel attention (EPCA) module, which fully leverages the potential of the clinical pathology prior of PM with pyramid pooling and multi-scale context fusion. Then, we construct EPCA-Net for automatic PM recognition based on fundus images by stacking a sequence of EPCA modules. Moreover, motivated by the recent pretraining-and-finetuning paradigm, we attempt to adapt pre-trained natural image models for PM recognition by freezing them and treating the EPCA and other attention modules as adapters. In addition, we construct a PM recognition benchmark termed PM-fundus by collecting fundus images of PM from publicly available datasets. The comprehensive experiments demonstrate the superiority of EPCA-Net over state-of-the-art methods in the PM recognition task. For example, EPCA-Net achieves 97.56% accuracy and outperforms ViT by 2.85% accuracy on the PM-fundus dataset. The results also show that our method based on the pretraining-and-finetuning paradigm achieves competitive performance through comparisons to part of previous methods based on traditional fine-tuning paradigm with fewer tunable parameters, which has the potential to leverage more natural image foundation models to address the PM recognition task in limited medical data regime. Copyright © 2023, The Authors. All rights reserved.

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

Divide-and-conquer variational quantum algorithms for large-scale electronic structure simulations

arXiv

引用

arXiv 2022年

作者： Ma, Huan Fan, Yi Liu, Jie Shang, Honghui Li, Zhenyu Yang, Jinlong Hefei National Laboratory University of Science and Technology of China Hefei230088 China Hefei National Research Center for Physical Sciences at the Microscale University of Science and Technology of China Hefei230026 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Exploring the potential application of quantum computers in material design and drug discovery has attracted a lot of interest in the age of quantum computing. However, the quantum resource requirement for solving practical electronic structure problems are far beyond the capacity of near-term quantum devices. In this work, we integrate the divide-and-conquer (DC) approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations. Two popular divide-and-conquer schemes, including many-body expansion (MBE) fragmentation theory and density matrix embedding theory (DMET), are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers. Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms. This work should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers. © 2022, CC BY.

关键词： Electronic structure

来源：评论

学校读者我要写书评

暂无评论

Pay Less But Get More: A Dual-Attention-based Channel Estimation Network for Massive MIMO systems with Low-Density Pilots

arXiv

引用

arXiv 2023年

作者： Zhou, Binggui Yang, Xi Ma, Shaodan Gao, Feifei Yang, Guanghua The School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China The State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau 999078 China The Shanghai Key Laboratory of Multidimensional Information Processing School of Communication and Electronic Engineering East China Normal University Shanghai200241 China Department of Automation Tsinghua University Beijing100084 China The School of Intelligent Systems Science and Engineering The GBA and B&R International Joint Research Center for Smart Logistics Jinan University Zhuhai519070 China

To reap the promising benefits of massive multiple-input multiple-output (MIMO) systems, accurate channel state information (CSI) is required through channel estimation. However, due to the complicated wireless propagation environment and large-scale antenna arrays, precise channel estimation for massive MIMO systems is significantly challenging and costs an enormous training overhead. Considerable time-frequency resources are consumed to acquire sufficient accuracy of CSI, which thus severely degrades systems’ spectral and energy efficiencies. In this paper, we propose a dual-attention-based channel estimation network (DACEN) to realize accurate channel estimation via low-density pilots, by jointly learning the spatial-temporal domain features of massive MIMO channels with the temporal attention module and the spatial attention module. To further improve the estimation accuracy, we propose a parameter-instance transfer learning approach to transfer the channel knowledge learned from the high-density pilots pre-acquired during the training dataset collection period. Experimental results reveal that the proposed DACEN-based method achieves better channel estimation performance than the existing methods under various pilot-density settings and signal-to-noise ratios. Additionally, with the proposed parameter-instance transfer learning approach, the DACEN-based method achieves additional performance gain, thereby further demonstrating the effectiveness and superiority of the proposed method. Copyright © 2023, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Path Planning of Mobile Robot Based on an Improved Genetic Algorithm

Path Planning of Mobile Robot Based on an Improved Genetic A...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Zenghua Chen Gang Xiong Sheng Liu Zhen Shen Yue Li State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China School of Automobile Chang'an University Xi'an China

ISBN: (数字)9781665492270

ISBN: (纸本)9781665492287

In order to solve the problem of premature convergence of the basic genetic algorithm when planning the robot running path, the basic genetic algorithm is improved and optimized. Different population initialization methods are used to initialize multiple populations randomly, so as to improve the diversity of populations; Improve the adaptive strategy and elite strategy of crossover and mutation operators to improve the convergence speed of the algorithm; Add the path tortuosity as the planning index in the fitness function to make the planned path smoother, and add constraints to the model to avoid obstacles; Finally, through the transformation of the coding paradigm of the above improved genetic algorithm, it can run on Flink distributed cluster to obtain faster solution speed, so as to meet the efficiency requirements of path planning in large-scale robot cluster system. The optimized algorithm is compared with the basic genetic algorithm. The simulation results show that the improved algorithm is efficient in robot path planning.

关键词： Sociology Clustering algorithms Path planning Planning Trajectory Statistics Collision avoidance

来源：评论

学校读者我要写书评

暂无评论

ChartKG: A Knowledge-Graph-Based Representation for Chart Images

arXiv

引用

arXiv 2024年

作者： Zhou, Zhiguang Wang, Haoxuan Zhao, Zhengqing Zheng, Fengling Wang, Yongheng Chen, Wei Wang, Yong School of Media and Design Hangzhou Dianzi University CO Hangzhou310018 China School of Media and Design Hangzhou Dianzi University China Big Data Visualization and Human Computer Collaborative Intelligent Laboratory Hangzhou Dianzi University China Research Center of Big Data Intelligence Zhejiang Lab Hangzhou China State Key Lab of CAD&CG Zhejiang University China College of Computing and Data Science Nanyang Technological University Singapore

Chart images, such as bar charts, pie charts, and line charts, are explosively produced due to the wide usage of data visualizations. Accordingly, knowledge mining from chart images is becoming increasingly important, which can benefit downstream tasks like chart retrieval and knowledge graph completion. However, existing methods for chart knowledge mining mainly focus on converting chart images into raw data and often ignore their visual encodings and semantic meanings, which can result in information loss for many downstream tasks. In this paper, we propose ChartKG, a novel knowledge graph (KG) based representation for chart images, which can model the visual elements in a chart image and semantic relations among them including visual encodings and visual insights in a unified ***, we develop a general framework to convert chart images to the proposed KG-based representation. It integrates a series of image processing techniques to identify visual elements and relations, e.g., CNNs to classify charts, yolov5 and optical character recognition to parse charts, and rule-based methods to construct graphs. We present four cases to illustrate how our knowledge-graph-based representation can model the detailed visual elements and semantic relations in charts, and further demonstrate how our approach can benefit downstream applications such as semantic-aware chart retrieval and chart question answering. We also conduct quantitative evaluations to assess the two fundamental building blocks of our chart-to-KG framework, i.e., object recognition and optical character recognition. The results provide support for the usefulness and effectiveness of ChartKG. © 2024, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：