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

17th International Symposium on Combinatorial Search, SoCS 2024

作者： Zhang, Yulun Fontaine, Matthew C. Bhatt, Varun Nikolaidis, Stefanos Li, Jiaoyang Robotics Institute Carnegie Mellon University United States Thomas Lord Department of Computer Science University of Southern California United States

ISBN: (纸本)9781577358916

With the rapid progress in Multi-Agent Path Finding (MAPF), researchers have studied how MAPF algorithms can be deployed to coordinate hundreds of robots in large automated warehouses. While most works try to improve the throughput of such warehouses by developing better MAPF algorithms, we focus on improving the throughput by optimizing the warehouse layout. We show that, even with state-of-the-art MAPF algorithms, commonly used human-designed layouts can lead to congestion for warehouses with large numbers of robots and thus have limited scalability. We extend existing automatic scenario generation methods to optimize warehouse layouts. Results show that our optimized warehouse layouts (1) reduce traffic congestion and thus improve throughput, (2) improve the scalability of the automated warehouses by doubling the number of robots in some cases, and (3) are capable of generating layouts with user-specified diversity measures. We include the source code at: https://***/lunjohnzhang/warehouse_env_gen_public. © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Warehouses

来源：评论

学校读者我要写书评

暂无评论

Deep Prior Based Limited-Angle Tomography 27th

Deep Prior Based Limited-Angle Tomography

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Bappy, D.M. Kang, Donghwa Lee, Jinkyu Lee, Youngmoon Baek, Hyeongboo Department of Computer Science and Engineering Incheon National University Incheon Korea Republic of Department of Computer Science and Engineering Sungkyunkwan University Suwon Korea Republic of Department of Robotics Hanyang University Ansan Korea Republic of Department of Artificial Intelligence University of Seoul Seoul Korea Republic of

ISBN: (纸本)9783031781940

In the process of reconstructing images from data acquired within a limited angular range, we encounter what is termed limited-angle tomography. The deficiency of complete data in this context results in artifacts, commonly appearing as streaks or missing structures, which can significantly compromise the quality of the reconstructed slice. This degradation gives rise to issues such as boundary distortion, blurred edges, and intensity bias, potentially leading to misinterpretation of the images. Hence, addressing artifacts in limited-angle tomography is crucial for clinical applications. Although deep learning-based reconstruction has shown impressive results in recent times, concerns about its robustness persist. To bolster the robustness of our proposed technique, we integrate prior information from a modified U-net with preprocessed input into the Relative Variation - Simultaneous Algebraic Reconstruction Technique (RV-SART) to provide insights into unmeasured data. Subsequently, the method extracts structure from the initially reconstructed slice through structure-texture decomposition. This process facilitates the reconstruction of high-quality CT images while suppressing pattern-like artifacts. Extensive experiments demonstrate that our approach surpasses both traditional and state-of-the-art learning techniques in terms of reconstruction quality and preservation of fine structures in noisy limited-angle reconstruction problems. Our technique provides improvements over the recent LRIP-net for a 90-degree scanning range in quantitative metrics such as PSNR by 17.48%, RMSE by 46.36%, and SSIM by 6.18%. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Computational Approach for Automated Segmentation and Classification of Region of Interest in Lateral Breast Thermograms

引用

computers, Materials & Continua 2024年第9期80卷 4749-4765页

作者： Dennies Tsietso Abid Yahya Ravi Samikannu Basit Qureshi Muhammad Babar Department of Electrical Computer and Telecommunications EngineeringBotswana International University of Science and TechnologyPalapyePrivate Bag 16Botswana College of Computer and Information Sciences Prince Sultan UniversityRiyadh11586Saudi Arabia Robotics and Internet of Things Lab Prince Sultan UniversityRiyadh11586Saudi Arabia

