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

Boosting polyp screening with improved point-teacher weakly semi-supervised

Computers in Biology and Medicine 2025年 191卷 109998-109998页

作者： Du, Xiuquan Zhang, Xuejun Chen, Jiajia Li, Lei Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Department of Neurology Shuyang Affiliated Hospital of Nanjing University of Traditional Chinese Medicine Suqian China School of Computer Science and Technology Anhui University Hefei China

Polyps, like a silent time bomb in the gut, are always lurking and can explode into deadly colorectal cancer at any time. Many methods are attempted to maximize the early detection of colon polyps by screening, however, there are still face some challenges: (i) the scarcity of per-pixel annotation data and clinical features such as the blurred boundary and low contrast of polyps result in poor performance. (ii) existing weakly semi-supervised methods directly using pseudo-labels to supervise student tend to ignore the value brought by intermediate features in the teacher. To adapt the point-prompt teacher model to the challenging scenarios of complex medical images and limited annotation data, we creatively leverage the diverse inductive biases of CNN and Transformer to extract robust and complementary representation of polyp features (boundary and context). At the same time, a novel designed teacher–student intermediate feature distillation method is introduced rather than just using pseudo-labels to guide student learning. Comprehensive experiments demonstrate that our proposed method effectively handles scenarios with limited annotations and exhibits good segmentation performance. All code is available at https://***/dxqllp/WSS-Polyp. © 2025 Elsevier Ltd

关键词： Weakly semi-supervised Medical image segmentation Boundary extraction Feature distillation

来源：评论

学校读者我要写书评

暂无评论

Image Moment Invariants to Rotational Motion Blur

arXiv

引用

arXiv 2023年

作者： Mo, Hanlin Hao, Hongxiang Zhao, Guoying Center for Machine Vision and Signal Analysis University of Oulu Finland Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Rotational motion blur caused by the circular motion of the camera or/and object is common in life. Identifying objects from images affected by rotational motion blur is challenging because this image degradation severely impacts image quality. Therefore, it is meaningful to develop image invariant features under rotational motion blur and then use them in practical tasks, such as object classification and template matching. This paper proposes a novel method to generate image moment invariants under general rotational motion blur and provides some instances. Further, we achieve their invariance to similarity transform. To the best of our knowledge, this is the first time that moment invariants for rotational motion blur have been proposed in the literature. We conduct extensive experiments on various image datasets disturbed by similarity transform and rotational motion blur to test these invariants’ numerical stability and robustness to image noise. We also demonstrate their performance in image classification and handwritten digit recognition. Current state-of-the-art blur moment invariants and deep neural networks are chosen for comparison. Our results show that the moment invariants proposed in this paper significantly outperform other features in various tasks. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Efficient DOA Estimation Based on Cauchy Loss Variable Step Size Algorithm

Efficient DOA Estimation Based on Cauchy Loss Variable Step ...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Xingchao Xu Yingsong Li College of Information and Communications Engineering Harbin Engineering University Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

The Cauchy loss function is robust to large outliers and has successful applications in signal processing. In this paper, a DOA estimation algorithm based on adaptive zero technology is proposed, which updates the weight of the filter by applying the Cauchy loss function, and further improves the algorithm performance by using the variable step size method. The algorithm step size is adjusted by accumulating errors and establishing a nonlinear function with instantaneous errors. The DOA estimation ability, estimation error and accuracy of the improved Cauchy algorithm in the impulse noise environment are analyzed. The algorithm is verified by simulation experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of Control Circuit for Active Metasurface Based on Varactor Diode

Design of Control Circuit for Active Metasurface Based on Va...

引用

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Yue Zhang Yuefei Liu Guohui Yang Kuang Zhang Yingsong Li School of Electronics and Information Engineering Harbin Institute of Technology Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

A control circuit for active metasurface based on varactor diode is designed in this paper. By varying the reverse bias voltage on the varactor diode, the designed circuit can regulate the additional phase of the active meta-atoms. The circuit adopts a form of one master and multiple slaves, which can simultaneously control the bias voltage of 960 meta-atoms. Each slave can control up to 64 channels. The control accuracy is 0.04V. The power consumption of a single slave is 160mW. Though experiment verification, the circuit has a good effect in controlling the beam deflection of the metasurface and generating OAM beams.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Group Based Detection of Cryptocurrency Laundering Using Multi-Persona Analysis

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5992-6004页

作者： Li, Guang Mi, Yangtian Zhou, Jieying Zheng, Xianghan Wu, Weigang Sun Yat-sen University School of Computer Science and Engineering Guangzhou 510006 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou 350108 China

Money laundering using cryptocurrency poses significant threats to the blockchain ecosystem. Due to the decentralized and anonymous nature of cryptocurrencies, detecting such laundering activities is difficult. Although substantial research has been conducted, almost all existing methods detect cryptocurrency laundering from an individual perspective, ignoring the fact that money laundering is typically a group behavior. Group information should be very helpful in laundering behavior analysis, but such laundering groups are hard to be recognized due to anonymity and diversity of purposes of cryptocurrency transactions. To address this challenge, we design a multi-persona grouping algorithm that can effectively group accounts into persona subgraphs. Then, we extract two subgraph features: cycle basis number and cycle overlapping ratio, and build an unsupervised model to evaluate laundering scores of each subgraph. Extensive experiments on both synthetic and real-world datasets demonstrate that, compared with existing methods, our proposed method can improve detection accuracy by 17.4 percentage points on average. To the best of our knowledge, this is the first work on group-based detection of cryptocurrency laundering. © 2005-2012 IEEE.

