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

IFAC-PapersOnLine 2020年第2期53卷 9282-9287页

作者： Matthew R. Kirchner Eddie Ball Jacques Hoffler Don Gaublomme Image and Signal Processing Branch Code D5J1000 Naval Air Warfare Center Weapons Division China Lake CA USA Electrical and Computer Engineering Department University of California Santa Barbara CA 93106 USA Flight Vehicle Modeling and Simulation Branch Naval Air Warfare Center Aircraft Division Patuxent River MD USA

We present a numeric method to compute the safe operating flight conditions for a helicopter such that we can ensure a safe landing in the event of a partial or total engine failure. The unsafe operating region is the complement of the backwards reachable tube, which can be found as the sub-zero level set of the viscosity solution of a Hamilton-Jacobi (HJ) equation. Traditionally, numerical methods used to solve the HJ equation rely on a discrete grid of the solution space and exhibit exponential scaling with dimension, which is problematic for the high-fidelity dynamics models required for accurate helicopter modeling. We avoid the use of spatial grids by formulating a trajectory optimization problem, where the solution at each initial condition can be computed in a computationally efficient manner. The proposed method is shown to compute an autonomous landing trajectory from any operating condition, even in non-cruise flight conditions.

关键词： Reachability Autorotation Optimal Control

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

Adaptive Video Subsampling For Energy-Efficient Object Detection

学校读者我要写书评

暂无评论

Adaptive Video Subsampling For Energy-Efficient Object Detec...

Asilomar Conference on signals, Systems & computers

作者： Divya Mohan Sameeksha Katoch Suren Jayasuriya Pavan Turaga Andreas Spanias Sensor Signal and Information Processing (SenSIP) Center School of Electrical Computer and Energy Engineering Arizona State University

ISBN: (数字)9781728143002

ISBN: (纸本)9781728143019

Energy-efficient computer vision is vitally important for embedded and mobile platforms where a longer battery life can allow increased deployment in the field. In image sensors, one of the primary causes of energy expenditure is the sampling and digitization process. Smart subsampling of the image-array in a manner that is task-specific, can result in significant savings of energy. We present an adaptive algorithm for video subsampling, which is aimed at enabling accurate object detection, while saving sampling energy. The approach utilizes objectness measures, which we show can be accurately estimated even from sub-sampled frames, and then uses that information to determine the adaptive sampling for the subsequent frame. We show energy savings of 18 - 67% with only a slight degradation in object detection accuracy in experiments. These results motivated us to further explore energy-efficient subsampling using advanced techniques such as, reinforcement learning and Kalman filtering. The experiments using these techniques are underway and provide ample support for adaptive subsampling as a promising avenue for embedded computer vision in the future.

关键词： Object detection Streaming media computer vision image sensors Optical imaging Task analysis Adaptive algorithms

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

Distorted representation space characterization through backpropagated gradients

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Kwon, Gukyeong Prabhushankar, Mohit Temel, Dogancan AlRegib, Ghassan Center for Signal and Information Processing School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332-0250 United States

In this paper, we utilize weight gradients from backpropagation to characterize the representation space learned by deep learning algorithms. We demonstrate the utility of such gradients in applications including perceptual image quality assessment and out-of-distribution classification. The applications are chosen to validate the effectiveness of gradients as features when the test image distribution is distorted from the train image distribution. In both applications, the proposed gradient based features outperform activation features. In image quality assessment, the proposed approach is compared with other state of the art approaches and is generally the top performing method on TID 2013 and MULTI-LIVE databases in terms of accuracy, consistency, linearity, and monotonic behavior. Finally, we analyze the effect of regularization on gradients using CURE-TSR dataset for out-of-distribution classification. Copyright © 2019, The Authors. All rights reserved.

关键词： Classification (of information)

Object recognition under multifarious conditions: A reliability analysis and a feature similarity-based performance estimation

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Temel, Dogancan Lee, Jinsol AlRegib, Ghassan Center for Signal and Information Processing School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332-0250 United States

In this paper, we investigate the reliability of online recognition platforms, Amazon Rekognition and Microsoft Azure, with respect to changes in background, acquisition device, and object orientation. We focus on platforms that are commonly used by the public to better understand their real-world performances. To assess the variation in recognition performance, we perform a controlled experiment by changing the acquisition conditions one at a time. We use three smartphones, one DSLR, and one webcam to capture side views and overhead views of objects in a living room, an office, and photo studio setups. Moreover, we introduce a framework to estimate the recognition performance with respect to backgrounds and orientations. In this framework, we utilize both handcrafted features based on color, texture, and shape characteristics and data-driven features obtained from deep neural networks. Experimental results show that deep learningbased image representations can estimate the recognition performance variation with a Spearman's rank-order correlation of 0.94 under multifarious acquisition conditions. Copyright © 2019, The Authors. All rights reserved.