Breast cancer is one of the major health issues with high mortality rates and a substantial impact on patients and healthcare systems *** computer-Aided Diagnosis(CAD)tools,based on breast thermograms,have been developed for early detection of this ***,accurately segmenting the Region of Interest(ROI)fromthermograms remains *** paper presents an approach that leverages image acquisition protocol parameters to identify the lateral breast region and estimate its bottomboundary using a second-degree *** proposed method demonstrated high efficacy,achieving an impressive Jaccard coefficient of 86%and a Dice index of 92%when evaluated against manually created ground *** features were extracted from each view’s ROI,with significant features selected via Mutual Information for training Multi-Layer Perceptron(MLP)and K-Nearest Neighbors(KNN)*** findings revealed that the MLP classifier outperformed the KNN,achieving an accuracy of 86%,a specificity of 100%,and an Area Under the Curve(AUC)of *** consistency of the method across both sides of the breast suggests its viability as an auto-segmentation ***,the classification results suggests that lateral views of breast thermograms harbor valuable features that can significantly aid in the early detection of breast cancer.

关键词： Breast cancer CAD machine learning ROI segmentation thermography

来源：评论

学校读者我要写书评

暂无评论

A Review of Deep Learning Techniques for Glaucoma Detection

引用

SN computer science 2023年第3期4卷 274页

作者： Guergueb, Takfarines Akhloufi, Moulay A. Perception Robotics and Intelligent Machines Research Group (PRIME) Computer Science Department Université de Moncton Moncton NB Canada

Glaucoma is one of the major reasons for visual impairment all across the globe. The recent advancements in machine learning techniques have greatly facilitated ophthalmologists in the early diagnosis of ocular diseases through the employment of automated systems. Several studies have been published lately to address the timely detection of glaucoma using deep learning approaches. A comprehensive review of the deep learning approaches employed for glaucoma detection using retinal fundus images is presented in this paper. The available retinal image datasets, image pre-processing techniques, state-of-the-art models, and performance evaluation metrics used in the recent studies are reviewed. This systematic review aims to provide critical insights and potential research directions to the ophthalmologists and researchers in this domain. © 2023, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： Deep learning Eye diseases Glaucoma Image processing Machine learning Ophthalmology Transfer learning

来源：评论

学校读者我要写书评

暂无评论

Advanced Endoscopy Imaging with Automatic Feedback 27th

Advanced Endoscopy Imaging with Automatic Feedback

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Bappy, D.M. Kang, Donghwa Lee, Jinkyu Lee, Youngmoon Koo, Minsuk Baek, Hyeongboo Department of Computer Science and Engineering Incheon National University Incheon Korea Republic of Department of Computer Science and Engineering Sungkyunkwan University Suwon Korea Republic of Department of Robotics Hanyang University Ansan Korea Republic of Department of Artificial Intelligence University of Seoul Seoul Korea Republic of

ISBN: (纸本)9783031781940

As we move towards a future where minimally invasive methods become the norm for surgeries and diagnostic procedures, it is increasingly vital to improve our strategies for viewing the organs and complex structures within our bodies. Image stitching presents an enticing solution, expanding our field of view by seamlessly weaving together a sequence of images. While existing stitching techniques do lean on the capabilities of endoscopy imaging, they, unfortunately, overlook the critical need for automated feedback when grappling with the complexities and challenges innate to endoscopy imaging. these methods struggle to stand firm against deformations and regions with low texture. In this paper, we introduce a robust endoscopic image-stitching algorithm designed to thrive in adversity. Its unique resilience to deformations and low-texture regions is reinforced by the inclusion of a radial basis function weighting that is paired harmoniously with location-dependent homography based on the corresponding locations of the strong features extracted by affine shape-adapted Hessian-Laplace detector. Crucially, this algorithm is steered by a sophisticated automatic feedback mechanism. This feedback system makes astute evaluations based on an image quality metric and the structural comparison between the sequences of endoscopy images. We have thoroughly validated the efficacy of our new approach using two public datasets, namely EndoSLAM and EndoAbS, under demanding conditions. The results eloquently illustrate the superior benefits of our technique. Our proposed method surpasses commonly employed techniques, delivering superior performance in quantitative metrics, including precision at 30.07%, recall at 114.89%, F1-score at 84.62%, and TRE at 46.07%. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

