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

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Yiqian Xu Rui-Wei Zhao Rui Feng School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Academy for Engineering and Technology Fudan University Shanghai China National Children’s Medical Center Children’s Hospital of Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Shanghai China

Medical image diagnosis in real clinical scenario faces the challenging open set recognition problem with domain shift. Based on the observation that it is often merely the local lesion areas in the whole image decide or cause the true seen or potential unseen disease labels, we propose a unified deep learning framework to address it by establishing a lesion-aware mask generator to guide the model towards focusing on the lesion areas for both seen and unseen diseases, followed by a multi-task feature learning module to extract the lesion image features; and an open set recognizer with improved capability to reject unseen classes. Last but not least, we propose tailored training strategies with mixed up data and mask augmentation for improved OSR and multi-clue cross-domain feature alignment for domain generalization. Through comparative experiments and ablation studies on the representative skin lesion benchmarks, we successfully validate the effectiveness of our proposed framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching 39

DAMPER: A Dual-Stage Medical Report Generation Framework wit...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Huang, Xiaofei Chen, Wenting Liu, Jie Lu, Qisheng Luo, Xiaoling Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

ISBN: (纸本)157735897X

Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Propagating Heterophilous Graph Convolutional Network

SSRN

引用

SSRN 2024年

作者： Huang, Yang Pi, Yueyang Shi, Yiqing Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China College of Photonic and Electronic Engineering Fujian Normal University Fuzhou350007 China

Graph convolutional network have significant advantages in tasks dealing with graph-structured data, but most existing approaches based on graph convolutional network usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real graph-structured data. Due to the propagation mechanism of graph convolutional network, it is usually difficult to avoid the aggregation of interference information of nodes from different classes, leading to the inclusion of noise and irrelevant information in the results, thus affecting the performance of the model. We propose a new framework to address this issue, which can extend graph convolutional network to heterophilous graph-structured data. The proposed method has two main parts: Firstly, from the perspective of feature space, the heterophily of the graph-structured data is modeled so that the model can adaptively change the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information on the model. Secondly, the implicit node interaction information is captured through the feature space, which is then fused with the original interaction information to aggregate sufficient intra-class information. Extensive experiments on real-world datasets demonstrate the competitiveness of our approach among current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Multi-View Subgraph Neural Networks: Self-Supervised Learning with Scarce Labeled Data

arXiv

引用

arXiv 2024年

作者： Wang, Zhenzhong Zeng, Qingyuan Lin, Wanyu Jiang, Min Tan, Kay Chen Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Artificial Intelligence Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism School of Informatics Xiamen University Fujian Xiamen361005 China

While graph neural networks (GNNs) have become the de-facto standard for graph-based node classification, they impose a strong assumption on the availability of sufficient labeled samples. This assumption restricts the classification performance of prevailing GNNs on many real-world applications suffering from low-data regimes. Specifically, features extracted from scarce labeled nodes could not provide sufficient supervision for the unlabeled samples, leading to severe over-fitting. In this work, we point out that leveraging subgraphs to capture long-range dependencies can augment the representation of a node with homophily properties, thus alleviating the low-data regime. However, prior works leveraging subgraphs fail to capture the long-range dependencies among nodes. To this end, we present a novel self-supervised learning framework, called Multi-view subgraph neural networks (Muse), for handling the long-range dependencies. In particular, we propose an information theory-based identification mechanism to identify two types of subgraphs from the views of input space and latent space, respectively. The former is to capture the local structure of the graph, while the latter captures the long-range dependencies among nodes. By fusing these two views of subgraphs, the learned representations can preserve the topological properties of the graph at large, including the local structure and long-range dependencies, thus maximizing their expressiveness for downstream node classification tasks. Theoretically, we provide the generalization error bound based on Rademacher complexity to show the effectiveness of capturing complementary information from subgraphs of multiple views. Empirically, we show a proof-of-concept of Muse on canonical node classification problems on graph data. Experimental results show that Muse outperforms the alternative methods on node classification tasks with limited labeled data. Copyright © 2024, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

A Multi-direction Prediction Multi-objective Hybrid Chemical Reaction Optimization Algorithm for Dynamic Multi-objective Optimization 16th

A Multi-direction Prediction Multi-objective Hybrid Chemical...

引用

16th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2021

作者： Li, Hongye Pan, Xiaoying Gan, Wei Wang, Lei School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China Xi’an Shiyou University Shaanxi Xi’an710065 China School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China Shaanxi University of Technology Shaanxi Han Zhong723001 China

ISBN: (纸本)9789811912559