关键词： blockchain cryptocurrency graph mining machine learning Money laundering detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ST-Mamba: Spatial-Temporal Mamba for Traffic Flow Estimation Recovery using Limited Data

ST-Mamba: Spatial-Temporal Mamba for Traffic Flow Estimation...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Doncheng Yuan Jianzhe Xue Jinshan Su Wenchao Xu Haibo Zhou School of Electronic Science and Engineering Nanjing University Nanjing China Key Laboratory of Vibration Signal Capture and Intelligent Processing Yili Normal University Yining China Department of Computing the Hong Kong Polytechnic University

ISBN: (数字)9798350378412

ISBN: (纸本)9798350378429

Traffic flow estimation (TFE) is crucial for urban intelligent traffic systems. While traditional on-road detectors are hindered by limited coverage and high costs, cloud computing and data mining of vehicular network data, such as driving speeds and GPS coordinates, present a promising and cost-effective alternative. Furthermore, minimizing data collection can significantly reduce overhead. However, limited data can lead to inaccuracies and instability in TFE. To address this, we introduce the spatial-temporal Mamba (ST-Mamba), a deep learning model combining a convolutional neural network (CNN) with a Mamba framework. ST-Mamba is designed to enhance TFE accuracy and stability by effectively capturing the spatial-temporal patterns within traffic flow. Our model aims to achieve results comparable to those from extensive data sets while only utilizing minimal data. Simulations using real-world datasets have validated our model’s ability to deliver precise and stable TFE across an urban landscape based on limited data, establishing a cost-efficient solution for TFE.

关键词： Deep learning Accuracy Simulation Estimation Detectors Power system stability Data models

来源：评论

学校读者我要写书评

暂无评论

Food computing for Nutrition and Health

Food Computing for Nutrition and Health

引用

International Conference on Data Engineering Workshops

作者： Shuqiang Jiang Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Beijing University of Chinese Academy of Sciences Beijing

ISBN: (数字)9798350384031

ISBN: (纸本)9798350384048

Dietary intake is the main source of human nutrition and thus an important material foundation for maintaining human health. Food computing applies computational approaches to intelligently obtain dietary categories, ingredients, and nutrient intake from dietary data, and then provides dietary recommendations to users based on various dietary factors. Therefore, it can achieve intelligent dietary management to assist in solving human health issues. For its significant impact on human health, it has received more attention from both academia and industry, and has made rapid development, especially with the booming Artificial Intelligence (AI). This talk will first introduce the definition, methods, tasks and applications of food computing. Then we will discuss its various tasks, ranging from vision-based multi-granularity food analysis, multimodal recipe analysis, food knowledge graph construction and dietary recommendation. Finally, we will point out future research directions on food computing, such as large food language/multimodal models and the emerging interdisciplinary field AI4Food from the synergy between AI and food science. We expect that this talk will provide the researchers with a more comprehensive understanding of the field, and provide perspectives for the next wave of development in this rapidly growing field.

关键词： Industries Conferences Computational modeling Knowledge graphs Data engineering Distance measurement Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Preprocessed GMRES for fast solution of linear equations

arXiv

引用

arXiv 2024年

作者： Zhang, Juan Luo, Yiyi Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University China

The article mainly introduces preprocessing algorithms for solving linear equation systems. This algorithm uses three algorithms as inner iterations, namely RPCG algorithm, ADI algorithm, and Kaczmarz algorithm. Then, it uses BA-GMRES as an outer iteration to solve the linear equation system. These three algorithms can indirectly generate preprocessing matrices, which are used for solving equation systems. In addition, we provide corresponding convergence analysis and numerical examples. Through numerical examples, we demonstrate the effectiveness and feasibility of these preprocessing methods. Furthermore, in the Kaczmarz algorithm, we introduce both constant step size and adaptive step size, and extend the parameter range of the Kaczmarz algorithm to α ∈ (0, ∞). We also study the solution rate of linear equation systems using different step sizes. Numerical examples show that both constant step size and adaptive step size have higher solution efficiency than the solving algorithm without preprocessing. © 2024, CC BY.

关键词： Linear equations

来源：评论

学校读者我要写书评

暂无评论

GLSNet: A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation

引用

Biomedical signal processing and Control 2024年 87卷

作者： Pan, Xiaoying Ma, Chenyang Mu, Yaya Bi, Manrong Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi‘an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi‘an710121 China School of Computer Science & Technology Xi'an University of Post & Telecommunications Xi‘an710121 China

Accurate polyp segmentation is of great significance for the prevention and diagnosis of early colon cancer. Transformer-based image segmentation models have been proposed for polyp segmentation with good results, however, these methods do not sufficiently consider the negative impact of background noise in different levels of features, resulting in the loss of local details. To alleviate this problem, we propose a GLSNet (A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation) network, including a spatial feature enhancement (SFE) module, a globally guided local feature enhancement (GLFE) module, and a feature stepwise aggregation (FSA) module. SFE can enhance the spatial feature representation of polyps to better capture the polyp information in the features. GLFE uses high-level features to filter noise in low-level features to capture polyp information hidden in shallow features;FSA fuses the semantic and positional information of polyps across scales to obtain the final segmentation results. Qualitative and quantitative experiments were conducted on 7 benchmark datasets, and the experimental results demonstrated that GLSNet outperforms other existing methods and has stronger generalization performance. In particular, we achieved a mean Dice of 92.9% on the large-scale Kvasir dataset, and mean Dice of 81.3% and 81.6% on CVC-ColonDB and ETIS, respectively, which are significantly higher than those of the competing methods. © 2023

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：