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

CDFI: Cross Domain Feature Interaction for Robust Bronchi Lumen Detection

学校读者我要写书评

暂无评论

CDFI: Cross Domain Feature Interaction for Robust Bronchi Lu...

IEEE International Conference on Robotics and Automation (ICRA)

作者： Jiasheng Xu Tianyi Zhang Yangqian Wu Jie Yang Guang–Zhong Yang Yun Gu Institute of Medical Robotics Shanghai Jiao Tong University Shanghai CHINA Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai CHINA MOE Key Laboratory of System Control and Information Processing Shanghai P.R. China Shanghai Center for Brain Science and Brain-Inspired Technology Shanghai China

Endobronchial intervention is increasingly used as a minimally invasive means for the treatment of pulmonary diseases. In order to reduce the difficulty of manipulation in complex airway networks, robust lumen detection is essential for intraoperative guidance. However, these methods are sensitive to visual artifacts which are inevitable during the surgery. In this work, a cross domain feature interaction (CDFI) network is proposed to extract the structural features of lumens, as well as to provide artifact cues to characterize the visual features. To effectively extract the structural and artifact features, the Quadruple Feature Constraints (QFC) module is designed to constrain the intrinsic connections of samples with various imaging-quality. Furthermore, we design a Guided Feature Fusion (GFF) module to supervise the model for adaptive feature fusion based on different types of artifacts. Results show that the features extracted by the proposed method can preserve the structural information of lumen in the presence of large visual variations, bringing much-improved lumen detection accuracy.

关键词：

Watch Out for Your Agents! Investigating Backdoor Threats to LLM-Based Agents

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Wenkai Bi, Xiaohan Lin, Yankai Chen, Sishuo Zhou, Jie Sun, Xu Gaoling School of Artificial Intelligence Renmin University of China Beijing China Center for Data Science Peking University China Pattern Recognition Center WeChat AI Tencent Inc. China National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China

Driven by the rapid development of Large Language Models (LLMs), LLM-based agents have been developed to handle various real-world applications, including finance, healthcare, and shopping, etc. It is crucial to ensure the reliability and security of LLM-based agents during applications. However, the safety issues of LLM-based agents are currently under-explored. In this work, we take the first step to investigate one of the typical safety threats, backdoor attack, to LLM-based agents. We first formulate a general framework of agent backdoor attacks, then we present a thorough analysis of different forms of agent backdoor attacks. Specifically, compared with traditional backdoor attacks on LLMs that are only able to manipulate the user inputs and model outputs, agent backdoor attacks exhibit more diverse and covert forms: (1) From the perspective of the final attacking outcomes, the agent backdoor attacker can not only choose to manipulate the final output distribution, but also introduce the malicious behavior in an intermediate reasoning step only, while keeping the final output correct. (2) Furthermore, the former category can be divided into two subcategories based on trigger locations, in which the backdoor trigger can either be hidden in the user query or appear in an intermediate observation returned by the external environment. We implement the above variations of agent backdoor attacks on two typical agent tasks including web shopping and tool utilization. Extensive experiments show that LLM-based agents suffer severely from backdoor attacks and such backdoor vulnerability cannot be easily mitigated by current textual backdoor defense algorithms. This indicates an urgent need for further research on the development of targeted defenses against backdoor attacks on LLM-based agents.3 Warning: This paper may contain biased content. © 2024, CC BY.

关键词：

New intra prediction mode for interlaced video in AVS

学校读者我要写书评

暂无评论

Gaojishu Tongxin/Chinese High Technology Letters 2007年第3期17卷 221-225页

作者： Chen, Liang Tan, Yihua Tian, Jinwen State Key Laboratory of Education Ministry for Image Processing and Intelligent Control Institute of Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

The technologies of intra prediction and MBAFF were introduced, and a new intra prediction mode based on the characteristics of spatial distribution in interlaced video was proposed. The spatial correlation of five luma intra prediction modes in AVS-P2 and the new mode were analyzed. From the analysis result, it can be concluded that the new mode can exploit the spatial correlation better and predict the samples more precisely than the existed ones. The experimental results showed that the average gain in peak signal to noise ratio was above 0.12dB and the average reduction in bit-rate was above 1.77%, so the proposed mode is an effective prediction mode for improvement of coding performance.

