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

Constrained design of deep Iris networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Nguyen, Kien Fookes, Clinton Sridharan, Sridha Image and Video Research Laboratory Saivt School of Electrical Engineering and Computer Science Queensland University of Technology BrisbaneQLD4000 Australia

Despite the promise of recent deep neural networks in the iris recognition setting, there are vital properties of the classic IrisCode which are almost unable to be achieved with current deep iris networks: the compactness of model and the small number of computing operations (FLOPs). This paper re-models the iris network design process as a constrained optimization problem which takes model size and computation into account as learning criteria. On one hand, this allows us to fully automate the network design process to search for the best iris network confined to the computation and model compactness constraints. On the other hand, it allows us to investigate the optimality of the classic IrisCode and recent iris networks. It also allows us to learn an optimal iris network and demonstrate state-of-the-art performance with less computation and memory requirements. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

AIM 2020 Challenge on image Extreme Inpainting 16th

学校读者我要写书评

暂无评论

AIM 2020 Challenge on Image Extreme Inpainting

Workshops held at the 16th European Conference on computer Vision, ECCV 2020

作者： Ntavelis, Evangelos Romero, Andrés Bigdeli, Siavash Timofte, Radu Hui, Zheng Wang, Xiumei Gao, Xinbo Shin, Chajin Kim, Taeoh Son, Hanbin Lee, Sangyoun Li, Chao Li, Fu He, Dongliang Wen, Shilei Ding, Errui Bai, Mengmeng Li, Shuchen Zeng, Yu Lin, Zhe Yang, Jimei Zhang, Jianming Shechtman, Eli Lu, Huchuan Zeng, Weijian Ni, Haopeng Cai, Yiyang Li, Chenghua Xu, Dejia Wu, Haoning Han, Yu Nadim, Uddin S. M. Jang, Hae Woong Ahmed, Soikat Hasan Yoon, Jungmin Jung, Yong Ju Li, Chu-Tak Liu, Zhi-Song Wang, Li-Wen Siu, Wan-Chi Lun, Daniel P. K. Suin, Maitreya Purohit, Kuldeep Rajagopalan, A.N. Narang, Pratik Mandal, Murari Chauhan, Pranjal Singh Computer Vision Lab ETH Zürich Zürich Switzerland CSEM Neuchâtel Switzerland School of Electronic Engineering Xidian University Xi’an China Image and Video Pattern Recognition Laboratory School of Electrical and Electronic Engineering Yonsei University Seoul Korea Republic of Baidu Inc. Beijing China Beijing China Dalian University of Technology Dalian China Adobe San Jose United States Rensselaer Polytechnic Institute Troy United States Peking University Beijing China Lab Gachon University Seongnam Korea Republic of Centre for Multimedia Signal Processing Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong China Indian Institute of Technology Madras Chennai India BITS Pilani Pilani India MNIT Jaipur Jaipur India

ISBN: (纸本)9783030670696

This paper reviews the AIM 2020 challenge on extreme image inpainting. This report focuses on proposed solutions and results for two different tracks on extreme image inpainting: classical image inpainting and semantically guided image inpainting. The goal of track 1 is to inpaint large part of the image with no supervision. Similarly, the goal of track 2 is to inpaint the image by having access to the entire semantic segmentation map of the input. The challenge had 88 and 74 participants, respectively. 11 and 6 teams competed in the final phase of the challenge, respectively. This report gauges current solutions and set a benchmark for future extreme image inpainting methods. © 2020, Springer Nature Switzerland AG.

关键词： Semantic Segmentation

Center-extraction-based three dimensional nuclei instance segmentation of fluorescence microscopy images

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Ho, David Joon Han, Shuo Fu, Chichen Salama, Paul Dunn, Kenneth W. Delp, Edward J. Video and Image Processing Laboratory School of Electrical and Computer Engineering Purdue University West LafayetteIN United States Department of Electrical and Computer Engineering Indiana University-Purdue University IndianapolisIN United States Division of Nephrology School of Medicine Indiana University IndianapolisIN United States

Fluorescence microscopy is an essential tool for the analysis of 3D subcellular structures in tissue. An important step in the characterization of tissue involves nuclei segmentation. In this paper, a two-stage method for segmentation of nuclei using convolutional neural networks (CNNs) is described. In particular, since creating labeled volumes manually for training purposes is not practical due to the size and complexity of the 3D data sets, the paper describes a method for generating synthetic microscopy volumes based on a spatially constrained cycle-consistent adversarial network. The proposed method is tested on multiple real microscopy data sets and outperforms other commonly used segmentation techniques. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

