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

2nd International Conference on Advanced Innovations in Smart Cities, ICAISC 2025

作者： Saleh, Taj Ergin, Fatma Corut Malkawi, Malek Alhajj, Reda Department of Computer Engineering Marmara University Istanbul Turkey Department of Computer Engineering Istanbul Medipol University Istanbul Turkey Department of Computer Science University of Calgary Alberta Canada Department of Heath Informatics University of Southern Denmark Odense Denmark

ISBN: (纸本)9798331506995

String search algorithms play an important role in many research areas such as data mining and bioinformatics. While there exist a number of algorithms that handles the topic, we are exploring the the Knuth-Morris-Pratt (KMP) and Boyer-Moore algorithms due to their efficiency and versatility. In this work, we compared the algorithms in terms of characteristics, performance and implementation details. We also tested both the algorithms with various patterns and texts that differs in size. We also analyzed the performance of the algorithms on 4 different processors to understand the technological advancements effects on their performance. Our findings suggest that the BM algorithm perform better with large texts and patterns, while the KMP algorithm is better suited for smaller ones. Also, while newer processor generally exhibit improved performance, the significance of these enhancements may vary. Thus, we should rather be looking specific architectural advancements within generations rather than focusing solely on the generational gap. © 2025 IEEE.

关键词： String searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Leveraging SAM for Automatic Prostate Segmentation on Micro-Ultrasound Images

Leveraging SAM for Automatic Prostate Segmentation on Micro-...

引用

Medical Imaging 2025: Ultrasonic Imaging and Tomography

作者： Radcliffe, Olivia Lawford-Wickham, Imogen A. Wilson, Paul F.R. Abolmaesumi, Purang Mousavi, Parvin Medical Informatics Laboratory School of Computing Queen's University Kingston Canada Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (纸本)9781510686021

PURPOSE: Deep learning is promising for enabling accurate and automatic prostate segmentation. Existing deep learning segmentation model approaches often rely on large training datasets for good generalization. We aim to adapt pre-trained foundation models to enable accurate, data-efficient, and robust prostate segmentation. METHODS: We adapt the promptable foundation model SAM1 for prostate segmentation on rotational micro-ultrasound scans2 of the prostate. We design novel prompting strategies to provide the model with enhanced 3D context awareness to improve segmentation. RESULTS: Our model, which we call SliceTrack-SAM, outperforms prior state-of-the-art in micro-ultrasound prostate segmentation. We achieve a Dice coefficient of 94.0% and Hausdorff distance 1.76 mm on the MicroSegNet dataset. Qualitative analysis and ablation studies further validate the success of our approach. CONCLUSION: Transfer learning from pre-trained foundation models can alleviate the challenge of data scarcity and improve the generalization of medical imaging deep learning systems. Prompts provide a flexible and effective way to leverage auxiliary information, such as 3D context, when using these models. © 2025 SPIE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Face image authentication scheme based on MTCNN and SLT

引用

Multimedia Tools and Applications 2025年 1-43页

作者： Thabit, Rasha Al-Askari, Mohanad A. Mohammed, Dunya Zeki Anaam, Elham Abdulwahab Mahmood, Zainab H. Jabbar, Dina Jamal Salih, Zahraa Aqeel Information System Department College of Computer Sciences and Information Technology University of Al-Anbar Al-Anbar Iraq Computer Engineering Department College of Engineering Al-Iraqia University Baghdad Iraq Electronic and Communications Engineering Department College of Engineering Gilgamesh University Baghdad Iraq Faculty of Computing and Informatics Multimedia University Selangor Cyberjaya Malaysia Department of Cybersecurity Engineering College of Information Engineering Al-Nahrain University Baghdad Iraq Electrical Engineering Technical Collage Middle Technical University Baghdad Iraq Department of Business Administration Alamaal University College Baghdad Iraq

