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

A survey on deep learning for polyp segmentation: techniques, challenges and future trends

Visual Intelligence 2025年第1期3卷 1-20页

作者： Mei, Jiaxin Zhou, Tao Huang, Kaiwen Zhang, Yizhe Zhou, Yi Wu, Ye Fu, Huazhu PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China School of Computer Science and Engineering Southeast University Nanjing China Institute of High Performance Computing A*STAR Singapore Singapore

Early detection and assessment of polyps play a crucial role in the prevention and treatment of colorectal cancer (CRC). Polyp segmentation provides an effective solution to assist clinicians in accurately locating and segmenting polyp regions. In the past, people often relied on manually extracted lower-level features such as color, texture, and shape, which often had problems capturing global context and lacked robustness to complex scenarios. With the advent of deep learning, more and more medical image segmentation algorithms based on deep learning networks have emerged, making significant progress in the field. This paper provides a comprehensive review of polyp segmentation algorithms. We first review some traditional algorithms based on manually extracted features and deep segmentation algorithms, and then describe benchmark datasets related to the topic. Specifically, we carry out a comprehensive evaluation of recent deep learning models and results based on polyp size, taking into account the focus of research topics and differences in network structures. Finally, we discuss the challenges of polyp segmentation and future trends in the field. © The Author(s) 2025.

关键词： Comprehensive evaluation Deep learning Medical imaging Polyp segmentation

来源：评论

学校读者我要写书评

暂无评论

Automatic skin lesion classification using a novel densely connected convolutional network integrated with an attention module

引用

Journal of Ambient Intelligence and Humanized computing 2023年第7期14卷 8943-8956页

作者： Shan, Pufang Chen, Jialei Fu, Chong Cao, Lin Tie, Ming Sham, Chiu-Wing School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China School of Information and Communication Engineering Beijing Information Science and Technology University Beijing100101 China Science and Technology on Space Physics Laboratory Beijing100076 China School of Computer Science The University of Auckland Auckland New Zealand

Automated skin lesion classification in dermoscopy images remains challenging due to the existence of artefacts and intrinsic cutaneous features, diversity of lesion morphology, insufficiency of training data, and class imbalance problem. To address these challenges, we propose a new densely connected convolutional network termed AttDenseNet-121, which is obtained by integrating the convolutional block attention module (CBAM) into DenseNet-121. CBAM is a simple yet efficient attention module, which is further improved by adding a novel pooling layer (multiscale-pooling) to effectively enhance its attention capability. The optimized CBAM strengthens the representation power of DenseNet-121 by emphasizing meaningful features and suppressing unnecessary ones, thus significantly enhancing the classification performance. Besides, to handle the imbalanced dataset, we employ an improved focal loss function rather than the traditional cross-entropy loss function to train AttDenseNet-121. The improved focal loss is calculated from a different perspective compared with the original focal loss. It makes the distribution of positive samples and negative samples in each batch the same as that in the original data, successfully mitigating the negative influence of class imbalance on this multi-class classification task. We conduct extensive experiments on the public benchmark dataset (HAM10000) and the results indicate that our proposed method achieves superior performance compared with that of the baselines and state-of-the-art algorithms. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification

引用

Science China(information Sciences) 2024年第2期67卷 5-19页

作者： Jing LIANG Yuyang ZHANG Ke CHEN Boyang QU Kunjie YU Caitong YUE Ponnuthurai Nagaratnam SUGANTHAN School of Electrical and Information Engineering Zhengzhou University State Key Laboratory of Intelligent Agricultural Power Equipment School of Electrical Engineering and Automation Henan Institute of Technology School of Electronics and Information Zhongyuan University of Technology KINDI Center for Computing Research College of EngineeringQatar University

Feature selection in classification can be considered a multiobjective problem with the objectives of increasing classification accuracy and decreasing the size of the selected feature subset. Dominance-based and decomposition-based multiobjective evolutionary algorithms(MOEAs) have been extensively used to address the feature selection problem due to their strong global search capability. However, most of them face the problem of not effectively balancing convergence and diversity during the evolutionary process. In addressing the aforementioned issue, this study proposes a unified evolutionary framework that combines two search forms of dominance and decomposition. The advantages of the two search methods assist one another in escaping the local optimum and inclining toward a balance of convergence and diversity. Specifically, an improved environmental selection strategy based on the distributions of individuals in the objective space is presented to avoid duplicate feature subsets. Furthermore, a novel knowledge transfer mechanism that considers evolutionary characteristics is developed, allowing for the effective implementation of positive knowledge transfer between dominance-based and decomposition-based feature selection methods. The experimental results demonstrate that the proposed algorithm can evolve feature subsets with good convergence and diversity in a shorter time compared with 9 state-of-the-art feature selection methods on 20 classification problems.

关键词： evolutionary algorithms feature selection multiobjective optimization knowledge transfer classification

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-Knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Imagine Before Go: Self-Supervised Generative Map for Object Goal Navigation

Imagine Before Go: Self-Supervised Generative Map for Object...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Sixian Zhang Xinyao Yu Xinhang Song Xiaohan Wang Shuqiang Jiang Key Lab of Intelligent Information Processing Laboratory of the Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing University of Chinese Academy of Sciences Beijing Institute of Intelligent Computing Technology Suzhou CAS

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