Multi-level graph convolutional network with automatic graph learning for hyperspectral image classification

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wan, Sheng Gong, Chen Pan, Shirui Yang, Jie Yang, Jian PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Faculty of Information Technology Monash University ClaytonVIC3800 Australia

Nowadays, deep learning methods, especially the Graph Convolutional Network (GCN), have shown impressive performance in hyperspectral image (HSI) classification. However, the current GCN-based methods treat graph construction and image classification as two separate tasks, which often results in suboptimal performance. Another defect of these methods is that they mainly focus on modeling the local pairwise importance between graph nodes while lack the capability to capture the global contextual information of HSI. In this paper, we propose a Multi-level GCN with Automatic Graph Learning method (MGCN-AGL) for HSI classification, which can automatically learn the graph information at both local and global levels. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions, which helps encode the spatial context to form the graph information at local level. Moreover, we utilize multiple pathways for local-level graph convolution, in order to leverage the merits from the diverse spatial context of HSI and to enhance the expressive power of the generated representations. To reconstruct the global contextual relations, our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level. Then inference can be performed along the reconstructed graph edges connecting faraway regions. Finally, the multi-level information is adaptively fused to generate the network output. In this means, the graph learning and image classification can be integrated into a unified framework and benefit each other. Extensive experiments have been conducted on three real-world hyperspectral datasets, which are shown to outperform the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： image classification

Efficient MedSAMs: Segment Anything in Medical images on Laptop

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ma, Jun Li, Feifei Kim, Sumin Asakereh, Reza Le, Bao-Hiep Nguyen-Vu, Dang-Khoa Pfefferle, Alexander Wei, Muxin Gao, Ruochen Lyu, Donghang Yang, Songxiao Purucker, Lennart Marinov, Zdravko Staring, Marius Lu, Haisheng Dao, Thuy Thanh Ye, Xincheng Li, Zhi Brugnara, Gianluca Vollmuth, Philipp Foltyn-Dumitru, Martha Cho, Jaeyoung Mahmutoglu, Mustafa Ahmed Bendszus, Martin Pflüger, Irada Rastogi, Aditya Ni, Dong Yang, Xin Zhou, Guang-Quan Wang, Kaini Heller, Nicholas Papanikolopoulos, Nikolaos Weight, Christopher Tong, Yubing Udupa, Jayaram K. Patrick, Cahill J. Wang, Yaqi Zhang, Yifan Contijoch, Francisco McVeigh, Elliot Ye, Xin He, Shucheng Haase, Robert Pinetz, Thomas Radbruch, Alexander Krause, Inga Kobler, Erich He, Jian Tang, Yucheng Yang, Haichun Huo, Yuankai Luo, Gongning Kushibar, Kaisar Amankulov, Jandos Toleshbayev, Dias Mukhamejan, Amangeldi Egger, Jan Pepe, Antonio Gsaxner, Christina Luijten, Gijs Fujita, Shohei Kikuchi, Tomohiro Wiestler, Benedikt Kirschke, Jan S. de la Rosa, Ezequiel Bolelli, Federico Lumetti, Luca Grana, Costantino Xie, Kunpeng Wu, Guomin Puladi, Behrus Martín-Isla, Carlos Lekadir, Karim Campello, Victor M. Shao, Wei Brisbane, Wayne Jiang, Hongxu Wei, Hao Yuan, Wu Li, Shuangle Zhou, Yuyin Wang, Bo AI Collaborative Centre University Health Network Department of Laboratory Medicine and Pathobiology University of Toronto Vector Institute Toronto Canada Peter Munk Cardiac Centre University Health Network Toronto Canada Toronto General Hospital Research Institute University Health Network Department of Computer Science University of Toronto University Health Network Vector Institute Toronto Canada University of Science Vietnam National University Ho Chi Minh City Viet Nam Institute of Computer Science University of Freiburg Freiburg Germany School of Medicine and Health Harbin Institute of Technology Harbin China Division of Image Processing Department of Radiology Leiden University Medical Center Leiden Netherlands Department of System and Control Engineering School of Engineering Institute of Science Tokyo Formerly Tokyo Institute of Technology Tokyo Japan Institute for Anthropomatics and Robotics Karlsruhe Institute of Technology Karlsruhe Germany School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China School of Electrical Engineering and Computer Science University of Queensland Brisbane Australia School of Cyberspace Hangzhou Dianzi University Hangzhou China Division for Computational Radiology and Clinical AI The Department of Neuroradiology University Hospital Bonn Germany Division for Computational Radiology and Clinical AI The Department of Neuroradiology University Hospital Bonn Germany Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany Division for Computational Radiology and Clinical AI Department of Neuroradiology University Hospital Bonn Germany School of Biomedical Engineering Shenzhen University Shenzhen China School of Biological Science and Medical Engineering Southeast University Nanjing China Department of Urology Cleveland Clinic Cleveland United States Department of Computer Science University of Minnesota Minneapolis United St

