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

arXiv 2022年

作者： Maier-Hein, Lena Reinke, Annika Godau, Patrick Tizabi, Minu D. Buettner, Florian Christodoulou, Evangelia Glocker, Ben Isensee, Fabian Kleesiek, Jens Kozubek, Michal Reyes, Mauricio Riegler, Michael A. Wiesenfarth, Manuel Emre Kavur, A. Sudre, Carole H. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Rädsch, Tim Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Jorge Cardoso, M. Cheplygina, Veronika Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian Ginneken, Bram Van Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kofler, Florian Kopp-Schneider, Annette Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rajpoot, Nasir Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Smeden, Maarten Van Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. Calster, Ben Van Varoquaux, Gaël Jäger, Paul F. Heidelberg Division of Intelligent Medical Systems and HI Helmholtz Imaging Germany Faculty of Mathematics and Computer Science and Medical Faculty Heidelberg University Heidelberg Germany NCT Heidelberg a partnership between DKFZ University Medical Center Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt-Marburg Germany Heidelberg Goethe University Frankfurt Germany Department of Medicine Goethe University Frankfurt Germany Department of Informatics Frankfurt Cancer Insititute Germany Department of Computing Imperial College London London United Kingdom Heidelberg Division of Medical Image Computing and HI Applied Computer Vision Lab Germany Institute for AI in Medicine University Medicine Essen Essen Germany Centre for Biomedical Image Analysis Faculty of Informatics Masaryk University Brno Czech Republic ARTORG Center for Biomedical Engineering Research University of Bern Bern Switzerland Department of Radiation Oncology University Hospital Bern University of Bern Bern Switzerland Simula Metropolitan Center for Digital Engineering Oslo Norway UiT The Arctic University of Norway Romsø Norway Heidelberg Division of Biostatistics Germany Heidelberg Division of Intelligent Medical Systems Division of Medical Image Computing HI Applied Computer Vision Lab Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Heidelberg Division of Medical Image Computing Germany Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montréal

Increasing evidence shows that flaws in machine learning (ML) algorithm validation are an underestimated global problem. Particularly in automatic biomedical image analysis, chosen performance metrics often do not reflect the domain interest, thus failing to adequately measure scientific progress and hindering translation of ML techniques into practice. To overcome this, we created Metrics Reloaded, a comprehensive framework guiding researchers in the problem-aware selection of metrics. It was developed by a large international consortium in a multi-stage Delphi process and is based on the novel concept of a problem fingerprint – a structured representation of the given problem that captures all aspects that are relevant for metric selection, from the domain interest to the properties of the target structure(s), data set and algorithm output. Based on the problem fingerprint, users are guided through the process of choosing and applying appropriate validation metrics while being made aware of potential pitfalls. Metrics Reloaded targets image analysis problems that can be interpreted as a classification task at image, object or pixel level, namely image-level classification, object detection, semantic segmentation, and instance segmentation tasks. To improve the user experience, we implemented the framework in the Metrics Reloaded online tool. Following the convergence of ML methodology across application domains, Metrics Reloaded fosters the convergence of validation methodology. Its applicability is demonstrated for various biomedical use cases. © 2022, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Online multi-object tracking and segmentation with GMPHD filter and mask-based affinity fusion

arXiv

引用

arXiv 2020年

作者： Song, Young-Min Yoon, Young-Chul Yoon, Kwangjin Jeon, Moongu Lee, Seong-Whan Pedrycz, Witold The School of Electrical Engineering and Computer Science Gwangju Institute of Technology Gwangju61005 Korea Republic of The Robotics Laboratory Hyundai Motor Company Gyeonggi-do 16082 Korea Republic of SI Analytics Co. Ltd. Daejeon34051 Korea Republic of The Department of Artificial Intelligence Korea University Seoul02841 Korea Republic of The Department of Brain and Cognitive Engineering Korea University Seoul02841 Korea Republic of The Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2H5 Canada The Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia The Systems Research Institute Polish Academy of Sciences Warsaw01-447 Poland

