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

I-BALLAST: computer vision solutions for ballast degradation analysis using deep-learning and data fusion methods

学校读者我要写书评

暂无评论

Geodata and AI

Geodata and AI 2024年 1卷

作者： Kelin Ding Jiayi Luo Haohang Huang John M. Hart Issam I.A. Qamhia Erol Tutumluer Hugh Thompson Theodore R. Sussmann University of Illinois Urbana-Champaign Department of Civil and Environmental Engineering 205 North Mathews Urbana IL 61801 USA Computer Vision and Robotics Laboratory University of Illinois Urbana-Champaign Coordinated Science Laboratory 1308 West Main Street Urbana Illinois 61801 USA Federal Railroad Administration 1200 New Jersey Avenue SE Washington DC 20590 USA U.S. DOT Volpe Center Structures and Dynamics 55 Broadway Cambridge MA 02142 USA

Ballast plays a significant role in supporting tracks under repeated loading. Ballast Scanning Vehicle (BSV) is an automated platform recently developed to acquire high-quality data to assist with ballast inspection and detailed geotechnical analyses using computer vision technology. To process the image data collected by the BSV, this paper introduces an advanced image analysis software for ballast, i.e., I-BALLAST. I-BALLAST encompasses advanced data fusion techniques that integrate multiple data sources, thus producing more consistent, accurate, and comprehensive information. Field data collected by multiple image acquisition devices and other sensors like Global Positioning System (GPS) can be combined for conducting comprehensive analyses, such as segmented particle point clouds generation and varying-window-based Particle Size Distribution (PSD) and Fouling Index (FI) analyses along track sections with aligned GPS coordinates. I-BALLAST has been tested in multiple field inspections, proving it an efficient and innovative tool for ballast fouling condition evaluations.

关键词： Ballast degradation Railroad Field inspection computer vision Deep learning Data fusion

Fast perception, planning, and execution for a robotic butler: Wheeled humanoid m-hubo

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Lee, Moonyoung Heo, Yujin Park, Jinyong Yang, Hyun-Dae Jang, Ho-Deok Benz, Philipp Park, Hyunsub Kweon, In So Oh, Jun-Ho Humanoid Robot Research Center Department of Mechanical Engineering Korea Advanced Institute of Science and Technology 291 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of Robotics and Computer Vision Laboratory Department of Electrical Engineering Korea Advanced Institute of Science and Technology 291 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of

As the aging population grows at a rapid rate, there is an ever growing need for service robot platforms that can provide daily assistance at practical speed with reliable performance. In order to assist with daily tasks such as fetching a beverage, a service robot must be able to perceive its environment and generate corresponding motion trajectories. This becomes a challenging and computationally complex problem when the environment is unknown and thus the path planner must sample numerous trajectories that often are sub-optimal, extending the execution time. To address this issue, we propose a unique strategy of integrating a 3D object detection pipeline with a kinematically optimal manipulation planner to significantly increase speed performance at runtime. In addition, we develop a new robotic butler system for a wheeled humanoid that is capable of fetching requested objects at 24% of the speed a human needs to fulfill the same task. The proposed system was evaluated and demonstrated in a real-world environment setup as well as in public exhibition. Copyright © 2020, The Authors. All rights reserved.

关键词： Mobile robots

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

Why is the winner the best?

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Eisenmann, M. Reinke, A. Weru, V. Tizabi, M.D. Isensee, F. Adler, T.J. Ali, S. Andrearczyk, V. Aubreville, M. Baid, U. Bakas, S. Balu, N. Bano, S. Bernal, J. Bodenstedt, S. Casella, A. Cheplygina, V. Daum, M. de Bruijne, M. Depeursinge, A. Dorent, R. Egger, J. Ellis, D.G. Engelhardt, S. Ganz, M. Ghatwary, N. Girard, G. Godau, P. Gupta, A. Hansen, L. Harada, K. Heinrich, M. Heller, N. Hering, A. Huaulmé, A. Jannin, P. Kavur, A.E. Kodym, O. Kozubek, M. Li, J. Li, H. Ma, J. Martín-Isla, C. Menze, B. Noble, A. Oreiller, V. Padoy, N. Pati, S. Payette, K. Rädsch, T. Rafael-Patiño, J. Bawa, V. Singh Speidel, S. Sudre, C.H. van Wijnen, K. Wagner, M. Wei, D. Yamlahi, A. Yap, M.H. Yuan, C. Zenk, M. Zia, A. Zimmerer, D. Aydogan, D. Bhattarai, B. Bloch, L. Brüngel, R. Cho, J. Choi, C. Dou, Q. Ezhov, I. Friedrich, C.M. Fuller, C. Gaire, R.R. Galdran, A. Faura, Á. García Grammatikopoulou, M. Hong, S. Jahanifar, M. Jang, I. Kadkhodamohammadi, A. Kang, I. Kofler, F. Kondo, S. Kuijf, H. Li, M. Luu, M. Martinčič, T. Morais, P. Naser, M.A. Oliveira, B. Owen, D. Pang, S. Park, J. Park, S. Plotka, S. Puybareau, E. Rajpoot, N. Ryu, K. Saeed, N. Shephard, A. Shi, P. Štepec, D. Subedi, R. Tochon, G. Torres, H.R. Urien, H. Vilaça, J.L. Wahid, K.A. Wang, H. Wang, J. Wang, L. Wang, X. Wiestler, B. Wodzinski, M. Xia, F. Xie, J. Xiong, Z. Yang, S. Yang, Y. Zhao, Z. Maier-Hein, K. Jäger, P.F. Kopp-Schneider, A. Maier-Hein, L. Heidelberg Germany Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Germany Heidelberg Germany School of Computing Faculty of Engineering and Physical Sciences University of Leeds Leeds United Kingdom Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Radiology University of Washington SeattleWA United States Department of Computer Science University College London London United Kingdom Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Biomedical Imaging Group Rotterdam Department of Radiology and Nuclear Medicine Erasmus MC Rotterdam Netherlands Department of Computer Science University of Copenhagen Copenhagen Denmark Sierre Switzerland Harvard Medical School Brigham and Women’s Hospital BostonMA United States School of Biomedical Engineering and Imaging Sciences King’s College London London United Kingdom Essen Germany University of Nebraska Medical Center OmahaNE United States Department of Internal Medicine III Heidelberg University Hospital Heidelberg Germany Neurobiology Research Unit Copenhagen University Hospital Rigshospitalet C

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and postprocessing (66%). The "typical" lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work. © 2023, CC BY.