ViT-SENet-Tom: machine learning-based novel hybrid squeeze–excitation network and vision transformer framework for tomato fruits classification

引用

Neural Computing and Applications 2025年第9期37卷 6583-6600页

作者： Swapno, S M Masfequier Rahman Nobel, S. M. Nuruzzaman Islam, Md Babul Bhattacharya, Pronaya Mattar, Ebrahim A. Department of CSE Bangladesh University of Business and Technology Dhaka1216 Bangladesh Department of Computer Modeling Electronic and System Engineering UNICAL Rende Italy Department of Computer Science and Engineering Amity School of Engineering and Technology and Research and Innovation Cell Amity University West Bengal Kolkata India Robotics - Cybernetic College of Engineering University of Bahrain Manama Bahrain

Tomatoes are essential fruits in numerous nations for their vast demand. It is very important to maintain the freshness of tomatoes. One of the primary challenges in the recent culinary landscape is accurately identifying healthy tomatoes while effectively eliminating damaged or rejected ones. Existing approaches employ various strategies for categorizing tomato fruit, but they often suffer from inaccuracies, slow detection, and suboptimal performance. Thus, motivated by this gap, in this paper, we propose a novel machine learning (ML) framework, ViT-SENet-Tom, which is a hybrid vision transformer (ViT) model with squeeze and excitation (SENet) block network for fast, accurate, and efficient tomato fruit classification. The framework works on three tomato classes, respectively, the ripe, unripe, and reject. In developing the proposed model, we utilized advanced and newly designed layers and functions. This integration created a more complex and sophisticated neural network, significantly enhancing efficiency and contributing to the model’s novelty. Our chosen dataset was small initially, but we implemented augmentation techniques to increase its size. This approach made our system more reliable, efficient, and effective. The hybrid ViT-SENet framework employs encoders and self-attention networks with squeeze and excitation channel functions to allow precise, robust, fast, and efficient tomato classification. In simulation, the framework achieves a training accuracy of 99.87% and validation accuracy of 93.87%, indicating the precise classification of tomatoes. Besides, this work tests accuracy using fivefold cross-validation. The highest accuracy seen at fold-5 is 99.90%. These testing results demonstrate the efficacy of the proposed framework in real-deployment scenarios. The implementation has the potential to provide enhanced and more sustainable food security and safety in future. © The Author(s) 2025.

关键词： Fruits

来源：评论

学校读者我要写书评

暂无评论

Data Augmentation via Face Morphing for Recognizing Intensities of Facial Emotions

引用

IEEE Transactions on Affective Computing 2023年第2期14卷 1228-1235页

作者： Huang, Tsung-Ren Hsu, Shin-Min Fu, Li-Chen National Taiwan University Department of Psychology Center for Artificial Intelligence & Advanced Robotics Taipei106319 Taiwan National Taiwan University Center for Artificial Intelligence & Advanced Robotics Department of Electrical Engineering Department of Computer Science and Information Engineering Taipei106319 Taiwan

Being able to recognize emotional intensity is a desirable feature for a facial emotional recognition (FER) system. However, the development of such a feature is hindered by the paucity of intensity-labeled data for model training. To ameliorate the situation, the present study proposes using face morphing as a novel way of data augmentation to synthesize faces that express different degrees of a designated emotion. Such an approach has been successfully validated on humans and machines. Specifically, humans indeed perceived different levels of intensified emotions in these parametrically synthesized faces, and FER systems based on neural networks indeed showed improved sensitivities to intensities of different emotions when additionally trained on the synthesized faces. Overall, the proposed data augmentation method is not only simple and effective but also useful for building FER systems that recognize facial expressions of mixed emotions. © 2010-2012 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Feature Learning for Cross-Project Software Defect Prediction

引用

computers, Materials & Continua 2023年第10期77卷 161-180页