In this paper, we propose a highly practical fully online multi-object tracking and segmentation (MOTS) method that uses instance segmentation results as an input. The proposed method is based on the Gaussian mixture probability hypothesis density (GMPHD) filter, a hierarchical data association (HDA), and a mask-based affinity fusion (MAF) model to achieve high-performance online tracking. The HDA consists of two associations: segment-to-track and track-to-track associations. One affinity, for position and motion, is computed by using the GMPHD filter, and the other affinity, for appearance is computed by using the responses from a single object tracker such as a kernalized correlation filter. These two affinities are simply fused by using a score-level fusion method such as min-max normalization referred to as MAF. In addition, to reduce the number of false positive segments, we adopt mask IoU-based merging (mask merging). The proposed MOTS framework with the key modules: HDA, MAF, and mask merging, is easily extensible to simultaneously track multiple types of objects with CPU-only execution in parallel processing. In addition, the developed framework only requires simple parameter tuning unlike many existing MOTS methods that need intensive hyperparameter optimization. In the experiments on the two popular MOTS datasets, the key modules show some improvements. For instance, ID-switch decreases by more than half compared to a baseline method in the training sets. In conclusion, our tracker achieves state-of-the-art MOTS performance in the test sets. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Encoding Space to Count Multi-Targets with Multiplexed Binary Infrared Sensors

Encoding Space to Count Multi-Targets with Multiplexed Binar...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Longxiang Luo Yang Xiao Wei Liang Key Laboratory of Networked Control System Shenyang Institute of Automation Chinese Academy of Sciences Shenyang State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang China University of Chinese Academy of Sciences Beijing China Department of Computer Science The University of Alabama Tuscaloosa AL USA

ISBN: (数字)9781728152127

ISBN: (纸本)9781728152134

Recently, many researchers multiplex binary infrared sensors in object tracking, habitat monitoring, and atypical behavior detection. Due to the binary digit output of binary sensors, multiplex binary sensors may lead to count the wrong number of targets when three or more targets present in the field of interest (FOI). We call this as the invisible targets' problem. To enhance the sensing results of sensors, a reference structure tomography technique is used to segment and code the FOI by modulating the sensing view of sensors. In this paper, we propose a subregion coding method to count targets moving in the FOI. Hexagon modulators are designed to make their projections segment the FOI into hexagon cells. We also propose a signature construct scheme to code cells and a encoder to count the number of targets in the FOI. Experiment results show that the accuracy to correctly count targets of our method is around 90% which is much better than 45% of a conventional method.

关键词： Modulation Monitoring Shape Sensor systems Encoding Intelligent sensors

来源：评论

学校读者我要写书评

暂无评论

Robust Lane Marking Detection Algorithm Using Drivable Area Segmentation and Extended SLT

Robust Lane Marking Detection Algorithm Using Drivable Area ...

引用

IEEE International Conference on robotics and Biomimetics

作者： Umar Ozgunalp Rui Fan Shanshan Cheng Yuxiang Sun Weixun Zuo Yilong Zhu Bohuan Xue Linwei Zheng Qing Liang Ming Liu Electrical and Electronics Engineering Cyprus International University North Cyprus Turkey Department of Electronic and Computer Engineering the Hong Kong University of Science and Technology Hong Kong SAR China Guolu Gaoke Engineering Technology Institute Co. Ltd. Beijing China Robotics and Multiperception Laboratory Robotics Institute the Hong Kong University of Science and Technology Hong Kong SAR China

In this paper, a robust lane detection algorithm is proposed, where the vertical road profile of the road is estimated using dynamic programming from the v-disparity map and, based on the estimated profile, the road area is segmented. Since the lane markings are on the road area and any feature point above the ground will be a noise source for the lane detection, a mask is created for the road area to remove some of the noise for lane detection. The estimated mask is multiplied by the lane feature map in a bird's eye view (BEV). The lane feature points are extracted by using an extended version of symmetrical local threshold (SLT), which not only considers dark light dark transition (DLD) of the lane markings, like (SLT), but also considers parallelism on the lane marking borders. The segmentation then uses only the feature points that are on the road area. A maximum of two linear lane markings are detected using an efficient 1D Hough transform. Then, the detected linear lane markings are used to create a region of interest (ROI) for parabolic lane detection. Finally, based on the estimated region of interest, parabolic lane models are fitted using robust fitting. Due to the robust lane feature extraction and road area segmentation, the proposed algorithm robustly detects lane markings and achieves lane marking detection with an accuracy of 91% when tested on a sequence from the KITTI dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gaussian curvature filter on 3d mesh

arXiv

引用

arXiv 2020年