关键词： AVS Interlaced video Intra prediction Video coding

Learning data-adaptive non-parametric kernels

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

3D EAGAN: 3D edge-aware attention generative adversarial network for prostate segmentation in transrectal ultrasound images

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liu, Mengqing Shao, Xiao Jiang, Liping Wu, Kaizhi School of Information Engineering Nanchang Hangkong University Jiangxi Nanchang China School of Computer Science Nanjing University of Information Science and Technology Jiangsu Nanjing China The First Affiliated Hospital of Nanchang University Nanchang University Jiangxi Nanchang China Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang Hangkong University Nanchang China

Background: Segment prostates from transrectal ultrasound (TRUS) images plays an essential role in the diagnosis and treatment of prostate cancer. However, traditional segmentation methods are time-consuming and laborious. To address this issue, there is an urgent need to develop computer algorithms that can automatically segment prostates from TRUS images, which makes it become the direction and form of future development. Purpose: Automatic prostate segmentation in TRUS images has always been a challenging problem, since prostates in TRUS images have ambiguous boundaries and inhomogeneous intensity distribution. Although many prostate segmentation methods have been proposed, they still need to be improved due to the lack of sensibility to edge information. Consequently, the objective of this study is to devise a highly effective prostate segmentation method that overcomes these limitations and achieves accurate segmentation of prostates in TRUS images. Methods: A 3D edge-aware attention generative adversarial network (3D EAGAN)-based prostate segmentation method is proposed in this paper, which consists of an edge-aware segmentation network (EASNet) that performs the prostate segmentation and a discriminator network that distinguishes predicted prostates from real prostates. The proposed EASNet is composed of an encoder-decoder-based U-Net backbone network, a detail compensation module, four 3D spatial and channel attention modules, an edge enhance module, and a global feature extractor. The detail compensation module is proposed to compensate for the loss of detailed information caused by the down-sampling process of the encoder. The features of the detail compensation module are selectively enhanced by the 3D spatial and channel attention module. Furthermore, an edge enhance module is proposed to guide shallow layers in the EASNet to focus on contour and edge information in prostates. Finally, features from shallow layers and hierarchical features from the decod

关键词： Generative adversarial networks

Differentiable neural architecture learning for efficient neural network design

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Guo, Qingbei Wu, Xiao-Jun Kittler, Josef Feng, Zhiquan Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi214122 China Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan Jinan250022 China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

Automated neural network design has received ever-increasing attention with the evolution of deep convolutional neural networks (CNNs), especially involving their deployment on embedded and mobile platforms. One of the biggest problems that neural architecture search (NAS) confronts is that a large number of candidate neural architectures are required to train, using, for instance, reinforcement learning and evolutionary optimisation algorithms, at a vast computation cost. Even recent differentiable neural architecture search (DNAS) samples a small number of candidate neural architectures based on the probability distribution of learned architecture parameters to select the final neural architecture. To address this computational complexity issue, we introduce a novel architecture parameterisation based on scaled sigmoid function, and propose a general Differentiable Neural Architecture Learning (DNAL) method to optimize the neural architecture without the need to evaluate candidate neural networks. Specifically, for stochastic supernets as well as conventional CNNs, we build a new channel-wise module layer with the architecture components controlled by a scaled sigmoid function. We train these neural network models from scratch. The network optimization is decoupled into the weight optimization and the architecture optimization, which avoids the interaction between the two types of parameters and alleviates the vanishing gradient problem. We address the non-convex optimization problem of neural architecture by the continuous scaled sigmoid method with convergence guarantees. Extensive experiments demonstrate our DNAL method delivers superior performance in terms of neural architecture search cost, and adapts to conventional CNNs (e.g., VGG16 and ResNet50), lightweight CNNs (e.g., MobileNetV2) and stochastic supernets (e.g., ProxylessNAS). The optimal networks learned by DNAL surpass those produced by the state-of-the-art methods on the benchmark CIFAR-10 and ImageN

关键词： Deep neural networks

Self-grouping convolutional neural networks

学校读者我要写书评

暂无评论

arXiv 2020年