作者： Ahmed Abdu Zhengjun Zhai Hakim A.Abdo Redhwan Algabri Sungon Lee School of Software Northwestern Polytechnical UniversityXi’anChina School of Computer Science Northwestern Polytechnical UniversityXi’anChina Department of Computer Science Hodeidah UniversityPO Box 3114Al-HudaydahYemen Research Institute of Engineering and Technology Hanyang UniversityAnsanKorea Department of Robotics Hanyang UniversityAnsanKorea

Cross-project software defect prediction(CPDP)aims to enhance defect prediction in target projects with limited or no historical data by leveraging information from related source *** existing CPDP approaches rely on static metrics or dynamic syntactic features,which have shown limited effectiveness in CPDP due to their inability to capture higher-level system properties,such as complex design patterns,relationships between multiple functions,and dependencies in different software projects,that are important for *** paper introduces a novel approach,a graph-based feature learning model for CPDP(GB-CPDP),that utilizes NetworkX to extract features and learn representations of program entities from control flow graphs(CFGs)and data dependency graphs(DDGs).These graphs capture the structural and data dependencies within the source *** proposed approach employs Node2Vec to transform CFGs and DDGs into numerical vectors and leverages Long Short-Term Memory(LSTM)networks to learn predictive *** process involves graph construction,feature learning through graph embedding and LSTM,and defect *** evaluation using nine open-source Java projects from the PROMISE dataset demonstrates that GB-CPDP outperforms state-of-the-art CPDP methods in terms of F1-measure and Area Under the Curve(AUC).The results showcase the effectiveness of GB-CPDP in improving the performance of cross-project defect prediction.

关键词： Cross-project defect prediction graphs features deep learning graph embedding

来源：评论

学校读者我要写书评

暂无评论

引用

33rd ACM Web Conference, WWW 2024

作者： Ma, Changyi Yu, Runsheng Zhang, Youzhi Centre for Artificial Intelligence and Robotics Hong Kong Institute of Science and Innovation CAS Hong Kong Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798400701719

The similarity matrix is at the core of similarity search problems. However, incomplete observations are ubiquitous in real scenarios leading to a less accurate similarity matrix. To alleviate this problem, in this paper, based on the key insight that the similarity matrix enjoys both the symmetric and positive semi-definiteness (PSD) properties, we propose a novel similarity matrix calibration method, which is scalable, effective, and sound. Specifically, we establish the PSD property as a constraint for the similarity matrix calibration problem and propose a novel similarity matrix calibration method to estimate the similarity matrix, which approximates the unknown complete ground-truth similarity matrix. To enable a fast optimization process, we further develop a general approximated algorithm that bypasses the computation of singular values. Theoretical analysis ensures stable calibration performance and convergence speed. Extensive experiments of similarity matrix calibration on real-world datasets demonstrate that our proposed method outperforms baseline methods in terms of both accuracy and speed. © 2024 ACM.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Improving Sharpness-Aware Minimization by Lookahead 41

Improving Sharpness-Aware Minimization by Lookahead

引用

41st International Conference on Machine Learning, ICML 2024

作者： Yu, Runsheng Zhang, Youzhi Kwok, James T. Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Centre for Artificial Intelligence and Robotics Hong Kong Institute of Science & Innovation CAS Hong Kong

Sharpness-Aware Minimization (SAM), which performs gradient descent on adversarially perturbed weights, can improve generalization by identifying flatter minima. However, recent studies have shown that SAM may suffer from convergence instability and oscillate around saddle points, resulting in slow convergence and inferior performance. To address this problem, we propose the use of a lookahead mechanism to gather more information about the landscape by looking further ahead, and thus find a better trajectory to converge. By examining the nature of SAM, we simplify the extrapolation procedure, resulting in a more efficient algorithm. Theoretical results show that the proposed method converges to a stationary point and is less prone to saddle points. Experiments on standard benchmark datasets also verify that the proposed method outperforms the SOTAs, and converge more effectively to flat minima. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：