Promptable segmentation foundation models have emerged as a transformative approach to addressing the diverse needs in medical images, but most existing models require expensive computing, posing a big barrier to their adoption in clinical practice. In this work, we organized the first international competition dedicated to promptable medical image segmentation, featuring a large-scale dataset spanning nine common imaging modalities from over 20 different institutions. The top teams developed lightweight segmentation foundation models and implemented an efficient inference pipeline that substantially reduced computational requirements while maintaining state-of-the-art segmentation accuracy. Moreover, the post-challenge phase advanced the algorithms through the design of performance booster and reproducibility tasks, resulting in improved algorithms and validated reproducibility of the winning solution. Furthermore, the best-performing algorithms have been incorporated into the open-source software with a user-friendly interface to facilitate clinical adoption. The data and code are publicly available to foster the further development of medical image segmentation foundation models and pave the way for impactful real-world applications. © 2024, CC BY-NC-SA.

关键词： Open source software

Minutiae Triangle Graphs: A New Fingerprint Representation with Invariance Properties

学校读者我要写书评

暂无评论

Minutiae Triangle Graphs: A New Fingerprint Representation w...

International Conference on image and Vision Computing New Zealand, IVCNZ

作者： Akmal-Jahan Mohamed-Abdul-Cader Watcharapong Chaidee Jasmine Banks Vinod Chandran Vision and Signal Processing Lab School of Electrical Engineering and Computer Science Queensland University of Technology Brisbane Australia Signal and Image Processing Laboratory Kasetsart University Bangkok Thailand

A new algorithm for matching finger or palm prints is presented for use where the full hand is considered as a biometric and only parts may be available in images for comparison. The algorithm uses an extended version of the minutiae-based approach treating the pattern as a graph of minutiae-like points. The procedure to identify minutiae-like points uses Gabor filtering, edge detection and thinning and following line patterns. A set of such points is subjected to Delaunay triangulation yielding a starting set of base-triangles for matching. There can be multiple matches of such triangles between the template and test - as similar triangles with a tolerance in the angles. Graphs are then grown to 5 and more nodes as long as a match can be found, until the maximum size matching graph is obtained. If the test matches a significant part of the template, the maximum order of graph matched will be high. The matching process is robust to transformations such as rotation, translation and scale changes. It can be applied to any part of the hand provided minutiae-like points are identifiable prior to the matching steps. The algorithm is tested using 158 fingerprint images from FVC 2002 DB1. 100 genuine and 5048 impostor scores are generated from 46 templates and 112 testing images. It had an EER of about 6%. It proves the principle behind the methodology and demonstrates that the method can be effective with degraded fingerprint images and is robust to similarity transformations present in the data. It can be applied for forensic fingerprint matching from the palm or parts other than the fingertips. By using multiple parts and multiple templates, the accuracy of the method will be improved with fusion in future versions of the algorithm.

关键词：

