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

NTIRE 2023 HR NonHomogeneous Dehazing Challenge Report

学校读者我要写书评

暂无评论

NTIRE 2023 HR NonHomogeneous Dehazing Challenge Report

2023 IEEE/CVF Conference on computer vision and Pattern Recognition Workshops, CVPRW 2023

作者： Ancuti, Codruta O. Ancuti, Cosmin Vasluianu, Florin-Alexandru Timofte, Radu Zhou, Han Dong, Wei Liu, Yangyi Chen, Jun Liu, Huan Li, Liangyan Wu, Zijun Dong, Yubo Li, Yuyan Qiu, Tian He, Yu Lu, Yonghong Wu, Yinwei Jiang, Zhenxiang Liu, Songhua Yang, Xingyi Jing, Yongcheng Benjdira, Bilel Ali, Anas M. Koubaa, Anis Yang, Hao-Hsiang Chen, I-Hsiang Chen, Wei-Ting Huang, Zhi-Kai Chen, Yi-Chung Hsieh, Chia-Hsuan Chang, Hua-En Chiang, Yuan-Chun Kuo, Sy-Yen Guo, Yu Gao, Yuan Liu, Ryan Wen Lu, Yuxu Qu, Jingxiang He, Shengfeng Ren, Wenqi Hoang, Trung Zhang, Haichuan Yazdani, Amirsaeed Monga, Vishal Yang, Lehan Wu, Alex Jiahao Mai, Tiancheng Cong, Xiaofeng Yin, Xuemeng Yin, Xuefei Emad, Hazim Abdallah, Ahmed Yasser, Yahya Elshahat, Dalia Elbaz, Esraa Li, Zhan Kuang, Wenqing Luo, Ziwei Gustafsson, Fredrik K. Zhao, Zheng Sjölund, Jens Schön, Thomas B. Zhang, Zhao Wei, Yanyan Wang, Junhu Zhao, Suiyi Zheng, Huan Guo, Jin Sun, Yangfan Liu, Tianli Hao, Dejun Jiang, Kui Sarvaiya, Anjali Prajapati, Kalpesh Patra, Ratnadeep Barik, Pragnesh Rathod, Chaitanya Upla, Kishor Raja, Kiran Ramachandra, Raghavendra Busch, Christoph ETcTI Universitatea Politehnica Timisoara Romania ICTEAM UCL Belgium Computer Vision Lab University of Wuerzburg Germany Computer Vision Lab ETH Zurich Switzerland Department of Electrical and Computer Engineering McMaster University Canada Department of Electrical and Computer Engineering University of Alberta Canada McMaster University Canada Xidian University China Research Institute Singapore National University of Singapore Singapore University of Sydney Australia Robotics and Internet-of-Things Laboratory Prince Sultan University Riyadh12435 Saudi Arabia Department of Electrical Engineering National Taiwan University Taiwan Graduate Institute of Electronics Engineering National Taiwan University Taiwan Graduate Institute of Communication Engineering National Taiwan University Taiwan Wuhan University of Technology China Singapore Management University Singapore Singapore Sun Yat-sen University China Electrical Engineering Department Pennsylvania State University United States The University of Sydney Australia Southeast University China University of California Los Angeles United States Beijing Jiaotong University China Mansoura Univeristy Egypt College of Information Science and Technology Jinan University China Department of Information Technology Uppsala University Sweden Hefei University of Technology China Zhejiang Dahua Technology China Sardar Vallabhbhai National Institute of Technology India Norwegian University of Science and Technology Norway

ISBN: (纸本)9798350302493

This study assesses the outcomes of the NTIRE 2023 Challenge on Non-Homogeneous Dehazing, wherein novel techniques were proposed and evaluated on new image dataset called HD-NH-HAZE. The HD-NH-HAZE dataset contains 50 high resolution pairs of real-life outdoor images featuring nonhomogeneous hazy images and corresponding haze-free images of the same scene. The nonhomogeneous haze was simulated using a professional setup that replicated real-world conditions of hazy scenarios. The competition had 246 participants and 17 teams submitted solutions for the final testing phase. The proposed solutions demonstrated the cutting-edge in image dehazing technology. © 2023 IEEE.

关键词： Demulsification

