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

arXiv 2024年

作者： Zhang, Yaning Wang, Tianyi Yu, Zitong Gao, Zan Shen, Linlin Chen, Shengyong Jinan250353 China Nanyang Technological University 50 Nanyang Ave Block N 4 639798 Singapore School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Jinan250014 China The Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

The rapid development of photo-realistic face generation methods has raised significant concerns in society and academia, highlighting the urgent need for robust and generalizable face forgery detection (FFD) techniques. Although existing approaches mainly capture face forgery patterns using image modality, other modalities like fine-grained noises and texts are not fully explored, which limits the generalization capability of the model. In addition, most FFD methods tend to identify facial images generated by GAN, but struggle to detect unseen diffusion-synthesized ones. To address the limitations, we aim to leverage the cutting-edge foundation model, contrastive language-image pre-training (CLIP), to achieve generalizable diffusion face forgery detection (DFFD). In this paper, we propose a novel multi-modal fine-grained CLIP (MFCLIP) model, which mines comprehensive and fine-grained forgery traces across image-noise modalities via language-guided face forgery representation learning, to facilitate the advancement of DFFD. Specifically, we devise a fine-grained language encoder (FLE) that extracts fine global language features from hierarchical text prompts. We design a multi-modal vision encoder (MVE) to capture global image forgery embeddings as well as fine-grained noise forgery patterns extracted from the richest patch, and integrate them to mine general visual forgery traces. Moreover, we build an innovative plug-and-play sample pair attention (SPA) method to emphasize relevant negative pairs and suppress irrelevant ones, allowing cross-modality sample pairs to conduct more flexible alignment. Extensive experiments and visualizations show that our model outperforms the state of the arts on different settings like cross-generator, cross-forgery, and cross-dataset evaluations. Copyright © 2024, The Authors. All rights reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Classifying Cover Crop Residue from RGB Images: A Simple SVM versus a SVM Ensemble

Classifying Cover Crop Residue from RGB Images: A Simple SVM...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Parth C. Upadhyay Lokesh Karanam John A. Lory Guilherme N. DeSouza Vision-Guided and Intelligent Robotics (ViGIR) Laboratory Department of Electrical Engineering and Computer Science (EECS) Division of Plant Sciences University of Missouri Columbia MO

ISBN: (纸本)9781728190495

Plant-derived crop residue on soil surface provides many important advantages including preventing erosion and conserving soil moisture. In that sense, making accurate determination on the percent of crop residue cover using RGB images can be a fundamental tool in protecting the soil. In our research, we approach the determination of such percentages as a classification problem, and in this paper, we compare two of these approaches. Both approaches relied on support vector machines (SVM) as the classifier of choice, and the same set of features, which were selected in our previous studies on the same topic. In this paper we developed a SVM ensemble with a hierarchical structure and compared it against a single, multi-class SVM classifier. In the SVM ensemble framework, four two-class SVMs and one five-class SVM were combined in sequence to better separate adjacent levels of residue cover. The rationale of the ensemble was to allow each of the two-class SVMs to find the hyperplanes that maximize the margin between the corresponding two consecutive classes. Then, based on the distance of the samples to these hyperplanes, probabilistic estimates of the data-point belonging to the class were computed and added as extra inputs for the last SVM. In order to enhance the performance of the ensemble, other considerations such as the use of Grid Search method for optimizing the hyperparameters were employed in the tuning of the SVMs. Numerical experiments were conducted over a dataset of 4,400 images, which were collected from 88 locations in 40 row crop fields in five Missouri counties between mid-April and early July in 2018 and 2019. The images were collected using a camera mounted on a tripod, with a spatial resolution of 0.014 cm pixel- 1 GSD (Ground Sampling Distance). The experiments highlighted the better performance of the proposed hierarchical ensemble classifier, which achieved a cross-validation accuracy of 86.3 % vs an accuracy of 80.4 % for the single SVM, whil

关键词： Support vector machines Measurement Training Search methods Soil moisture Crops Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

RDA: An Accelerated Collision Free Motion Planner for Autonomous Navigation in Cluttered Environments

arXiv

引用

arXiv 2022年