DeepFakes and face image manipulation methods have been widely distributed in the last few years and several techniques have been presented to check the authenticity of the face image and detect manipulation if exists. Most of the available manipulation detection techniques have been successfully applied to reveal one type of manipulation under specific conditions, however, many limitations and challenges can be encountered in this field. To overcome some limitations and challenges, this paper presents a new face image authentication (FIA) scheme based on Multi-Task Cascaded Conventional Neural Networks (MTCNN) and watermarking in Slantlet transform (SLT) domain. The proposed FIA scheme has three main algorithms that are face detection and selection, embedding, and extraction algorithms. Different block sizes have been used to divide the image into non-overlapping blocks followed by classifying them into two groups that are blocks from face area (FA) and blocks from the remaining area (RA) of the image. In the embedding algorithms, the authentication information is generated from FA blocks and embedded in the RA blocks. In the extraction algorithms, the embedded information is extracted from RA blocks and compared with the calculated data from FA blocks to reveal manipulations and localize the manipulated blocks if exist. Extensive experiments have been conducted to evaluate the performance of the proposed FIA scheme for different face images. The experimental work included tests for payload, capacity, visual quality, time complexity, and localization of manipulations. The results proved the efficiency of the proposed scheme in detecting and localizing different face image manipulations such as attributes attacks, retouching attacks, expression swap, face swap, and morphing attacks. The proposed scheme overcomes many limitations and it is 100% accurate in localizing the tampered blocks which makes it a better candidate for practical applications. © The Author(s), un

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Evaluating Deep Learning Models for Breast Cancer Classification: A Comparative Study

Evaluating Deep Learning Models for Breast Cancer Classifica...

引用

Medical Imaging 2025: Digital and Computational Pathology

作者： Eskandari, Sania Eslamian, Ali Cheng, Qiang Department of Electrical and Computer Engineering University of Kentucky Lexington United States Department of Computer Science University of Kentucky Lexington United States Institute for Biomedical Informatics University of Kentucky Lexington United States

ISBN: (纸本)9781510686045

The classification of histopathological images is crucial for the early and precise detection of breast cancer. This study investigates the efficiency of deep learning models in distinguishing between Invasive Ductal Carcinoma (IDC) and non-IDC in histopathology slides. We conducted a thorough comparison examination of eight sophisticated models: ResNet-50, DenseNet-121, ResNeXt-50, Vision Transformer (ViT), GoogLeNet (Inception v3), EfficientNet, MobileNet, and SqueezeNet. This analysis was carried out using a large dataset of 277,524 image patches. Our research makes a substantial contribution to the field by offering a comprehensive assessment of the performance of each model. We particularly highlight the exceptional efficacy of attention-based mechanisms in the ViT model, which achieved a remarkable validation accuracy of 94%, surpassing conventional convolutional networks. This study highlights the promise of advanced machine learning approaches in clinical settings, offering improved precision as well as efficiency in breast cancer diagnosis. © 2025 SPIE.

关键词： Breast cancer Deep learning Tumor growth modeling Medical imaging Pathology Alternate lighting of surfaces computer engineering computer science Health informatics

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Reservoir Permeability Prediction using Gaussian Processes Regression and NMR Measurements 24

Uncertainty-Aware Reservoir Permeability Prediction using Ga...

引用

8th International Conference on Advances in Artificial Intelligence, ICAAI 2024

作者： Lawal, Ahmad Yang, Yingjie Baisa, Nathanael L. He, Hongmei School of Computer Science and Informatics De Montfort University Leicester United Kingdom School of Science Engineering and Environment University of Salford Manchester United Kingdom

ISBN: (纸本)9798400718014

This study investigates the challenges of permeability prediction in reservoir engineering, focusing on addressing uncertainties inherent in the data and modelling process, and leveraging Nuclear Magnetic Resonance (NMR) log data from the Northern Sea Volve field. The study uses a probabilistic machine learning method called Gaussian Process Regression (GPR) with different kernels, such as Matern52, Matern32, and Radial Basis Function (RBF). LSboost, K-nearest neighbour (KNN), and XGBoost are some of the existing models that are used for comparison. Performance metrics including Mean Absolute Error (MAE), Mean Squared Error (MSE), and coefficient of determination (R2) are utilized for assessment. Additionally, the uncertainty associated with different GPR kernels is analyzed, and confidence intervals are generated to provide insights into model behaviour. The inclusion of confidence intervals enhances interpretability by quantifying the range within which the true permeability value is likely to fall with a specified level of confidence, offering valuable information for decision-making processes in reservoir engineering applications. Findings demonstrate the effectiveness of GPR with Matern52 and Matern32 kernels in permeability prediction, offering competitive performance and robust uncertainty quantification. This research contributes to advancing reservoir engineering by providing a comprehensive and uncertainty-aware approach to permeability prediction. © 2024 Copyright held by the owner/author(s).

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Classification Algorithm Recommendation in Automated Machine Learning: A Meta-Learning Approach Using Multivariate Sparse Group Lasso