The challenge of solving dynamic multi-objective optimization problems is to trace the varying Pareto optimal front and/or Pareto optimal set quickly and efficiently. This paper proposes a multi-direction prediction strategy using a hybrid chemical reaction optimization, aimed at finding the dynamic Pareto optimal front and/or Pareto optimal set as quickly and accurately as possible before the next environmental change occurs. The proposed method, multi-direction prediction multi-objective hybrid chemical reaction optimization algorithm which mainly includes a hybrid chemical reaction optimization algorithm is proposed for solving dynamic multi-objective problems, which can guide population trace the optimum. When the environment has changed, the population is divided into several subpopulations. In subpopulation, a center point was found to construct multi-direction prediction model. As a result, this approach enhances the diversity of algorithm. While the environment has not changed, the hybrid chemical reaction algorithm with particle swarm optimization algorithm can efficiency find the optimal solution, it can achieve good diversity as well as guarantee the avoidance of local optimal solutions. The proposed algorithm is measured on several benchmark test suites with various dynamic characteristics and different difficulties. Experimental results show that this algorithm is very competitive in dealing with dynamic multi-objective optimization problems when compared with four state-of-the-art approaches. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Towards Accurate Unified Anomaly Segmentation

Towards Accurate Unified Anomaly Segmentation

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Wenxin Ma Qingsong Yao Xiang Zhang Zhelong Huang Zihang Jiang S. Kevin Zhou Division of Life Sciences and Medicine School of Biomedical Engineering University of Science and Technology of China (USTC) Hefei Anhui China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) USTC Suzhou Institute for Advance Research Suzhou Jiangsu China Stanford University Palo Alto California United State School of Medicine Shanghai University Shanghai China Key Laboratory of Precision and Intelligent Chemistry USTC Hefei Anhui China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Unsupervised anomaly detection (UAD) from images strives to model normal data distributions, creating discriminative representations to distinguish and precisely localize anomalies. Despite recent advancements in the efficient and unified one-for-all scheme, challenges persist in accurately segmenting anomalies for further monitoring. Moreover, this problem is obscured by the widely-used AUROC metric under imbalanced UAD settings. This motivates us to emphasize the significance of precise segmentation of anomaly pixels using pAP and DSC as metrics. To address the unsolved segmentation task, we introduce the Unified Anomaly Segmentation (UniAS). UniAS presents a multi-level hybrid pipeline that progressively enhances normal information from coarse to fine, incorporating a novel multi-granularity gated CNN (MGG-CNN) into Transformer layers to explicitly aggregate local details from different granularities. UniAS achieves state-of-the-art anomaly segmentation performance, attaining 65.12/59.33 and 40.06/32.50 in pAP/DSC on the MVTec-AD and VisA datasets, respectively, surpassing previous methods significantly. The codes are shared at https://***/Mwxinnn/UniAS.

关键词： Measurement Image segmentation Computer vision Codes Pipelines Logic gates Transformers Data models Monitoring Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

CenterPicker:An Automated Cryo-EM Single-Particle Picking Method Based on Center Point Detection

引用

Journal of Cyber Security 2022年第2期4卷 65-77页

作者： Jianquan Ouyang Jinling Wang Yaowu Wang Tianming Liu Key Laboratory of Intelligent Computing Information Processing Ministry of EducationComputer Science College of Xiangtan UniversityXiangtanHunan Province411100China Department of Computer Science the University of GeorgiaAthensGeorgiaUSA

Cryo-electron microscopy(cryo-EM)has become one of the mainstream techniques for determining the structures of proteins andmacromolecular complexes,with prospects for development and *** must select hundreds of thousands of particles from micrographs to acquire the database for single-particle cryo-EM ***,existing particle picking methods cannot ensure that the particles are in the center of the bounding box because the signal-to-noise ratio(SNR)of micrographs is extremely low,thereby directly affecting the efficiency and accuracy of 3D *** propose an automated particle-picking method(CenterPicker)based on particle center point detection to automatically select a large number of high-quality particles from low signal-to-noise,low-contrast refrigerated microscopy *** method uses a fully convolutional neural network to generate a keypoint *** heatmap value represents the probability that a micrograph pixel belongs to a particle center *** can process images of any size and can directly predict the center point and size of the *** network implements multiscale feature fusion and introduces an attention mechanism to improve the feature fusion part to obtain more accurate selection *** have conducted a detailed evaluation of CenterPicker on a range of datasets,and results indicate that it excels in single-particle picking tasks.

关键词： Cryo-electron microscope deep learning particle picking object detection

来源：评论

学校读者我要写书评

暂无评论

Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge 15th

Fixed-Parameter Tractability for Book Drawing with Bounded...

引用

15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021

作者： Liu, Yunlong Li, Yixuan Huang, Jingui College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China Hunan Xiangjiang Artificial Intelligence Academy Changsha China

ISBN: (纸本)9783030931759

The problem book drawing with a bounded number of crossings per edge asks, given a graph G= (V, E) and two integers k, b, whether there is a k-page book drawing of G such that the maximum number of crossings per edge is at most b. In this paper, we study this problem from a parameterized complexity viewpoint. Specifically, we investigate the problem parameterized by both the maximum number b of crossings per edge and the vertex cover number τ of G, and show that this parameterized problem admits a kernel of size (3 b+ 1 ) · 2O(τ) and admits a fixed-parameter tractable algorithm running in time O((3b+1)·2(3b+2)·2O(τ)+τ·|V| ). Together with our previous result for fixed-order book drawing with a bounded number of crossings per edge (COCOA 2020), our result provides a more complete answer to a question posed by Bhore et al. (J. Graph Alg. Appl. 2020). © 2021, Springer Nature Switzerland AG.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：