Although group convolution operators are increasingly used in deep convolutional neural networks to improve the computational efficiency and to reduce the number of parameters, most existing methods construct their group convolution architectures by a predefined partitioning of the filters of each convolutional layer into multiple regular filter groups with an equal spatial group size and data-independence, which prevents a full exploitation of their potential. To tackle this issue, we propose a novel method of designing self-grouping convolutional neural networks, called SG-CNN, in which the filters of each convolutional layer group themselves based on the similarity of their importance vectors. Concretely, for each filter, we first evaluate the importance value of their input channels to identify the importance vectors, and then group these vectors by clustering. Using the resulting data-dependent centroids, we prune the less important connections, which implicitly minimizes the accuracy loss of the pruning, thus yielding a set of diverse group convolution filters. Subsequently, we develop two fine-tuning schemes, i.e. (1) both local and global fine-tuning and (2) global only fine-tuning, which experimentally deliver comparable results, to recover the recognition capacity of the pruned network. Comprehensive experiments carried out on the CIFAR-10/100 and ImageNet datasets demonstrate that our self-grouping convolution method adapts to various state-of-the-art CNN architectures, (Figure presented) Figure 1: Evolution of group convolutions. (a) Regular convolution. (b) Regular group convolution. (c) Permuting group convolution. (d) Learned group convolution. (d) Self-grouping convolution. Note that white channels represent the ignored input channels, and gray channels indicate the reused input channels. such as ResNet and DenseNet, and delivers superior performance in terms of compression ratio, speedup and recognition accuracy. We demonstrate the ability of SG-CNN

关键词： Convolution

A Combining Method for Tumors Detection from Near-infrared Breast Imaging

学校读者我要写书评

暂无评论

A Combining Method for Tumors Detection from Near-infrared B...

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Zhicheng Wang Jian Liu Jinwen Tian Zeping Xie State Education Commission Key Laboratory for Image Processing and Intelligent Control Institute for Pattern Recognition and Artificial Intelligence Huazhong Univ. of Sci. & Tech. Wuhan 430074 China Key Lab. for Image Process. & Intelligent Control State Educ. Comm. School of Life Science & Technology Huazhong University of Science and Technology Wuhan China

This paper introduces the new qualitative and quantitative methods, which can diagnose breast tumors. Qualitative methods include blood vessel display inside and outside of pathological changes part of breast, display of equivalent pixel curves at the part of pathological changes and display of breast tumor image edge. Accordingly, three feature extraction operators are proposed, i.e. the combination operators of anisotropic gradient and smoothing operator, an improved Sobel operator and an edge sharpening operator. Furthermore, quantitative diagnostic approaches are discussed based on blood and oxygen contents according to abundant clinical data and pathological mechanism of breast tumors. The results of clinic show that the methods of combining qualitative and quantitative diagnose are effective for breast tumor images, especially for early and potential breast cancer

关键词： Breast tumors Displays Pathology Blood vessels Biomedical imaging Pixel Feature extraction Anisotropic magnetoresistance Smoothing methods Breast cancer

A generalization theory based on independent and task-identically distributed assumption

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zheng, Guanhua Sang, Jitao Li, Houqiang Yu, Jian Xu, Changsheng University of Science and Technology of China School of Computer and Information Technology Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China Chinese Academy of Sciences Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Hefei230026 China National Lab of Pattern Recognition Institute of Automation CAS Beijing100190 China University of Chinese Academy of Sciences

—Existing generalization theories analyze the generalization performance mainly based on the model complexity and training process. The ignorance of the task properties, which results from the widely used IID assumption, makes these theories fail to interpret many generalization phenomena or guide practical learning tasks. In this paper, we propose a new Independent and Task-Identically Distributed (ITID) assumption, to consider the task properties into the data generating process. The derived generalization bound based on the ITID assumption identifies the significance of hypothesis invariance in guaranteeing generalization performance. Based on the new bound, we introduce a practical invariance enhancement algorithm from the perspective of modifying data distributions. Finally, we verify the algorithm and theorems in the context of image classification task on both toy and real-world datasets. The experimental results demonstrate the reasonableness of the ITID assumption and the effectiveness of new generalization theory in improving practical generalization performance. Copyright © 2019, The Authors. All rights reserved.

关键词： Classification (of information)