The Object Goal navigation (ObjectNav) task requires the agent to navigate to a specified target in an unseen environment. Since the environment layout is unknown, the agent needs to infer the unknown contextual objects from partially observations, thereby deducing the likely location of the target. Previous end-to-end RL methods capture contextual relationships through implicit representations while they lack notion of geometry. Alternatively, modular methods construct local maps for recording the observed geometric structure of unseen environment, however, lacking the reasoning of contextual relation limits the exploration efficiency. In this work, we propose the self-supervised generative map (SGM), a modular method that learns the explicit context relation via self-supervised learning. The SGM is trained to leverage both episodic observations and general knowledge to reconstruct the masked pixels of a cropped global map. During navigation, the agent maintains an incomplete local semantic map, meanwhile, the unknown regions of the local map are generated by the pretrained SGM. Based on the generated map, the agent sets the predicted location of the target as the goal and moves towards it. Experiments on Gibson, MP3D and HM3D show the effectiveness of our method. The code is available at https://***/sx-zhang/SGM.

关键词： Training Geometry Navigation Large language models Semantics Layout Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Residual Hyperbolic Graph Convolution Networks

arXiv

引用

arXiv 2024年

作者： Xue, Yangkai Dai, Jindou Lu, Zhipeng Wu, Yuwei Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Hyperbolic graph convolutional networks (HGCNs) have demonstrated representational capabilities of modeling hierarchical-structured graphs. However, as in general GCNs, over-smoothing may occur as the number of model layers increases, limiting the representation capabilities of most current HGCN models. In this paper, we propose residual hyperbolic graph convolutional networks (R-HGCNs) to address the over-smoothing problem. We introduce a hyperbolic residual connection function to overcome the over-smoothing problem, and also theoretically prove the effectiveness of the hyperbolic residual function. Moreover, we use product manifolds and HyperDrop to facilitate the R-HGCNs. The distinctive features of the R-HGCNs are as follows: (1) The hyperbolic residual connection preserves the initial node information in each layer and adds a hyperbolic identity mapping to prevent node features from being indistinguishable. (2) Product manifolds in R-HGCNs have been set up with different origin points in different components to facilitate the extraction of feature information from a wider range of perspectives, which enhances the representing capability of R-HGCNs. (3) HyperDrop adds multiplicative Gaussian noise into hyperbolic representations, such that perturbations can be added to alleviate the over-fitting problem without deconstructing the hyperbolic geometry. Experiment results demonstrate the effectiveness of R-HGCNs under various graph convolution layers and different structures of product manifolds. © 2024, CC BY.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Data-free Multi-label Image Recognition via LLM-powered Prompt Tuning

arXiv

引用

arXiv 2024年

作者： Yang, Shuo Shang, Zirui Wang, Yongqi Deng, Derong Chen, Hongwei Cheng, Qiyuan Wu, Xinxiao Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China

This paper proposes a novel framework for multi-label image recognition without any training data, called data-free framework, which uses knowledge of pre-trained Large Language Model (LLM) to learn prompts to adapt pre-trained Vision-Language Model (VLM) like CLIP to multi-label classification. Through asking LLM by well-designed questions, we acquire comprehensive knowledge about characteristics and contexts of objects, which provides valuable text descriptions for learning prompts. Then we propose a hierarchical prompt learning method by taking the multi-label dependency into consideration, wherein a subset of category-specific prompt tokens are shared when the corresponding objects exhibit similar attributes or are more likely to co-occur. Benefiting from the remarkable alignment between visual and linguistic semantics of CLIP, the hierarchical prompts learned from text descriptions are applied to perform classification of images during inference. Our framework presents a new way to explore the synergies between multiple pre-trained models for novel category recognition. Extensive experiments on three public datasets (MS-COCO, VOC2007, and NUS-WIDE) demonstrate that our method achieves better results than the state-of-the-art methods, especially outperforming the zero-shot multi-label recognition methods by 4.7% in mAP on MS-COCO. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Video Summarization using Denoising Diffusion Probabilistic Model

arXiv

引用

arXiv 2024年

作者： Shang, Zirui Zhu, Yubo Li, Hongxi Yang, Shuo Wu, Xinxiao Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Video summarization aims to eliminate visual redundancy while retaining key parts of video to construct concise and comprehensive synopses. Most existing methods use discriminative models to predict the importance scores of video frames. However, these methods are susceptible to annotation inconsistency caused by the inherent subjectivity of different annotators when annotating the same video. In this paper, we introduce a generative framework for video summarization that learns how to generate summaries from a probability distribution perspective, effectively reducing the interference of subjective annotation noise. Specifically, we propose a novel diffusion summarization method based on the Denoising Diffusion Probabilistic Model (DDPM), which learns the probability distribution of training data through noise prediction, and generates summaries by iterative denoising. Our method is more resistant to subjective annotation noise, and is less prone to overfitting the training data than discriminative methods, with strong generalization ability. Moreover, to facilitate training DDPM with limited data, we employ an unsupervised video summarization model to implement the earlier denoising process. Extensive experiments on various datasets (TVSum, SumMe, and FPVSum) demonstrate the effectiveness of our method. Copyright © 2024, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：