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

Medical Image Registration and Its Application in Retinal Images: A Review

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nie, Qiushi Zhang, Xiaoqing Hu, Yan Gong, Mingdao Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Center for High Performance Computing Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Singapore Eye Research Institute 169856 Singapore State Key Laboratory of Ophthalmology Optometry and Visual Science Eye Hospital Wenzhou Medical University Wenzhou325027 China

Medical image registration is vital for disease diagnosis and treatment with its ability to merge diverse information of images, which may be captured under different times, angles, or modalities. Although several surveys have reviewed the development of medical image registration, these surveys have not systematically summarized methodologies of existing medical image registration methods. To this end, we provide a comprehensive review of these methods from traditional and deep learning-based directions, aiming to help audiences understand the development of medical image registration quickly. In particular, we review recent advances in retinal image registration at the end of each section, which has not attracted much attention. Additionally, we also discuss the current challenges of retinal image registration and provide insights and prospects for future research. © 2024, CC BY-NC-SA.

关键词： Deep learning

Beyond Intuition, a Framework for Applying GPs to Real-World Data

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Tazi, Kenza Lin, Jihao Andreas Viljoen, Ross Gardner, Alex John, St Ge, Hong Turner, Richard E. Department of Engineering University of Cambridge Cambridge United Kingdom British Antarctic Survey Cambridge United Kingdom Max Planck Institute for Intelligent Systems Tübingen Germany Jet Propulsion Laboratory California Institute of Technology PasadenaCA United States Department of Computer Science Aalto University Espoo Finland

Gaussian Processes (GPs) offer an attractive method for regression over small, structured and correlated datasets. However, their deployment is hindered by computational costs and limited guidelines on how to apply GPs beyond simple low-dimensional datasets. We propose a framework to identify the suitability of GPs to a given problem and how to set up a robust and well-specified GP model. The guidelines formalise the decisions of experienced GP practitioners, with an emphasis on kernel design and options for computational scalability. The framework is then applied to a case study of glacier elevation change yielding more accurate results at test time. © 2023, CC BY.

关键词：

CodeEnhance: A Codebook-Driven Approach for Low-Light Image Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xu Hou, XianXu Lai, Zhihui Zhou, Jie Zhang, Ya-Nan Pedrycz, Witold Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China The Department of Electrical & Computer Engineering University of Alberta University of Alberta Canada

Low-light image enhancement (LLIE) aims to improve low-illumination images. However, existing methods face two challenges: (1) uncertainty in restoration from diverse brightness degradations;(2) loss of texture and color information caused by noise suppression and light enhancement. In this paper, we propose a novel enhancement approach, CodeEnhance, by leveraging quantized priors and image refinement to address these challenges. In particular, we reframe LLIE as learning an image-to-code mapping from low-light images to discrete codebook, which has been learned from high-quality images. To enhance this process, a Semantic Embedding Module (SEM) is introduced to integrate semantic information with low-level features, and a Codebook Shift (CS) mechanism, designed to adapt the pre-learned codebook to better suit the distinct characteristics of our low-light dataset. Additionally, we present an Interactive Feature Transformation (IFT) module to refine texture and color information during image reconstruction, allowing for interactive enhancement based on user preferences. Extensive experiments on both real-world and synthetic benchmarks demonstrate that the incorporation of prior knowledge and controllable information transfer significantly enhances LLIE performance in terms of quality and fidelity. The proposed CodeEnhance exhibits superior robustness to various degradations, including uneven illumination, noise, and color distortion. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Diff-Reg: Diffusion Model in Doubly Stochastic Matrix Space for Registration Problem

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Qianliang Jiang, Haobo Luo, Lei Li, Jun Ding, Yaqing Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Intelligence Science and Technology Nanjing University Suzhou China Visual Recognition Group Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic National University of Singapore Singapore

Establishing reliable correspondences is essential for 3D and 2D-3D registration tasks. Existing methods commonly leverage geometric or semantic point features to generate potential correspondences. However, these features may face challenges such as large deformation, scale inconsistency, and ambiguous matching problems (e.g., symmetry). Additionally, many previous methods, which rely on single-pass prediction, may struggle with local minima in complex scenarios. To mitigate these challenges, we introduce a diffusion matching model for robust correspondence construction. Our approach treats correspondence estimation as a denoising diffusion process within the doubly stochastic matrix space, which gradually denoises (refines) a doubly stochastic matching matrix to the ground-truth one for high-quality correspondence estimation. It involves a forward diffusion process that gradually introduces Gaussian noise into the ground truth matching matrix and a reverse denoising process that iteratively refines the noisy one. In particular, we deploy a lightweight denoising strategy during the inference phase. Specifically, once points/image features are extracted and fixed, we utilize them to conduct multiple-pass denoising predictions in the reverse sampling process. Evaluation of our method on both 3D and 2D-3D registration tasks confirms its effectiveness. The code is available at https://***/wuqianliang/Diff-Reg. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

Non-convex potential games for finding global solutions to sensor network localization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attributed to the intrinsic non-convexity, obtaining a globally optimal solution to SNL is challenging, as well as implementing corresponding algorithms. In this paper, we formulate a non-convex multi-player potential game for a generic SNL problem to investigate the identification condition of the global Nash equilibrium (NE) therein, where the global NE represents the global solution of SNL. We employ canonical duality theory to transform the non-convex game into a complementary dual problem. Then we develop a conjugation-based algorithm to compute the stationary points of the complementary dual problem. On this basis, we show an identification condition of the global NE: the stationary point of the proposed algorithm satisfies a duality relation. Finally, simulation results are provided to validate the effectiveness of the theoretical results. Copyright © 2023, The Authors. All rights reserved.

关键词： Sensor networks