引用

computer Modeling in engineering & Sciences 2025年第2期142卷 1611-1636页

作者： Irfan Khan Xianchao Zhang Ramesh Kumar Ayyasamy Saadat M.Alhashmi Azizur Rahim School of Software Dalian University of TechnologyDalian116620China Faculty of Information and Communication Technology Universiti Tunku Abdul RahmanKampar31900Malaysia College of Computing and Informatics University of SharjahSharjah27272United Arab Emirates Department of Computer Systems Engineering University of Engineering and Applied SciencesSwat19200Pakistan

The rapid growth of machine learning(ML)across fields has intensified the challenge of selecting the right algorithm for specific tasks,known as the Algorithm Selection Problem(ASP).Traditional trial-and-error methods have become impractical due to their resource *** Machine Learning(AutoML)systems automate this process,but often neglect the group structures and sparsity in meta-features,leading to inefficiencies in algorithm recommendations for classification *** paper proposes a meta-learning approach using Multivariate Sparse Group Lasso(MSGL)to address these *** method models both within-group and across-group sparsity among meta-features to manage high-dimensional data and reduce multicollinearity across eight meta-feature *** Fast Iterative Shrinkage-Thresholding Algorithm(FISTA)with adaptive restart efficiently solves the non-smooth optimization *** validation on 145 classification datasets with 17 classification algorithms shows that our meta-learning method outperforms four state-of-the-art approaches,achieving 77.18%classification accuracy,86.07%recommendation accuracy and 88.83%normalized discounted cumulative gain.

关键词： Meta-learning machine learning automated machine learning classification meta-features

来源：评论

学校读者我要写书评

暂无评论

Structure learning of Bayesian networks using sparrow optimization algorithm

International Journal of Systematic Innovation

引用

International Journal of Systematic Innovation 2025年第2期9卷 14-25页

作者： Kareem, Shahab Wahhab Awla, Hoshang Qasim Mohammed, Amin Salih Department of Technical Information Systems Engineering Erbil Technical Engineering College Erbil Polytechnic University Erbil Iraq Department of Computer Technical Engineering Al-Qalam University College Kirkuk Iraq Department of Computer Science Faculty of Science Soran University Soran Iraq Department of Software and Informatics Salahaddin University Erbil Iraq

Bayesian networks are powerful analytical models in machine learning, used to represent probabilistic relationships among variables and create learning structures. These networks are made up of parameters that show conditional probabilities and a structure that shows how random variables interact with each other. The structure is shown by a directed acyclic graph. Despite the NP-hard nature of learning Bayesian network structures, there has been significant progress in improving the accuracy of approximation solutions. The main focus is on score-based search strategies, which make use of functions to evaluate network models and identify structures with high scores. This study is significantly focused on structure learning Bayesian networks using the Bayesian Dirichlet equivalent uniform scoring function and metaheuristic search strategies. To this end, this paper presents the sparrow optimization algorithm (SOA), a new metaheuristic algorithm derived from the foraging behavior of sparrows. SOA performs a concurrent optimization in the solution space by simultaneously performing a local and global search that leads to the discovery of near-optimal structures. The results from our experiments on several benchmark datasets show that SOA yields overall better performance than SA and greedy search algorithms. In particular, it is claimed that by applying the proposed approach of SOA, the convergence speed is significantly higher compared with the existing ones;F1 score is 0.35 and 0.05 for the Hamming distance with better results. Given these results, signed operators prove to be very efficient in SOA’s Bayesian network structure learning as a concept, especially for real-world use. © (2024), (Society of Sytematic Innovation). All Rights Reserved.

关键词： Bayesian Network Global and Local Search Search and Score Sparrow Search Optimization Algorithm Structure Learning

来源：评论

学校读者我要写书评

暂无评论

The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs 20th

The Threshold of Existence of δ-Temporal Cliques in Rand...