作者： Han, Ruihua Wang, Shuai Wang, Shuaijun Zhang, Zeqing Zhang, Qianru Eldar, Yonina C. Hao, Qi Pan, Jia The Department of Computer Science and Engineering Southern University of Science and Technology Guangdong Shenzhen China The Department of Computer Science The University of Hong Kong Hong Kong Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Shenzhen China The Department of Computer Science and Engineering Harbin Institute of Technology Guangdong Shenzhen China The Weizmann Institute of Science Rehovot Israel The Department of Computer Science and Engineering The Shenzhen Key Laboratory of Robotics and Computer Vision The Sifakis Research Institute for Trustworthy Autonomous Systems Southern University of Science and Technology Guangdong Shenzhen China

Autonomous motion planning is challenging in multi-obstacle environments due to nonconvex collision avoidance constraints. Directly applying numerical solvers to these nonconvex formulations fails to exploit the constraint structures, resulting in excessive computation time. In this paper, we present an accelerated collision-free motion planner, namely regularized dual alternating direction method of multipliers (RDADMM or RDA for short), for the model predictive control (MPC) based motion planning problem. The proposed RDA addresses nonconvex motion planning via solving a smooth biconvex reformulation via duality and allows the collision avoidance constraints to be computed in parallel for each obstacle to reduce computation time significantly. We validate the performance of the RDA planner through path-tracking experiments with car-like robots in both simulation and real-world settings. Experimental results show that the proposed method generates smooth collision-free trajectories with less computation time compared with other benchmarks and performs robustly in cluttered environments. The source code is available at https://***/hanruihua/ RDA_planner. Copyright © 2022, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Medical Image Segmentation with High-Fidelity Prototypes

arXiv

引用

arXiv 2024年

作者： Tang, Song Yan, Shaxu Qi, Xiaozhi Gao, Jianxin Ye, Mao Zhang, Jianwei Zhu, Xiatian IMI Group School of Health Sciences and Engineering University of Shanghai for Science and Technology Shanghai China TAMS Group Department of Informatics Universität Hamburg Hamburg Germany School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Surrey Institute for People-Centred Artificial Intelligence Centre for Vision Speech and Signal Processing University of Surrey Guildford United Kingdom Shenzhen Key Laboratory of Minimally Invasive Surgical Robotics and System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China

Few-shot Semantic Segmentation (FSS) aims to adapt a pretrained model to new classes with as few as a single labelled training sample per class. Despite the prototype based approaches have achieved substantial success, existing models are limited to the imaging scenarios with considerably distinct objects and not highly complex background, e.g., natural images. This makes such models suboptimal for medical imaging with both conditions invalid. To address this problem, we propose a novel Detail Self-refined Prototype Network (DSPNet) to constructing high-fidelity prototypes representing the object foreground and the background more comprehensively. Specifically, to construct global semantics while maintaining the captured detail semantics, we learn the foreground prototypes by modelling the multi-modal structures with clustering and then fusing each in a channel-wise manner. Considering that the background often has no apparent semantic relation in the spatial dimensions, we integrate channel-specific structural information under sparse channel-aware regulation. Extensive experiments on three challenging medical image benchmarks show the superiority of DSPNet over previous state-of-the-art methods. The code and data are available at https://***/tntek/DSPNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Toward Lung Ultrasound Automation: Fully Autonomous Robotic Longitudinal and Transverse Scans Along Intercostal Spaces

IEEE Transactions on Medical Robotics and Bionics

引用

IEEE Transactions on Medical robotics and Bionics 2025年第2期7卷 768-781页

作者： Long Lei Yingbai Hu Zixing Jiang Juzheng Miao Xiao Luo Yu Zhang Qiong Wang Shujun Wang Zheng Li Pheng-Ann Heng Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Multi-Scale Medical Robotics Centre Ltd. The Chinese University of Hong Kong Hong Kong China Department of Surgery The Chinese University of Hong Kong Hong Kong China Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Biomedical Engineering The Hong Kong Polytechnic University Hong Kong China Department of Surgery Chow Yuk Ho Technology Centre for Innovative Medicine Li Ka Shing Institute of Health Sciences and Multiscale Medical Robotics Centre Ltd. The Chinese University of Hong Kong Hong Kong China

