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

Recent metaheuristic algorithms for medical object localization using MSER detector in computer-aided diagnosis system

引用

Multimedia Tools and Applications 2025年第15期84卷 14433-14487页

作者： Ait Mehdi, Mohamed Belattar, Khadidja Souami, Feryel Faculty of Computer Science Data Science and Artificial Intelligence Department Laboratory for Research in Artificial Intelligence University of Science and Technology Houari Boumediene BP 32 El-Alia Algiers Bab-Ezzouar16111 Algeria Department of Computer Science University of Algiers Benyoucef Benkhedda Algiers16000 Algeria

Object localization is a critical task in image analysis, often facilitated by artificial intelligence techniques. While the Maximally Stable Extremal Regions (MSER) detection algorithm is a popular choice for local detection, its exhaustive approaches can be algorithmically complex and prone to suboptimal results with improper parameter selection. Various metaheuristic algorithms have been proposed for medical object localization to address this. In this context, four contributions are presented. Firstly, recent metaheuristics, including the Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Heap-based Optimizer (HBO), and Gradient-based Optimizer (GBO), are adapted to tackle the MSER localization problem. These algorithms are rigorously evaluated across diverse medical image datasets using multiple metrics, with their performance statistically validated through the Friedman mean rank test. The second contribution introduces a novel objective function to improve the localization process. The third contribution involves a comparative analysis of the recent algorithms against seven standard metaheuristics specifically designed for MSER localization. Lastly, we present an improved computer-aided diagnosis system that integrates an SVM-based model with Local Binary Patterns (LBP) descriptors extracted from each MSER alongside DenseNet-121 features. Experimental results demonstrate that the HBO and SMA optimizers outperform conventional algorithms, showing a higher diversity, improved exploitation and exploration capabilities, a well-balanced exploration-exploitation trade-off, elevated fitness values, faster convergence speeds, and enhanced computational efficiency. Additionally, we integrate these findings into an improved computer-aided diagnosis system, yielding classification results surpassing state-of-the-art models. These findings highlight the potential advantages of this approach, especially in object detection applications. © The Author(s), under

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Ordinal classification for knee osteoarthritis x-rays using vision transformers

引用

Multimedia Tools and Applications 2025年 1-28页

作者： Tariq, Tayyaba Suhail, Zobia Nawaz, Zubair Department of Computer Science University of the Punjab Allama Iqbal Campus Punjab Lahore54000 Pakistan Department of Data Science University of the Punjab Allama Iqbal Campus Punjab Lahore54000 Pakistan

Knee Osteoarthritis is a progressive and chronic knee joint disease that shows symptoms of pain, stiffness, and swelling and is diagnosed by knee radiographs. These radiographs are evaluated by radiologists using Kellgren and Lawrence’s (KL) grading scheme. According to this scheme, the knee radiograph is graded from KL grade 0 (i.e., Normal) to KL grade 4 (i.e., Severe) to assess the KOA severity. For an automated system, the first step is to localize knee joints from knee radiographs and then classify them according to the KL grading system. In this work, we have proposed vision-based transformers to localize knee joints. We also proposed a single-stage model to localize the knee and classify KOA using a single model. We also explored and compared the performance of various transformers using a multiclass image classification strategy. Since KL grades maintain intrinsic ordinal information of KL grades, we employed an ordinal classification-based strategy to improve automated knee osteoarthritis classification performance. A total of 10 models are trained and validated on multiple datasets, and visualizations are generated for the best model for better comprehension. Our model obtained state-of-the-art results for knee detection and ordinal X-ray classification for KOA. Analysis of Variance (ANOVA) tests also indicate that the ordinal classification approach significantly improves the performance of models over traditional image classification approaches. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Arthroplasty

来源：评论

学校读者我要写书评

暂无评论

Spatio-Spectral Graph Neural Networks 38

Spatio-Spectral Graph Neural Networks

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Geisler, Simon Kosmala, Arthur Herbst, Daniel Günnemann, Stephan Department of Computer Science Munich Data Science Institute Technical University of Munich Germany

Spatial Message Passing Graph Neural Networks (MPGNNs) are widely used for learning on graph-structured data. However, key limitations of -step MPGNNs are that their "receptive field" is typically limited to the -hop neighborhood of a node and that information exchange between distant nodes is limited by oversquashing. Motivated by these limitations, we propose Spatio-Spectral Graph Neural Networks (S2GNNs) - a new modeling paradigm for Graph Neural Networks (GNNs) that synergistically combines spatially and spectrally parametrized graph filters. Parameterizing filters partially in the frequency domain enables global yet efficient information propagation. We show that S2GNNs vanquish over-squashing and yield strictly tighter approximation-theoretic error bounds than MPGNNs. Further, rethinking graph convolutions at a fundamental level unlocks new design spaces. For example, S2GNNs allow for free positional encodings that make them strictly more expressive than the 1-Weisfeiler-Leman (WL) test. Moreover, to obtain general-purpose S2GNNs, we propose spectrally parametrized filters for directed graphs. S2GNNs outperform spatial MPGNNs, graph transformers, and graph rewirings, e.g., on the peptide long-range benchmark tasks, and are competitive with state-of-the-art sequence modeling. On a 40 GB GPU, S2GNNs scale to millions of nodes. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semënov Arithmetic, Affine VASS, and String Constraints 41