作者： Tang, Wenming Gong, Yuanhao Liu, Kanglin Liu, Jun Pan, Wei Liu, Bozhi Qiu, Guoping College of Information Engineering Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Mechanical & Automotive Engineering South China University of Technology Department of Research and Development OPT Machine Vision Tech Co. Ltd Jinsheng Road Changan Dongguan Guangdong523860 China School of Computer Science University of Nottingham NottinghamNG8 1BB United Kingdom

Minimizing Gaussian curvature of meshes is fundamentally important for obtaining smooth and developable surfaces. However, there is a lack of computationally efficient and robust Gaussian curvature optimization method. In this paper, we present a simple yet effective method that can efficiently reduce Gaussian curvature for 3D meshes. We first present the mathematical foundation of our method, which states that for any point on a developable surface there must be another point that lives on its tangent plane. Then, based on this theoretical insight, we introduce a simple and robust implicit Gaussian curvature optimization method named Gaussian Curvature Filter (GCF). GCF implicitly minimizes Gaussian curvature without the need to explicitly calculate the Gaussian curvature itself. GCF is highly efficient and is 20 times faster than the classical standard Gaussian curvature flow method. We present extensive experiments to demonstrate that GCF significantly outperforms state-of-the-art methods in minimizing Gaussian curvature, geometric feature preserving smoothing and mesh noise removal. This method can be used in a large range of applications that involve Gaussian curvature. Copyright © 2020, The Authors. All rights reserved.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Predictive Inverse Kinematics: optimizing Future Trajectory through Implicit Time Integration and Future Jacobian Estimation

Predictive Inverse Kinematics: optimizing Future Trajectory ...

引用

2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Ko Ayusawa Wael Suleiman Eiichi Yoshida CNRS-AIST JRL (Joint Robotics Laboratory) UMI13218/RL Intelligent Systems Research Institute National Institute of Advanced Industrial Science and Technology (IS-AIST) Japan Electrical and Computer Engineering Department Faculty of Engineering University of Sherbrooke Canada

This paper presents an inverse kinematics (IK) method which can control future velocities and accelerations for multi-body systems. The proposed IK method is formulated as a quadratic programing (QP) that optimizes future joint trajectories. The features of the proposed IK are: (1) the evaluation of accelerations at future time instances, (2) the trajectory representation that can implicitly integrate the time integral formula into QP, (3) the computation of future Jacobian matrices based on the comprehensive theory of differential kinematics proposed in our previous work. Those features enable a stable and fast IK computation while evaluating the future accelerations. We also conducted thorough numerical studies to show the efficiency of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning to infer the depth map of a hand from its color image

arXiv

引用

arXiv 2018年

作者： Nicodemou, Vassilis C. Oikonomidis, Iason Tzimiropoulos, Georgios Argyros, Antonis Computational Vision and Robotics Laboratory Institute of Computer Science FORTH Greece Computer Science Department University of Crete Greece Computer Vision Laboratory University of Nottingham United Kingdom

We propose the first approach to the problem of inferring the depth map of a human hand based on a single RGB image. We achieve this with a Convolutional Neural Network (CNN) that employs a stacked hourglass model as its main building block. Intermediate supervision is used in several outputs of the proposed architecture in a staged approach. To aid the process of training and inference, hand segmentation masks are also estimated in such an intermediate supervision step, and used to guide the subsequent depth estimation process. In order to train and evaluate the proposed method we compile and make publicly available HandRGBD, a new dataset of 20,601 views of hands, each consisting of an RGB image and an aligned depth map. Based on HandRGBD, we explore variants of the proposed approach in an ablative study and determine the best performing one. The results of an extensive experimental evaluation demonstrate that hand depth estimation from a single RGB frame can be achieved with an accuracy of 22mm, which is comparable to the accuracy achieved by contemporary low-cost depth cameras. Such a 3D reconstruction of hands based on RGB information is valuable as a final result on its own right, but also as an input to several other hand analysis and perception algorithms that require depth input. Essentially, in such a context, the proposed approach bridges the gap between RGB and RGBD, by making all existing RGBD-based methods applicable to RGB input. Copyright © 2018, The Authors. All rights reserved.

关键词： Bridge approaches

来源：评论

学校读者我要写书评

暂无评论

Variational autoencoded regression: High dimensional regression of visual data on complex manifold