Lung ultrasound scanning is essential for diagnosing lung diseases. The scan effectiveness critically depends on both longitudinal and transverse scans through intercostal spaces to reduce rib shadowing interference, as well as maintaining the probe perpendicular to pleura for pathological artifact generation. Achieving this level of scan quality often depends heavily on the experience of doctors. Robotic ultrasound scanning shows promise, but currently lacks a direct path planning method for intercostal scanning, and probe orientation does not consider imaging differences between lungs and solid organs. In this paper, we aim to fully automate two fundamental operations in lung ultrasound scanning: longitudinal and transverse scans. We propose pioneering path planning methods along intercostal spaces and innovative solutions for adaptive probe posture adjustment using real-time pleural line feedback, specifically addressing the unique characteristics of lung ultrasound scanning. This ensures the acquisition of high-quality, diagnostically meaningful ultrasound images. In addition, we develop a robotic lung ultrasound system to validate the proposed methods. Extensive experimental results on two volunteers and a chest phantom confirm the efficacy of our methods, and demonstrate the system’s feasibility in automated lung ultrasound examinations. Our work lays a solid foundation for automated robotic complete lung scanning.

关键词： Ultrasonic imaging Lungs Probes Robots Robot kinematics Medical robotics Ribs Medical services Surface morphology Computed tomography

来源：评论

学校读者我要写书评

暂无评论

GRATIS: Deep Learning Graph Representation with Task-specific Topology and Multi-dimensional Edge Features

arXiv

引用

arXiv 2022年

作者： Song, Siyang Song, Yuxin Luo, Cheng Song, Zhiyuan Kuzucu, Selim Jia, Xi Guo, Zhijiang Xie, Weicheng Shen, Linlin Gunes, Hatice The Department of Computer Science and Technology University of Cambridge CambridgeCB3 0FT United Kingdom Baidu Inc Beijing100193 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China Department of Computer Engineering Middle East Technical University Ankara Turkey School of Computer Science University of Birmingham Birmingham United Kingdom

Graph is powerful for representing various types of real-world data. The topology (edges’ presence) and edges’ features of a graph decides the message passing mechanism among vertices within the graph. While most existing approaches only manually define a single-value edge to describe the connectivity or strength of association between a pair of vertices, task-specific and crucial relationship cues may be disregarded by such manually defined topology and single-value edge features. In this paper, we propose the first general graph representation learning framework (called GRATIS) which can generate a strong graph representation with a task-specific topology and task-specific multi-dimensional edge features from any arbitrary input (i.e., graph or non-graph data). To learn each edge’s presence and multi-dimensional feature, our framework takes both of the corresponding vertices pair and their global contextual information into consideration, enabling the generated graph representation to have a globally optimal message passing mechanism for different down-stream tasks. The principled investigation results achieved for various graph analysis tasks (e.g., graph classification, vertex classification, and link prediction) on 11 graph and non-graph datasets show that our GRATIS can not only largely enhance pre-defined graphs but also learns a strong graph representation for non-graph data, with clear performance improvements on all tasks. In particular, the learned topology and multi-dimensional edge features provide complementary task-related cues for graph analysis tasks. Our framework is effective, robust and flexible, and is a plug-and-play module that can be combined with different backbones and Graph Neural Networks (GNNs) to generate a task-specific graph representation from various graph and non-graph data. Our code is made publicly available at https://***/SSYSteve/Learning-Graph-Representation-with-Task-specific-Topology-and-Multi-dimensional-Edge-Feature

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Robust Reference-Based Super-Resolution With Similarity-Aware Deformable Convolution

Robust Reference-Based Super-Resolution With Similarity-Awar...

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： Gyumin Shim Jinsun Park In So Kweon Robotics and Computer Vision Laboratory Korea Advanced Institute of Science and Technology Republic of Korea

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

In this paper, we propose a novel and efficient reference feature extraction module referred to as the Similarity Search and Extraction Network (SSEN) for reference-based super-resolution (RefSR) tasks. The proposed module extracts aligned relevant features from a reference image to increase the performance over single image super-resolution (SISR) methods. In contrast to conventional algorithms which utilize brute-force searches or optical flow estimations, the proposed algorithm is end-to-end trainable without any additional supervision or heavy computation, predicting the best match with a single network forward operation. Moreover, the proposed module is aware of not only the best matching position but also the relevancy of the best match. This makes our algorithm substantially robust when irrelevant reference images are given, overcoming the major cause of the performance degradation when using existing RefSR methods. Furthermore, our module can be utilized for self-similarity SR if no reference image is available. Experimental results demonstrate the superior performance of the proposed algorithm compared to previous works both quantitatively and qualitatively.