Multi-Class Segmentation of Aortic Branches and Zones in Computed Tomography Angiography: The AortaSeg24 Challenge

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Imran, Muhammad Krebs, Jonathan R. Sivaraman, Vishal Balaji Zhang, Teng Kumar, Amarjeet Ueland, Walker R. Fassler, Michael J. Huang, Jinlong Sun, Xiao Wang, Lisheng Shi, Pengcheng Rokuss, Maximilian Baumgartner, Michael Kirchhof, Yannick Maier-Hein, Klaus H. Isensee, Fabian Liu, Shuolin Han, Bing Nguyen, Bong Thanh Shin, Dong-Jin Ji-Woo, Park Choi, Mathew Uhm, Kwang-Hyun Ko, Sung-Jea Lee, Chanwoong Chun, Jaehee Kim, Jin Sung Zhang, Minghui Zhang, Hanxiao You, Xin Gu, Yun Pan, Zhaohong Liu, Xuan Liang, Xiaokun Tiefenthaler, Markus Almar-Munoz, Enrique Schwab, Matthias Kotyushev, Mikhail Epifanov, Rostislav Wodzinski, Marek Müller, Henning Qayyum, Abdul Mazher, Moona Niederer, Steven A. Wang, Zhiwei Yang, Kaixiang Ren, Jintao Korreman, Stine Sofia Gao, Yuchong Zeng, Hongye Zheng, Haoyu Zheng, Rui Yue, Jinghua Zhou, Fugen Liu, Bo Cosman, Alexander Liang, Muxuan Zhao, Chang Upchurch, Gilbert R. Ma, Jun Zhou, Yuyin Cooper, Michol A. Shao, Wei Department of Medicine University of Florida GainesvilleFL32611 United States Department of Surgery University of Florida GainesvilleFL32611 United States Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States Department of Computer Information Science and Engineering University of Florida GainesvilleFL32611 United States Shanghai Jiao Tong University Shanghai China Electronic & Information Engineering School Harbin Institute of Technology [Shenzhen Shenzhen China Division of Medical Image Computing German Cancer Research Center [DKFZ Heidelberg Germany CO. LTD Beijing China MedAI Seoul Korea Republic of Korea University Seoul Korea Republic of Department of Radiation Oncology Yonsei Cancer Center Heavy Ion Therapy Research Institute Yonsei University College of Medicine Seoul Korea Republic of Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Medical University of Innsbruck Innsbruck Austria Novosibirsk State University Novosibirsk Russia AGH University of Krakow Krakow Poland Sierre Switzerland University of Geneva Geneva Switzerland The Sense Innovation and Research Center Sion Switzerland National Heart and Lung Institute Faculty of Medicine Imperial College London London United Kingdom Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Hubei Wuhan China Aarhus University Department of Clinical Medicine Nordre Palle Juul-Jensens Blvd. 11 Aarhus8200 Denmark Shanghaitech University Pudong Shanghai China Image Processing Center Beihang University Beijing China Department of Computer Science and Engineering University of California Santa CruzCA95064 United States Department of Biostatistics University of Florida GainesvilleFL32611 United States University Health Network ON Canada Agronomy Department University of F

Multi-class segmentation of the aorta in computed tomography angiography (CTA) scans is essential for diagnosing and planning complex endovascular treatments for patients with aortic dissections. However, existing methods reduce aortic segmentation to a binary problem, limiting their ability to measure diameters across different branches and zones. Furthermore, no open-source dataset is currently available to support the development of multi-class aortic segmentation methods. To address this gap, we organized the AortaSeg24 MICCAI Challenge, introducing the first dataset of 100 CTA volumes annotated for 23 clinically relevant aortic branches and zones. This dataset was designed to facilitate both model development and validation. The challenge attracted 121 teams worldwide, with participants leveraging state-of-the-art frameworks such as nnU-Net and exploring novel techniques, including cascaded models, data augmentation strategies, and custom loss functions. We evaluated the submitted algorithms using the Dice Similarity Coefficient (DSC) and Normalized Surface Distance (NSD), highlighting the approaches adopted by the top five performing teams. This paper presents the challenge design, dataset details, evaluation metrics, and an in-depth analysis of the top-performing algorithms. The annotated dataset, evaluation code, and implementations of the leading methods are publicly available to support further research. All resources can be accessed at https://***. © 2025, CC BY-NC-SA.

关键词： computerized tomography

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

Drugs with SMILES Similar to Coxibs

学校读者我要写书评

暂无评论

Drugs with SMILES Similar to Coxibs

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： George Kallergis Stelios Sfakianakis Michael Zervakis Marios Spanakis Digital Image and Signal Processing Laboratory School of Electrical and Computer Engineering Technical University of Crete Polytechnioupolis Chania Greece Computational Biomedicine Laboratory Institute of Computer Science Foundation for Research & Technology Hellas (FORTH) Heracklion Greece

Coxibs are a group of drugs with selective inhibition against cyclooxygenase-2 (COX-2) enzymes with increased interest from scientific community due to their side effects and potential other pharmacological mechanisms. The aim of this work is to utilize the chemical characteristics of coxibs in order to identify compounds with similar chemical structure. The approach is based on the assessment of the Simplified Molecular-Input Line-Entry System (SMILES) as adequate molecular structure representations for the identification of drug similarities. The similarity measurements are based on molecular fingerprints that were extracted from coxibs and the Maximum Consecutive Subsequence (MCS) algorithm. An ensemble of methods based on majority voting, weighting and equal weighting on the algorithms was further applied. Majority voting returned 200 similar compounds whereas weighting and equal weighting returned 53 and 27 compounds respectively. Interestingly, despite the independence of the methods, all three identified 20 common compounds. The identification of drugs with potential chemical similarity with coxibs, as revealed from similarity measurements of fingerprints and MCS scores could provide new insights for potential biological targets for coxibs or drugs that could interact with COX-2 or other biological targets of coxibs.

关键词： Drugs Fingerprint recognition Compounds Chemicals Biological information theory Inhibitors Digital images