关键词： Benchmarking

Robust lane marking detection algorithm using drivable area segmentation and extended SLT

学校读者我要写书评

暂无评论

Robust lane marking detection algorithm using drivable area ...

2019 IEEE International Conference on robotics and Biomimetics, ROBIO 2019

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

ISBN: (纸本)9781728163215

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. © 2019 IEEE.

关键词： Hough transforms

Challenges and Outlook in Robotic Manipulation of Deformable Objects

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhu, Jihong Cherubini, Andrea Dune, Claire Navarro-Alarcon, David Alambeigi, Farshid Berenson, Dmitry Ficuciello, Fanny Harada, Kensuke Kober, Jens Li, Xiang Pan, Jia Yuan, Wenzhen Gienger, Michael Cognitive Robotics TU Delft Honda Research Institute Europe Netherlands LIRMM Université de Montpellier CNRS 161 Rue Ada Montpellier34090 France COSMER Laboratory EA 7398 Universié de Toulon La Garde83130 France The Hong Kong Polytechnic University Department of Mechanical Engineering Kowloon Hong Kong The University of Texas at Austin Austin United States The University of Michigan Ann ArborMI United States Università degli Studi di Napoli Federico II Napoli80125 Italy The Osaka University Japan The National Institute of AIST Japan Cognitive Robotics TU Delft Netherlands Department of Automation Tsinghua University Beijing China The Department of Computer Science The University of Hong Kong Pok Fu Lam Hong Kong Robotics Institute Carnegie Mellon University PittsburghPA15213 United States Honda Research Institute Europe Offenbach Germany

Deformable object manipulation (DOM) is an emerging research problem in robotics. The ability to manipulate deformable objects endows robots with higher autonomy and promises new applications in the industrial, services, and healthcare sectors. However, compared to rigid object manipulation, the manipulation of deformable objects is considerably more complex, and is still an open research problem. Addressing DOM challenges demand breakthroughs in almost all aspects of robotics, namely hardware design, sensing, (deformation) modeling, planning, and control. In this article, we review recent advances and highlight the main challenges when considering deformation in each sub-field. A particular focus of our paper lies in the discussions of these challenges and proposing future directions of research. © 2021, CC BY.

关键词： Deformation

Novel Smart N95 Filtering Facepiece Respirator with Real-time Adaptive Fit Functionality and Wireless Humidity Monitoring for Enhanced Wearable Comfort

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kwon, Kangkyu Lee, Yoon Jae Jung, Yeongju Soltis, Ira Choi, Chanyeong Na, Yewon Romero, Lissette Kim, Myung Chul Rodeheaver, Nathan Kim, Hodam Lloyd, Michael S. Zhuang, Ziqing King, William Xu, Susan Ko, Seung-Hwan Lee, Jinwoo Yeo, Woon-Hong School of Electrical and Computer Engineering College of Engineering Georgia Institute of Technology AtlantaGA30332 United States Center for Human-Centric Interfaces and Nanoengineering Institute for Electronics and Nanotechnology Georgia Institute of Technology AtlantaGA30332 United States Applied Nano and Thermal Science Lab Department of Mechanical Engineering Seoul National University 1 Gwanak-ro Gwanak-gu Seoul08826 Korea Republic of George W. Woodruff School of Mechanical Engineering Georgia Institute of Technology AtlantaGA30332 United States School of Industrial Design Georgia Institute of Technology AtlantaGA30332 United States Division of Cardiology Emory University School of Medicine AtlantaGA30322 United States National Institute for Occupational Safety and Health National Personal Protective Technology Laboratory PittsburghPA15236 United States Seoul National University Gwanak-ro Gwanak-gu Seoul08826 Korea Republic of Department of Mechanical Robotics and Energy Engineering Dongguk University 30 Pildongro 1-gil Jung-gu Seoul04620 Korea Republic of Wallace H. Coulter Department of Biomedical Engineering Parker H. Petit Institute for Bioengineering and Biosciences Neural Engineering Center Institute for Materials Institute for Robotics and Intelligent Machines Georgia Institute of Technology AtlantaGA30332 United States