The iToBoS dataset: skin region images extracted from 3D total body photographs for lesion detection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Saha, Anup Adeola, Joseph Ferrera, Nuria Mothershaw, Adam Rezze, Gisele Gaborit, Séraphin D’Alessandro, Brian Hudson, James Szabó, Gyula Pataki, Balazs Rajani, Hayat Nazari, Sana Hayat, Hassan Primiero, Clare Soyer, H. Peter Malvehy, Josep Garcia, Rafael Computer Vision and Robotics Research Institute University of Girona Girona Spain Dermatology Department Hospital Clínic Barcelona Universitat de Barcelona Barcelona Spain Frazer Institute The University of Queensland Dermatology Research Center Brisbane Australia ISAHIT Paris France Canfield Scientific Inc. ParsippanyNJ United States V7 London United Kingdom HUN-REN Institute for Computer Science and Control Budapest Hungary CIBER de Enfermedades Raras Instituto de Salud Carlos III Barcelona Spain Dermatology Department Princess Alexandra Hospital BrisbaneQLD Australia Dermatology Department University of Trieste Trieste Italy

Artificial intelligence has significantly advanced skin cancer diagnosis by enabling rapid and accurate detection of malignant lesions. In this domain, most publicly available image datasets consist of single, isolated skin lesions positioned at the center of the image. While these lesion-centric datasets have been fundamental for developing diagnostic algorithms, they lack the context of the surrounding skin, which is critical for improving lesion detection. The iToBoS dataset was created to address this challenge. It includes 16,954 images of skin regions from 100 participants, captured using 3D total body photography. Each image roughly corresponds to a 7×9 cm section of skin with all suspicious lesions annotated using bounding boxes. Additionally, the dataset provides metadata such as anatomical location, age group, and sun damage score for each image. This dataset aims to facilitate training and benchmarking of algorithms, with the goal of enabling early detection of skin cancer and deployment of this technology in non-clinical environments. © 2025, CC BY-NC-SA.

关键词： Lung cancer

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

学校读者我要写书评

暂无评论

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

MFCLIP: Multi-modal Fine-grained CLIP for Generalizable Diffusion Face Forgery Detection

学校读者我要写书评

暂无评论

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

Fast Candidate Region Extraction for SAR Ship Target

学校读者我要写书评

暂无评论

Fast Candidate Region Extraction for SAR Ship Target

Youth Academic Annual Conference of Chinese Association of Automation (YAC)

作者： Panpan Zhang Haibo Luo Zheng Xu Miao He Shenyang Institute of Automation Shenyang China Institutes for Robotics and Intelligent Manufacturing Shenyang China University of Chinese Academy of Sciences Beijing China Key Laboratory of Opto-Electronic Information Processing Shenyang China The Key Lab of Image Understanding and Computer Vision Shenyang China

ISBN: (纸本)9781665465373

At present, deep learning technology is widely used in ship target detection in synthetic aperture radar (SAR) images. However, high-resolution remote sensing SAR images cover a larger area and have larger image sizes. To be able to use the deep learning model for training and testing, the image needs to be cropped to the appropriate size. In a high-resolution SAR ship image, the ship target usually takes only a small part of the whole image. As a result, only part of the cropped image contains the target, and most of the rest are background regions. This will cause a lot of computational redundancy in the model inference stage. To solve this problem, a fast candidate region extraction algorithm is proposed in this paper for ship target extraction. The algorithm consists of three parts: firstly, extract the saliency map of the SAR ship image, secondly, perform median filtering on the segmented image, and thirdly, extract candidate regions. The superiority of the algorithm was demonstrated by experiments on the AIR-SARShip-1.0 dataset.

关键词： Deep learning Training Redundancy Radar polarimetry Inference algorithms Indexes Marine vehicles

Automated industrial quality control of pipe stacks using computer vision 4th

学校读者我要写书评

暂无评论

Automated industrial quality control of pipe stacks using co...

4th International Conference on computer vision and Image Processing, CVIP 2019

作者： Chatterjee, Sayantan Chaudhuri, Bidyut B. Nandi, Gora C. Department of Robotics and Artificial Intelligence Indian Institute of Information Technology Allahabad AllahabadUttar Pradesh211012 India Department of Computer Vision and Pattern Recognition Indian Statistical Institute Kolkata KolkataWest Bengal700108 India

ISBN: (纸本)9789811540141