关键词： Reliability analysis

Semantically interpretable and controllable filter sets

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Prabhushankar, Mohit Kwon, Gukyeong Temel, Dogancan AlRegib, Ghassan Center for Signal and Information Processing School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332-0250 United States

In this paper, we generate and control semantically interpretable filters that are directly learned from natural images in an unsupervised fashion. Each semantic filter learns a visually interpretable local structure in conjunction with other filters. The significance of learning these interpretable filter sets is demonstrated on two contrasting applications. The first application is image recognition under progressive decolorization, in which recognition algorithms should be color-insensitive to achieve a robust performance. The second application is image quality assessment where objective methods should be sensitive to color degradations. In the proposed work, the sensitivity and lack thereof are controlled by weighing the semantic filters based on the local structures they represent. To validate the proposed approach, we utilize the CURE-TSR dataset for image recognition and the TID 2013 dataset for image quality assessment. We show that the proposed semantic filter set achieves state-of-The-Art performances in both datasets while maintaining its robustness across progressive distortions. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

Implicit background estimation for semantic segmentation

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lehman, Charles Temel, Dogancan AlRegib, Ghassan Center for Signal and Information Processing School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332-0250 United States

Scene understanding and semantic segmentation are at the core of many computer vision tasks, many of which, involve interacting with humans in potentially dangerous ways. It is therefore paramount that techniques for principled design of robust models be developed. In this paper, we provide analytic and empirical evidence that correcting potentially errant non-distinct mappings that result from the softmax function can result in improving robustness characteristics on a state-of-the-art semantic segmentation model with minimal impact to performance and minimal changes to the code base. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

A Level Set Approach to Online Sensing and Trajectory Optimization with Time Delays ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2019年第8期52卷 301-306页

作者： Matthew R. Kirchner Image and Signal Processing Branch Research Directorate Naval Air Warfare Center Weapons Division China Lake CA 93555 USA Electrical and Computer Engineering Department University of California Santa Barbara CA 93106 USA

Presented is a method to compute certain classes of Hamilton-Jacobi equations that result from optimal control and trajectory generation problems with time delays. Many robotic control and trajectory problems have limited information of the operating environment a priori and must continually perform online trajectory optimization in real time after collecting measurements. The sensing and optimization can induce a significant time delay, and must be accounted for when computing the trajectory. This paper utilizes the generalized Hopf formula, which avoids the exponential dimensional scaling typical of other numerical methods for computing solutions to the Hamilton-Jacobi equation. We present as an example a robot that incrementally predicts a communication channel from measurements as it travels. As part of this example, we introduce a seemingly new generalization of a non-parametric formulation of robotic communication channel estimation. New communication measurements are used to improve the channel estimate and online trajectory optimization with time-delay compensation is performed.

关键词： Time Delay Systems Hamilton-Jacobi Equation Generalized Hopf Formula Viscosity Solution Optimal Control Communication Seeking Robotics

image Captioning with Sparse Recurrent Neural Network

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Tan, Jia Huei Chan, Chee Seng Chuah, Joon Huang Center of Image and Signal Processing Faculty of Computer Science and Technology University of Malaya Kuala Lumpur50603 Malaysia Department of Electrical Engineering Faculty of Engineering University of Malaya Kuala Lumpur50603 Malaysia

Recurrent Neural Network (RNN) has been widely used to tackle a wide variety of language generation problems and are capable of attaining state-of-the-art (SOTA) performance. However despite its impressive results, the large number of parameters in the RNN model makes deployment in mobile and embedded devices infeasible. Driven by this problem, many works have proposed a number of pruning methods to reduce the sizes of the RNN model. In this work, we propose an end-to-end pruning method for image captioning models equipped with visual attention. Our proposed method is able to achieve sparsity levels up to 97.5% without significant performance loss relative to the baseline (∼ 2% loss at 40× compression after fine-tuning). Our method is also simple to use and tune, facilitating faster development times for neural network practitioners. We perform extensive experiments on the popular MS-COCO dataset in order to empirically validate the efficacy of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Recurrent neural networks