arXiv

引用

arXiv 2019年

作者： Yoo, YoungJoon Yun, Sangdoo Chang, Hyung Jin Demiris, Yiannis Choi, Jin Young Graduate School of Convergence Science and Technology Seoul National University Korea Republic of ASRI Dept. of Electrical and Computer Eng. Seoul National University Korea Republic of Personal Robotics Laboratory Department of Electrical and Electronic Engineering Imperial College London United Kingdom

This paper proposes a new high dimensional regression method by merging Gaussian process regression into a variational autoencoder framework. In contrast to other regression methods, the proposed method focuses on the case where output responses are on a complex high dimensional manifold, such as images. Our contributions are summarized as follows: (i) A new regression method estimating high dimensional image responses, which is not handled by existing regression algorithms, is proposed. (ii) The proposed regression method introduces a strategy to learn the latent space as well as the encoder and decoder so that the result of the regressed response in the latent space coincide with the corresponding response in the data space. (iii) The proposed regression is embedded into a generative model, and the whole procedure is developed by the variational autoencoder framework. We demonstrate the robustness and effectiveness of our method through a number of experiments on various visual data regression problems. Copyright © 2019, The Authors. All rights reserved.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Variable population memetic search: A case study on the critical node problem

arXiv

引用

arXiv 2019年

作者： Zhou, Yangming Hao, Jin-Kao Fu, Zhang-Hua Wang, Zhe Lai, Xiangjing School of Information Science and Engineering East China University of Science and Technology 130 Meilong Road Shanghai200237 China Key Laboratory of Advanced Control and Optimization for Chemical Processes Ministry of Education Department of Computer Science LERIA Université d'Angers 2 Boulevard Lavoisier Angers49045 France Institut Universitaire de France 1 rue Descartes Paris75231 France Robotics Laboratory for Logistics Service Institute of Robotics and Intelligent Manufacturing Chinese University of Hong Kong Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518172 China Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing210023 China

Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems. Often, a population of fixed size was used in such algorithms to record some best solutions sampled during the search. However, given the particular features of the problem instance under consideration, a population of variable size would be more suitable to ensure the best search performance possible. In this work, we propose variable population memetic search (VPMS), where a strategic population sizing mechanism is used to dynamically adjust the population size during the memetic search process. Our VPMS approach starts its search from a small population of only two solutions to focus on exploitation, and then adapts the population size according to the search status to continuously influence the balancing between exploitation and exploration. We illustrate an application of the VPMS approach to solve the challenging critical node problem (CNP). We show that the VPMS algorithm integrating a variable population, an effective local optimization procedure (called diversified late acceptance search) and a backbone-based crossover operator performs very well compared to state-of-the-art CNP algorithms. The algorithm is able to discover new upper bounds for 13 instances out of the 42 popular benchmark instances, while matching 23 previous best-known upper bounds. Copyright © 2019, The Authors. All rights reserved.

关键词： Population statistics

来源：评论

学校读者我要写书评

暂无评论

Understanding Human Motion and Gestures for Underwater Human-Robot Collaboration

arXiv

引用

arXiv 2018年

作者： Islam, Md Jahidul Interactive Robotics and Vision Laboratory Department of Computer Science and Engineering University of Minnesota- Twin Cities United States

In this paper, we present a number of robust methodologies for an underwater robot to visually detect, follow, and interact with a diver for collaborative task execution. We design and develop two autonomous diver-following algorithms, the first of which utilizes both spatial- and frequency-domain features pertaining to human swimming patterns in order to visually track a diver. The second algorithm uses a convolutional neural network-based model for robust tracking-by-detection. In addition, we propose a hand gesture-based human-robot communication framework that is syntactically simpler and computationally more efficient than the existing grammar-based frameworks. In the proposed interaction framework, deep visual detectors are used to provide accurate hand gesture recognition;subsequently, a finite-state machine performs robust and efficient gesture-to-instruction mapping. The distinguishing feature of this framework is that it can be easily adopted by divers for communicating with underwater robots without using artificial markers or requiring memorization of complex language rules. Furthermore, we validate the performance and effectiveness of the proposed methodologies through extensive field experiments in closed- and open-water environments. Finally, we perform a user interaction study to demonstrate the usability benefits of our proposed interaction framework compared to existing methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：