In this work, we describe an automated quality assurance system for pipes in warehouses and yards using simple handheld and mobile equipment like smartphone cameras. Currently, quality inspection for bent and crooked pipe ends is done manually, which entails additional labour costs and is relatively slower than a mechanised approach. We propose an efficient and robust method of detecting the perfectly circular cross-sections of the pipes in stacks using an adaptive variation of Hough Transform algorithm. As a multistage approach, our proposed method first intensifies the foreground features relative to the background and then applies Canny edge detection to obtain the gradient details. The gradient directions are in turn fed to the modified Hough Transform algorithm using Hough gradient to detect the cross-sections. The novel Hough Transform modification features a region-based processing in a "coarse to fine" manner by dividing the image into smaller grids and detecting circular cross-sections per grid, which has computational advantages of using a smaller accumulator and is less memory intensive. Experiments were performed on real industrial images to validate the efficiency of the proposed algorithm and the results show that the proposed method can successfully and accurately highlight the perfectly circular cross-sections while leaving the faulty pipe-ends undetected. © Springer Nature Singapore Pte Ltd 2020.

关键词： Hough transforms

Learning Graph Representation of Person-specific Cognitive Processes from Audio-visual Behaviours for Automatic Personality Recognition

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Song, Siyang Shao, Zilong Jaiswal, Shashank Shen, Linlin Valstar, Michel Gunes, Hatice Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom Computer Vision Institute Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Computer Vision Lab University of Nottingham Nottingham United Kingdom

This paper proposes to recognise the true (self-reported) personality from the learned simulation of the target subject’s cognition. This approach builds on two following findings in cognitive science: (i) human cognition partially determines expressed behaviour and is directly linked to true personality traits;and (ii) in dyadic interactions individuals’ nonverbal behaviours are influenced by their conversational partner’s behaviours. In this context, we hypothesise that during a dyadic interaction, a target subject’s facial reactions are driven by two main factors, i.e. their internal (person-specific) cognitive process, and the externalised nonverbal behaviours of their conversational partner. Consequently, we propose to represent the target subject’s (defined as the listener) person-specific cognition in the form of a person-specific CNN architecture that has unique architectural parameters and depth, which takes audio-visual non-verbal cues displayed by the conversational partner (defined as the speaker) as input, and is able to reproduce the target subject’s facial reactions. Each person-specific CNN is explored by the Neural Architecture Search (NAS) and a novel adaptive loss function, which is then represented as a graph representation for recognising the target subject’s true personality. Experimental results not only show that the produced graph representations are well associated with target subjects’ personality traits in both human-human and human-machine interaction scenarios, and outperform the existing approaches with significant advantages, but also demonstrate that the proposed novel strategies such as adaptive loss, and the end-to-end vertices/edges feature learning, help the proposed approach in learning more reliable personality representations. Building on our earlier version of this work, this paper further proposes: (i) assigning a unique depth for each CNN;(ii) a novel end-to-end graph vertex feature learning strategy;(iii) a transformer-bas

关键词： Cognitive systems

Towards robust monocular visual odometry for flying robots on planetary missions

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wudenka, Martin Müller, Marcus G. Demmel, Nikolaus Wedler, Armin Triebel, Rudolph Cremers, Daniel Stürzl, Wolfgang Institute of Robotics and Mechatronics German Aerospace Center DLR Computer Vision Group Department of Informatics Technical University of Munich Germany Autonomous Systems Lab ETH Zurich Switzerland

In the future, extraterrestrial expeditions will not only be conducted by rovers but also by flying robots. The technical demonstration drone Ingenuity, that just landed on Mars, will mark the beginning of a new era of exploration unhindered by terrain traversability. Robust self-localization is crucial for that. Cameras that are lightweight, cheap and information-rich sensors are already used to estimate the ego-motion of vehicles. However, methods proven to work in man-made environments cannot simply be deployed on other planets. The highly repetitive textures present in the wastelands of Mars pose a huge challenge to descriptor matching based approaches. In this paper, we present an advanced robust monocular odometry algorithm that uses efficient optical flow tracking to obtain feature correspondences between images and a refined keyframe selection criterion. In contrast to most other approaches, our framework can also handle rotation-only motions that are particularly challenging for monocular odometry systems. Furthermore, we present a novel approach to estimate the current risk of scale drift based on a principal component analysis of the relative translation information matrix. This way we obtain an implicit measure of uncertainty. We evaluate the validity of our approach on all sequences of a challenging real-world dataset captured in a Mars-like environment and show that it outperforms state-of-the-art approaches. The source code is publicly available at: https://***/DLR-RM/granite. Copyright © 2021, The Authors. All rights reserved.

关键词： Principal component analysis

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

学校读者我要写书评

暂无评论

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