Semënov Arithmetic, Affine VASS, and String Constraints

引用

41st International Symposium on Theoretical Aspects of computer science, STACS 2024

作者： Draghici, Andrei Haase, Christoph Manea, Florin Department of Computer Science University of Oxford United Kingdom Computer Science Department Göttingen University Campus-Institut Data Science Germany

ISBN: (纸本)9783959773119

We study extensions of Semënov arithmetic, the first-order theory of the structure (N,+,2x). It is well-known that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as the Büchi V2-predicate. We therefore restrict ourselves to the existential theory of Semënov arithmetic and show that this theory is decidable in EXPSPACE when extended with arbitrary regular predicates over tuples of number strings. Our approach relies on a reduction to the language emptiness problem for a restricted class of affine vector addition systems with states, which we show decidable in EXPSPACE. As an application of our result, we settle an open problem from the literature and show decidability of a class of string constraints involving length constraints. © Andrei Draghici, Christoph Haase, and Florin Manea;licensed under Creative Commons License CC-BY 4.0.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

ETiSeg-Net: edge-aware self attention to enhance tissue segmentation in histopathological images

引用

Multimedia Tools and Applications 2024年 1-21页

作者： Rashmi, R. Girisha, S. Department of Computer Science and Engineering Manipal Institute of Technology Bengaluru Manipal Academy of Higher Education Manipal India Department of Data Science and Computer Applications Manipal Institute of Technology Manipal Academy of Higher Education Manipal India

Digital pathology employing Whole Slide Images (WSIs) plays a pivotal role in cancer detection. Nevertheless, the manual examination of WSIs for the identification of various tissue regions presents formidable challenges due to its labor-intensive nature and subjective interpretation. Convolutional Neural Network (CNN) based semantic segmentation algorithms have emerged as valuable tools for assisting in this task by automating ROI delineation. The incorporation of attention modules and carefully designed loss functions has shown promise in further augmenting the performance of these algorithms. However, there exists a notable gap in research regarding the utilization of attention modules specifically for tissue segmentation, thereby constraining our comprehension and application of these modules in this context. This study introduces ETiSeg-Net (Edge-aware self attention to enhance Tissue Segmentation), a CNN-based semantic segmentation model that uses a novel edge-based attention module to achieve effective delineation of class boundaries. In addition, an innovative iterative training strategy is devised to efficiently optimize the model parameters. The study also conducts a comprehensive investigation into the impact of attention modules and loss functions on the efficacy of semantic segmentation models. Qualitative and quantitative evaluations of these semantic segmentation models are conducted using publicly available datasets. The findings underscore the potential of attention modules in enhancing the accuracy and effectiveness of tissue semantic segmentation. © The Author(s) 2024.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Linked List Encryption Scheme for Image Steganography without Embedding

引用

computer Modeling in Engineering & sciences 2024年第10期141卷 331-352页

作者： Pengbiao Zhao Qi Zhong Jingxue Chen Xiaopei Wang Zhen Qin Erqiang Zhou Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of ChinaChengdu610054China Faculty of Data Science City University of MacaoMacao999078China Department of Computer Science and Engineering University of CaliforniaRiversideCA 92521USA

Information steganography has received more and more attention from scholars nowadays,especially in the area of image steganography,which uses image content to transmit information and makes the existence of secret information *** enhance concealment and security,the Steganography without Embedding(SWE)method has proven effective in avoiding image distortion resulting from cover *** this paper,a novel encrypted communication scheme for image SWE is *** reconstructs the image into a multi-linked list structure consisting of numerous nodes,where each pixel is transformed into a single node with data and pointer *** employing a special addressing algorithm,the optimal linked list corresponding to the secret information can be *** receiver can restore the secretmessage fromthe received image using only the list header position *** scheme is based on the concept of coverless steganography,eliminating the need for any modifications to the cover *** boasts high concealment and security,along with a complete message restoration rate,making it resistant to ***,this paper proposes linked-list construction schemeswithin theproposedframework,which caneffectively resist a variety of attacks,includingnoise attacks and image compression,demonstrating a certain degree of *** validate the proposed framework,practical tests and comparisons are conducted using multiple *** results affirm the framework’s commendable performance in terms of message reduction rate,hidden writing capacity,and robustness against diverse attacks.

关键词： Steganography encryption steganography without embedding coverless steganography

来源：评论

学校读者我要写书评

暂无评论

Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations 38

Neural Pfaffians: Solving Many Many-Electron Schrödinger Eq...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Gao, Nicholas Günnemann, Stephan Department of Computer Science Munich Data Science Institut Technical University of Munich Germany