The widespread emergence of the COVID-19 pandemic has transformed our lifestyle, and facial respirators have become an essential part of daily life. Nevertheless, the current respirators possess several limitations such as poor respirator fit because they are incapable of covering diverse human facial sizes and shapes, potentially diminishing the effect of wearing respirators. In addition, the current facial respirators do not inform the user of the air quality within the smart facepiece respirator in case of continuous long-term use. Here, we demonstrate the novel smart N-95 filtering facepiece respirator that incorporates the humidity sensor and pressure sensory feedback-enabled self-fit adjusting functionality for the effective performance of the facial respirator to prevent the transmission of airborne pathogens. The laser-induced graphene (LIG) constitutes the humidity sensor, and the pressure sensor array based on the dielectric elastomeric sponge monitors the respirator contact on the user’s face, providing the sensory information for a closed-loop feedback mechanism. As a result of the self-fit adjusting mode along with elastomeric lining, the fit factor is increased by 3.20 and 5 times at average and maximum respectively. We expect that the experimental proof-of-concept of this work will offer viable solutions to the current commercial respirators to address the *** Codes 92C55 Copyright © 2023, The Authors. All rights reserved.

关键词： Graphene

Spherical interpolated convolutional network with distance-feature density for 3D semantic segmentation of point clouds

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Guangming Yang, Yehui Zhang, Huixin Liu, Zhe Wang, Hesheng Department of Automation Insititue of Medical Robotics Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Jiao Tong University Shanghai200240 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology China Department of Computer Science and Technology University of Cambridge United Kingdom

The semantic segmentation of point clouds is an important part of the environment perception for robots. However, it is difficult to directly adopt the traditional 3D convolution kernel to extract features from raw 3D point clouds because of the unstructured property of point clouds. In this paper, a spherical interpolated convolution operator is proposed to replace the traditional grid-shaped 3D convolution operator. This newly proposed feature extraction operator improves the accuracy of the network and reduces the parameters of the network. In addition, this paper analyzes the defect of point cloud interpolation methods based on the distance as the interpolation weight and proposes the self-learned distance-feature density by combining the distance and the feature correlation. The proposed method makes the feature extraction of spherical interpolated convolution network more rational and effective. The effectiveness of the proposed network is demonstrated on the 3D semantic segmentation task of point clouds. Experiments show that the proposed method achieves good performance on the ScanNet dataset and Paris-Lille-3D dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Semantic Segmentation

Asymmetric CNN for image super-resolution

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Tian, Chunwei Xu, Yong Zuo, Wangmeng Lin, Chia-Wen Zhang, David The Bio-Computing Research Center Harbin Institute of Technology ShenzhenShenzhenGuangdong518055 China Shenzhen Key Laboratory of Visual Object Detection and Recognition ShenzhenGuangdong518055 China The School of Computer Science and Technology Harbin Institute of Technology HarbinHeilongjiang150001 China The Peng Cheng Laboratory ShenzhenGuangdong518055 China Shenzhen Key Laboratory of Visual Object Detection and Recognition Shenzhen Guangdong518055 China The Department of Electrical Engineering The Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan ShenzhenGuangdong518172 China The Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

Deep convolutional neural networks (CNNs) have been widely applied for low-level vision over the past five years. According to nature of different applications, designing appropriate CNN architectures is developed. However, customized architectures gather different features via treating all pixel points as equal to improve the performance of given application, which ignores the effects of local power pixel points and results in low training efficiency. In this paper, we propose an asymmetric CNN (ACNet) comprising an asymmetric block (AB), a memory enhancement block (MEB) and a high-frequency feature enhancement block (HFFEB) for image super-resolution. The AB utilizes one-dimensional asymmetric convolutions to intensify the square convolution kernels in horizontal and vertical directions for promoting the influences of local salient features for SISR. The MEB fuses all hierarchical low-frequency features from the AB via residual learning (RL) technique to resolve the long-term dependency problem and transforms obtained low-frequency features into high-frequency features. The HFFEB exploits low- and high-frequency features to obtain more robust super-resolution features and address excessive feature enhancement problem. Additionally, it also takes charge of reconstructing a high-resolution (HR) image. Extensive experiments show that our ACNet can effectively address single image super-resolution (SISR), blind SISR and blind SISR of blind noise problems. The code of the ACNet is shown at https://***/hellloxiaotian/ACNet. © 2021, CC BY-NC-ND.

关键词： Image enhancement