Zero-Knowledge Proof-based Practical Federated Learning on Blockchain

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Li, Meng Liu, Jiamou Zhu, Liehuang Russello, Giovanni Asghar, Muhammad Rizwan The School of Computer Science The University of Auckland Auckland New Zealand The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China Southeast Institute of Information Technology Beijing Institute of Technology Fujian351100 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China The Department of Computer Science University of Surrey The School of Computer Science The University of Auckland Auckland New Zealand

Since the concern of privacy leakage extremely discourages user participation in sharing data, federated learning has gradually become a promising technique for both academia and industry for achieving collaborative learning without leaking information about the local data. Unfortunately, most federated learning solutions cannot efficiently verify the execution of each participant's local machine learning model and protect the privacy of user data, simultaneously. In this article, we first propose a Zero-Knowledge Proof-based Federated Learning (ZKP-FL) scheme on blockchain. It leverages zero-knowledge proof for both the computation of local data and the aggregation of local model parameters, aiming to verify the computation process without requiring the plaintext of the local data. We further propose a Practical ZKP-FL (PZKP-FL) scheme to support fraction and non-linear operations. Specifically, we explore a Fraction-Integer mapping function, and use Taylor expansion to efficiently handle non-linear operations while maintaining the accuracy of the federated learning model. We also analyze the security of PZKP-FL. Performance analysis demonstrates that the whole running time of the PZKP-FL scheme is approximately less than one minute in parallel execution. Copyright © 2023, The Authors. All rights reserved.

关键词： Blockchain

Investigating the Vision Transformer Model for Image Retrieval Tasks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gkelios, Socratis Boutalis, Yiannis Chatzichristofis, Savvas A. Department of Electrical and Computer Engineering Democritus University of Thrace Xanthi Greece Intelligent Systems Laboratory Department of Computer Science Neapolis University Pafos Pafos Cyprus

This paper introduces a plug-and-play descriptor that can be effectively adopted for image retrieval tasks without prior initialization or preparation. The description method utilizes the recently proposed Vision Transformer network while it does not require any training data to adjust parameters. In image retrieval tasks, the use of Handcrafted global and local descriptors has been very successfully replaced, over the last years, by the Convolutional Neural Networks (CNN)-based methods. However, the experimental evaluation conducted in this paper on several benchmarking datasets against 36 state-of-the-art descriptors from the literature demonstrates that a neural network that contains no convolutional layer, such as Vision Transformer, can shape a global descriptor and achieve competitive results. As fine-tuning is not required, the presented methodology’s low complexity encourages adoption of the architecture as an image retrieval baseline model, replacing the traditional and well adopted CNN-based approaches and inaugurating a new era in image retrieval approaches. © 2021, CC BY.

关键词： Convolution

Nearest-Better Network for Fitness Landscape Analysis of Continuous Optimization Problems

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年

作者： Diao, Yiya Li, Changhe Zeng, Sanyou Yang, Shengxiang Coello, Carlos A. Coello China University of Geosciences School of Automation Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan China Anhui University of Sciences and Technology School of Artificial Intelligence Hefei China China University of Geosciences School of Mechanical Engineering and Electronic Information Wuhan China De Montfort University School of Computer Science and Informatics LeicesterLE1 9BH United Kingdom Department of Computer Science CINVESTAV-IPN 07360 Mexico Tecnologico de Monterrey Faculty of Excellence The School of Engineering and Sciences N.L. Monterrey Mexico

Fitness landscape analysis (FLA) is quite important in evolutionary computation. In this paper, we propose a novel FLA method, the nearest-better network (NBN), which uses the nearest-better relationship to simplify the original fitness landscape of continuous optimization problems. We introduce an efficient algorithm to calculate NBN for continuous problems. We also propose four numerical measurements and a 3D visualization method based on NBN. Experiments show that compared to the other main FLA methods, the four numerical measurements proposed here can effectively measure the four intended features: neutrality, ruggedness, modality, and basin of attraction, respectively, and common features of the fitness landscape can be maintained in 3D NBN visualization, regardless of the scale of the problem. NBN also provides a view of how algorithms search in high-dimensional problems with the help of the 3D NBN visualization. © 1997-2012 IEEE.

关键词： Optimization algorithms

Provably Convergent Federated Trilevel Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiao, Yang Yang, Kai Wu, Tiancheng Jian, Chengtao Huang, Jianwei Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China Shanghai Research Institute for Intelligent Autonomous Systems China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Trilevel learning, also called trilevel optimization (TLO), has been recognized as a powerful modelling tool for hierarchical decision process and widely applied in many machine learning applications, such as robust neural architecture search, hyperparameter optimization, and domain adaptation. Tackling TLO problems has presented a great challenge due to their nested decision-making structure. In addition, existing works on TLO face the following key challenges: 1) they all focus on the non-distributed setting, which may lead to privacy breach;2) they do not offer any non-asymptotic convergence analysis which characterizes how fast an algorithm converges. To address the aforementioned challenges, this paper proposes an asynchronous federated trilevel optimization method to solve TLO problems. The proposed method utilizes µ-cuts to construct a hyper-polyhedral approximation for the TLO problem and solve it in an asynchronous manner. We demonstrate that the proposed µ-cuts are applicable to not only convex functions but also a wide range of non-convex functions that meet the µ-weakly convex assumption. Furthermore, we theoretically analyze the non-asymptotic convergence rate for the proposed method by showing its iteration complexity to obtain ϵ-stationary point is upper bounded by (Formula Presented). Extensive experiments on real-world datasets have been conducted to elucidate the superiority of the proposed method, e.g., it has a faster convergence rate with a maximum acceleration of approximately 80%. Copyright © 2023, The Authors. All rights reserved.

关键词： Decision making