Neural wave functions accomplished unprecedented accuracies in approximating the ground state of many-electron systems, though at a high computational cost. Recent works proposed amortizing the cost by learning generalized wave functions across different structures and compounds instead of solving each problem independently. Enforcing the permutation antisymmetry of electrons in such generalized neural wave functions remained challenging as existing methods require discrete orbital selection via non-learnable hand-crafted algorithms. This work tackles the problem by defining overparametrized, fully learnable neural wave functions suitable for generalization across molecules. We achieve this by relying on Pfaffians rather than Slater determinants. The Pfaffian allows us to enforce the antisymmetry on arbitrary electronic systems without any constraint on electronic spin configurations or molecular structure. Our empirical evaluation finds that a single neural Pfaffian calculates the ground state and ionization energies with chemical accuracy across various systems. On the TinyMol dataset, we outperform the 'gold-standard' CCSD(T) CBS reference energies by 1.9 mEh and reduce energy errors compared to previous generalized neural wave functions by up to an order of magnitude. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LLM-based methods for the creation of unit tests in game development 28th

LLM-based methods for the creation of unit tests in game dev...

引用

28th International Conference on Knowledge Based and Intelligent information and Engineering Systems, KES 2024

作者： Paduraru, Ciprian Staicu, Adelina Stefanescu, Alin University of Bucharest Department of Computer Science Romania Institute of Logic and Data Science Romania

Problems related to the quality of games, whether on the initial release or after updates, can lead to player dissatisfaction, media attention, and potential financial setbacks. These issues can stem from software bugs, performance bottlenecks, or security vulnerabilities. Despite these challenges, game developers often rely on manual playtesting, highlighting the need for more robust and automated processes in game development. This research explores the application of Large Language Models (LLMs) to automate the creation of unit tests in game development, focusing on strongly typed programming languages such as C++ and C#, which are widely used in the industry. The study focuses on fine-tuning Code Llama, an advanced code generation model, to address common scenarios in game development, including game engines and specific APIs or backends. Although the prototyping and evaluations primarily took place within the Unity game engine, the proposed methods can be adapted to other internal or publicly available solutions. The evaluation results demonstrate these methods' effectiveness in improving existing unit test suites or automatically generating new tests based on natural language descriptions of class contexts and targeted methods. © 2024 The Authors.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Accelerating multiscale electronic stopping power predictions with timedependent density functional theory and machine learning

引用

npj Computational Materials 2024年第1期10卷 993-1002页

作者： Logan Ward Ben Blaiszik Cheng-Wei Lee Troy Martin Ian Foster AndréSchleife Data Science and Learning Division Argonne National LaboratoryLemontIL60437USA Department of Computer Science The University of ChicagoChicagoIL60637USA Department of Materials Science and Engineering University of Illinois at Urbana-Champaign UrbanaUrbanaIL61801USA

Knowing the rate at which particle radiation releases energy in a material,the“stopping power,”is key to designing nuclear reactors,medical treatments,semiconductor and quantum materials,and many other *** the nuclear contribution to stopping power,i.e.,elastic scattering between atoms,is well understood in the literature,the route for gathering data on the electronic contribution has for decades remained costly and reliant on many simplifying assumptions,including that materials are *** establish a method that combines time-dependent density functional theory(TDDFT)and machine learning to reduce the time to assess new materials to hours on a supercomputer and provide valuable data on how atomic details influence electronic *** approach uses TDDFT to compute the electronic stopping from first principles in several directions and then machine learning to interpolate to other directions at a cost of 10 million times fewer *** demonstrate the combined approach in a study of proton irradiation in aluminum and employ it to predict how the depth of maximum energy deposition,the“Bragg Peak,”varies depending on the incident angle—a quantity otherwise inaccessible to modelers and far outside the scales of quantum mechanical *** lack of any experimental information requirement makes our method applicable to most materials,and its speed makes it a prime candidate for enabling quantum-to-continuum models of radiation *** prospect of reusing valuable TDDFT data for training the model makes our approach appealing for applications in the age of materials data science.

关键词： electronic quantum directions

来源：评论

学校读者我要写书评

暂无评论

A Language Model's Guide Through Latent Space 41

A Language Model's Guide Through Latent Space

引用

41st International Conference on Machine Learning, ICML 2024

作者： von Rütte, Dimitri Anagnostidis, Sotiris Bachmann, Gregor Hofmann, Thomas Data Analytics Lab Department of Computer Science ETH Zurich Switzerland

Concept guidance has emerged as a cheap and simple way to control the behavior of language models by probing their hidden representations for concept vectors and using them to perturb activations at inference time. While the focus of previous work has largely been on truthfulness, in this paper we extend this framework to a richer set of concepts such as appropriateness, humor, creativity and quality, and explore to what degree current detection and guidance strategies work in these challenging settings. To facilitate evaluation, we develop a novel metric for concept guidance that takes into account both the success of concept elicitation as well as the potential degradation in fluency of the guided model. Our extensive experiments reveal that while some concepts such as truthfulness more easily allow for guidance with current techniques, novel concepts such as appropriateness or humor either remain difficult to elicit, need extensive tuning to work, or even experience confusion. Moreover, we find that probes with optimal detection accuracies do not necessarily make for the optimal guides, contradicting previous observations for truthfulness. Our work warrants a deeper investigation into the interplay between detectability, guidability, and the nature of the concept, and we hope that our rich experimental test-bed for guidance research inspires stronger follow-up approaches. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：