引用

20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024

作者： Mertzios, George B. Nikoletseas, Sotiris Raptopoulos, Christoforos Spirakis, Paul G. Department of Computer Science Durham University Durham United Kingdom Computer Engineering and Informatics Department University of Patras Patras Greece Department of Mathematics University of Patras Patras Greece Department of Computer Science University of Liverpool Liverpool United Kingdom

ISBN: (纸本)9783031745799

We consider random simple temporal graphs in which every edge of the complete graph Kn appears once within the time interval [0, 1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum δ-clique (namely a clique with edges appearing at most δ apart within [0, 1]) in random instances of this model, for any constant δ. In particular, using the probabilistic method, we prove that the size of a maximum δ-clique is approximately 2lognlog1δ with high probability (whp). We note that, even though the random simple temporal graph contains Θ(n2) overlapping δ-windows, which (when viewed separately) correspond to different random instances of the Erdős-Rényi random graphs model, the size of the maximum δ-clique in the former model and the maximum clique size of the latter are approximately the same. Furthermore, we show that the minimum interval containing a δ-clique is δ-o(δ) whp. We use this result to show that any polynomial time algorithm for δ-Temporal Clique is unlikely to have very large probability of success. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： probabilistic method Simple random temporal graph δ-temporal clique

来源：评论

学校读者我要写书评

暂无评论

Advanced brain tumor segmentation using DeepLabV3Plus with Xception encoder on a multi-class MR image dataset

引用

Multimedia Tools and Applications 2025年 1-22页

作者： Saifullah, Shoffan Dreżewski, Rafal Yudhana, Anton Faculty of Computer Science AGH University of Krakow Krakow30-059 Poland Department of Informatics Universitas Pembangunan Nasional Veteran Yogyakarta Yogyakarta55281 Indonesia Department of Electrical Engineering Universitas Ahmad Dahlan Yogyakarta55191 Indonesia

Accurate segmentation of brain tumors from Magnetic Resonance Imaging (MRI) scans presents notable challenges. This particularly in differentiating tumors from surrounding tissues with similar intensity. This study utilizes the DeepLabV3Plus model with an Xception encoder to address these challenges. We evaluated the model on a dataset of 3064 MR images, which included meningioma, glioma, and pituitary tumors. The model achieved high segmentation performance, with an accuracy of 0.9991, Dice Similarity Coefficient (DSC) of 0.9529, and Jaccard Index (JI) of 0.9133. It also demonstrated substantial boundary precision, recording an Average Symmetric Surface Distance (ASSD) of 0.84 mm and a Hausdorff Distance (HD) of 2.3 mm. These metrics surpass those of existing state-of-the-art models. While the model performed well with well-defined tumor boundaries, it faced challenges segmenting tumors with ambiuous edges. These findings suggest significant potential for enhancing diagnostic accuracy in neuro-oncology. Future work will focus on enhancing the model’s sensitivity to subtle tumor features and expanding the dataset to include a broader range of tumor characteristics. Additionally, incorporating multimodal imaging data could further improve segmentation precision. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Roll for Robot: A Tabletop Role-Playing Game for Designing Socially Assistive Robots for Depression Management 16th

Roll for Robot: A Tabletop Role-Playing Game for Designing ...

引用

16th International Conference on Social Robotics, ICSR + AI 2024

作者： Collins, Sawyer Henkel, Kenna Baugus Henkel, Zachary Śabanović, Selma Luddy School of Informatics Computing and Engineering Indiana University Bloomington BloomingtonIN United States College of Computer Science and Engineering Mississippi State University Mississippi State StarkvilleMS United States

ISBN: (纸本)9789819635214

Imagining and creating a future with a robot tailored to an individual’s needs and wants provides a unique challenge to both designers and perspective users. Using both an existing base zoomorphic robot, TherabotTM in a specially designed tabletop role-playing game, we have explored what it would look like for someone living with depression to go through a "day in the life" with their newly designed robot companion. Inspired by this collaborative co-design technique, eight participants explained their own relationship with depression, identified a character that they connected with, and chose the physical form, sensors, and abilities for a socially assistive robot. Using this character and robot, participants described how they might overcome depression symptoms and identified uses when managing depression symptoms for the robot. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Machine design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：