关键词： Feature extraction Convolution Image reconstruction Image resolution Degradation Robustness Kernel

来源：评论

学校读者我要写书评

暂无评论

Line Drawing Guided Progressive Inpainting of Mural Damage

arXiv

引用

arXiv 2022年

作者： Li, Luxi Zou, Qin Zhang, Fan Yu, Hongkai Chen, Long Song, Chengfang Huang, Xianfeng Wang, Xiaoguang Li, Qingquan Department of Computer Science Technology United International College of Beijing Normal University HongKong Baptist University Zhuhai China Machine Vision and Robotics Laboratory School of Computer Science Wuhan University Wuhan China State Key Laboratory of Surveying Mapping and Remote Sensing Information Engineering Wuhan University Wuhan China Department of Electrical Engineering and Computer Science Cleveland State University OH United States Institute of Automation Chinese Academy of Sciences Beijing China Cultural Heritage Intelligent Computing Laboratory Wuhan University Wuhan China Guangming Laboratory Shenzhen University Shenzhen China

Mural image inpainting is far less explored compared to its natural image counterpart and remains largely unsolved. Most existing image-inpainting methods tend to take the target image as the only input and directly repair the damage to generate a visually plausible result. These methods obtain high performance in restoration or completion of some pre-defined objects, e.g., human face, fabric texture, and printed texts, etc., however, are not suitable for repairing murals with varying subjects and large damaged areas. Moreover, due to discrete colors in paints, mural inpainting may suffer from apparent color bias. To this end, in this paper, we propose a line drawing guided progressive mural inpainting method. It divides the inpainting process into two steps: structure reconstruction and color correction, implemented by a structure reconstruction network (SRN) and a color correction network (CCN), respectively. In structure reconstruction, SRN utilizes the line drawing as an assistant to achieve large-scale content authenticity and structural stability. In color correction, CCN operates a local color adjustment for missing pixels which reduces the negative effects of color bias and edge jumping. The proposed approach is evaluated against the current state-of-the-art image inpainting methods. Qualitative and quantitative results demonstrate the superiority of the proposed method in mural image inpainting. The codes and data are available at https://***/qinnzou/mural-image-inpainting . © 2022, CC BY-NC-ND.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

No One Left Behind: Real-World Federated Class-Incremental Learning

arXiv

引用

arXiv 2023年

作者： Dong, Jiahua Li, Hongliu Cong, Yang Sun, Gan Zhang, Yulun Van Gool, Luc The State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China The Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China The University of Chinese Academy of Sciences Beijing100049 China The Department of Civil and Environmental Engineering Hong Kong Polytechnic University Hong Kong The College of Automation Science and Engineering South China University of Technology Guangzhou510640 China The Computer Vision Lab ETH Zürich Zürich8092 Switzerland

Federated learning (FL) is a hot collaborative training framework via aggregating model parameters of decentralized local clients. However, most FL methods unreasonably assume data categories of FL framework are known and fixed in advance. Moreover, some new local clients that collect novel categories unseen by other clients may be introduced to FL training irregularly. These issues render global model to undergo catastrophic forgetting on old categories, when local clients receive new categories consecutively under limited memory of storing old categories. To tackle the above issues, we propose a novel Local-Global Anti-forgetting (LGA) model. It ensures no local clients are left behind as they learn new classes continually, by addressing local and global catastrophic forgetting. Specifically, considering tackling class imbalance of local client to surmount local forgetting, we develop a category-balanced gradient-adaptive compensation loss and a category gradient-induced semantic distillation loss. They can balance heterogeneous forgetting speeds of hard-to-forget and easy-to-forget old categories, while ensure consistent class-relations within different tasks. Moreover, a proxy server is designed to tackle global forgetting caused by Non-IID class imbalance between different clients. It augments perturbed prototype images of new categories collected from local clients via self-supervised prototype augmentation, thus improving robustness to choose the best old global model for local-side semantic distillation loss. Experiments on representative datasets verify superior performance of our model against comparison methods. The code is available at https://***/JiahuaDong/LGA. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Sample hardness based gradient loss for long-tailed cervical cell detection

arXiv

引用

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：