522 research outputs found

    Π˜ΡΠΊΡƒΡΡΡ‚Π²Π΅Π½Π½Ρ‹ΠΉ ΠΈΠ½Ρ‚Π΅Π»Π»Π΅ΠΊΡ‚ ΠΏΡ€ΠΈ ΠΊΠΎΠ»ΠΎΡ€Π΅ΠΊΡ‚Π°Π»ΡŒΠ½ΠΎΠΌ Ρ€Π°ΠΊΠ΅: ΠΎΠ±Π·ΠΎΡ€

    Get PDF
    The study objective: the study objective is to examine the use of artificial intelligence (AI) in the diagnosis, treatment, and prognosis of Colorectal Cancer (CRC) and discuss the future potential of AI in CRC. Material and Methods. The Web of Science, Scopus, PubMed, Medline, and eLIBRARY databases were used to search for the publications. A study on the application of Artificial Intelligence (AI) to the diagnosis, treatment, and prognosis of Colorectal Cancer (CRC) was discovered in more than 100 sources. In the review, data from 83 articles were incorporated. Results. The review article explores the use of artificial intelligence (AI) in medicine, specifically focusing on its applications in colorectal cancer (CRC). It discusses the stages of AI development for CRC, including molecular understanding, image-based diagnosis, drug design, and individualized treatment. The benefits of AI in medical image analysis are highlighted, improving diagnosis accuracy and inspection quality. Challenges in AI development are addressed, such as data standardization and the interpretability of machine learning algorithms. The potential of AI in treatment decision support, precision medicine, and prognosis prediction is discussed, emphasizing the role of AI in selecting optimal treatments and improving surgical precision. Ethical and regulatory considerations in integrating AI are mentioned, including patient trust, data security, and liability in AI-assisted surgeries. The review emphasizes the importance of an AI standard system, dataset standardization, and integrating clinical knowledge into AI algorithms. Overall, the article provides an overview of the current research on AI in CRC diagnosis, treatment, and prognosis, discussing its benefits, challenges, and future prospects in improving medical outcomes.ЦСль исслСдования - ΠΎΡ†Π΅Π½ΠΊΠ° возмоТностСй использования искусствСнного ΠΈΠ½Ρ‚Π΅Π»Π»Π΅ΠΊΡ‚Π° (ИИ) Π² диагностикС, Π»Π΅Ρ‡Π΅Π½ΠΈΠΈ ΠΈ ΠΏΡ€ΠΎΠ³Π½ΠΎΠ·ΠΈΡ€ΠΎΠ²Π°Π½ΠΈΠΈ ΠΊΠΎΠ»ΠΎΡ€Π΅ΠΊΡ‚Π°Π»ΡŒΠ½ΠΎΠ³ΠΎ Ρ€Π°ΠΊΠ° (КРР), Π° Ρ‚Π°ΠΊΠΆΠ΅ обсуТдСниС ΠΏΠΎΡ‚Π΅Π½Ρ†ΠΈΠ°Π»Π° ИИ Π² Π»Π΅Ρ‡Π΅Π½ΠΈΠΈ КРР. ΠœΠ°Ρ‚Π΅Ρ€ΠΈΠ°Π» ΠΈ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹. ΠŸΡ€ΠΎΠ²Π΅Π΄Π΅Π½ поиск Π½Π°ΡƒΡ‡Π½Ρ‹Ρ… ΠΏΡƒΠ±Π»ΠΈΠΊΠ°Ρ†ΠΈΠΉ Π² поисковых систСмах Web of Science, Scopus, PubMed, Medline ΠΈ eLIBRARY. Π‘Ρ‹Π»ΠΎ просмотрСно Π±ΠΎΠ»Π΅Π΅ 100 источников ΠΏΠΎ ΠΏΡ€ΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡŽ ИИ для диагностики, лСчСния ΠΈ прогнозирования КРР. Π’ ΠΎΠ±Π·ΠΎΡ€ Π²ΠΊΠ»ΡŽΡ‡Π΅Π½Ρ‹ Π΄Π°Π½Π½Ρ‹Π΅ ΠΈΠ· 83 статСй. Π Π΅Π·ΡƒΠ»ΡŒΡ‚Π°Ρ‚Ρ‹. ΠŸΡ€ΠΎΠ²Π΅Π΄Π΅Π½ Π°Π½Π°Π»ΠΈΠ· Π»ΠΈΡ‚Π΅Ρ€Π°Ρ‚ΡƒΡ€Ρ‹, посвящСнной ΠΏΡ€ΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡŽ искусствСнного ΠΈΠ½Ρ‚Π΅Π»Π»Π΅ΠΊΡ‚Π° Π² ΠΌΠ΅Π΄ΠΈΡ†ΠΈΠ½Π΅, особоС Π²Π½ΠΈΠΌΠ°Π½ΠΈΠ΅ ΡƒΠ΄Π΅Π»Π΅Π½ΠΎ Π΅Π³ΠΎ использованию ΠΏΡ€ΠΈ ΠΊΠΎΠ»ΠΎΡ€Π΅ΠΊΡ‚Π°Π»ΡŒΠ½ΠΎΠΌ Ρ€Π°ΠΊΠ΅. ΠžΠ±ΡΡƒΠΆΠ΄Π°ΡŽΡ‚ΡΡ этапы развития ИИ ΠΏΡ€ΠΈ КРР, Π²ΠΊΠ»ΡŽΡ‡Π°Ρ ΠΌΠΎΠ»Π΅ΠΊΡƒΠ»ΡΡ€Π½ΡƒΡŽ Π²Π΅Ρ€ΠΈΡ„ΠΈΠΊΠ°Ρ†ΠΈΡŽ, Π»ΡƒΡ‡Π΅Π²ΡƒΡŽ диагностику, Ρ€Π°Π·Ρ€Π°Π±ΠΎΡ‚ΠΊΡƒ лСкарств ΠΈ ΠΈΠ½Π΄ΠΈΠ²ΠΈΠ΄ΡƒΠ°Π»ΡŒΠ½ΠΎΠ΅ Π»Π΅Ρ‡Π΅Π½ΠΈΠ΅. ΠŸΠΎΠ΄Ρ‡Π΅Ρ€ΠΊΠ½ΡƒΡ‚Ρ‹ прСимущСства ИИ Π² Π°Π½Π°Π»ΠΈΠ·Π΅ мСдицинских ΠΈΠ·ΠΎΠ±Ρ€Π°ΠΆΠ΅Π½ΠΈΠΉ, Ρ‚Π°ΠΊΠΈΡ… ΠΊΠ°ΠΊ КВ, МРВ ΠΈ ПЭВ, Ρ‡Ρ‚ΠΎ ΠΏΠΎΠ²Ρ‹ΡˆΠ°Π΅Ρ‚ Ρ‚ΠΎΡ‡Π½ΠΎΡΡ‚ΡŒ диагностики. Π Π°ΡΡΠΌΠ°Ρ‚Ρ€ΠΈΠ²Π°ΡŽΡ‚ΡΡ Ρ‚Π°ΠΊΠΈΠ΅ ΠΏΡ€ΠΎΠ±Π»Π΅ΠΌΡ‹ развития ИИ, ΠΊΠ°ΠΊ стандартизация Π΄Π°Π½Π½Ρ‹Ρ… ΠΈ ΠΈΠ½Ρ‚Π΅Ρ€ΠΏΡ€Π΅Ρ‚ΠΈΡ€ΡƒΠ΅ΠΌΠΎΡΡ‚ΡŒ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΎΠ² машинного обучСния. ΠŸΠΎΠ΄Ρ‡Π΅Ρ€ΠΊΠΈΠ²Π°Π΅Ρ‚ΡΡ Ρ€ΠΎΠ»ΡŒ ИИ Π² Π²Ρ‹Π±ΠΎΡ€Π΅ ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»ΡŒΠ½ΠΎΠΉ Ρ‚Π°ΠΊΡ‚ΠΈΠΊΠΈ лСчСния ΠΈ ΠΏΠΎΠ²Ρ‹ΡˆΠ΅Π½ΠΈΠΈ эффСктивности хирургичСского Π²ΠΌΠ΅ΡˆΠ°Ρ‚Π΅Π»ΡŒΡΡ‚Π²Π°. Π£Ρ‡ΠΈΡ‚Ρ‹Π²Π°ΡŽΡ‚ΡΡ этичСскиС ΠΈ Π½ΠΎΡ€ΠΌΠ°Ρ‚ΠΈΠ²Π½Ρ‹Π΅ аспСкты ИИ, Π²ΠΊΠ»ΡŽΡ‡Π°Ρ Π΄ΠΎΠ²Π΅Ρ€ΠΈΠ΅ ΠΏΠ°Ρ†ΠΈΠ΅Π½Ρ‚ΠΎΠ², Π±Π΅Π·ΠΎΠΏΠ°ΡΠ½ΠΎΡΡ‚ΡŒ Π΄Π°Π½Π½Ρ‹Ρ… ΠΈ ΠΎΡ‚Π²Π΅Ρ‚ΡΡ‚Π²Π΅Π½Π½ΠΎΡΡ‚ΡŒ Π² ΠΏΡ€ΠΎΠ²Π΅Π΄Π΅Π½ΠΈΠΈ ΠΎΠΏΠ΅Ρ€Π°Ρ†ΠΈΠΉ с использованиСм ИИ. ΠžΠ±ΡΡƒΠΆΠ΄Π°ΡŽΡ‚ΡΡ прСимущСства ИИ Π² диагностикС, Π»Π΅Ρ‡Π΅Π½ΠΈΠΈ ΠΈ ΠΏΡ€ΠΎΠ³Π½ΠΎΠ·ΠΈΡ€ΠΎΠ²Π°Π½ΠΈΠΈ ΠΊΠΎΠ»ΠΎΡ€Π΅ΠΊΡ‚Π°Π»ΡŒΠ½ΠΎΠ³ΠΎ Ρ€Π°ΠΊΠ°, ΠΏΡ€ΠΎΠ±Π»Π΅ΠΌΡ‹ ΠΈ пСрспСктивы ΡƒΠ»ΡƒΡ‡ΡˆΠ΅Π½ΠΈΡ Ρ€Π΅Π·ΡƒΠ»ΡŒΡ‚Π°Ρ‚ΠΎΠ² лСчСния

    Fast and accurate tumor segmentation of histology images using persistent homology and deep convolutional features

    Get PDF
    Tumor segmentation in whole-slide images of histology slides is an important step towards computer-assisted diagnosis. In this work, we propose a tumor segmentation framework based on the novel concept of persistent homology profiles (PHPs). For a given image patch, the homology profiles are derived by efficient computation of persistent homology, which is an algebraic tool from homology theory. We propose an efficient way of computing topological persistence of an image, alternative to simplicial homology. The PHPs are devised to distinguish tumor regions from their normal counterparts by modeling the atypical characteristics of tumor nuclei. We propose two variants of our method for tumor segmentation: one that targets speed without compromising accuracy and the other that targets higher accuracy. The fast version is based on the selection of exemplar image patches from a convolution neural network (CNN) and patch classification by quantifying the divergence between the PHPs of exemplars and the input image patch. Detailed comparative evaluation shows that the proposed algorithm is significantly faster than competing algorithms while achieving comparable results. The accurate version combines the PHPs and high-level CNN features and employs a multi-stage ensemble strategy for image patch labeling. Experimental results demonstrate that the combination of PHPs and CNN features outperforms competing algorithms. This study is performed on two independently collected colorectal datasets containing adenoma, adenocarcinoma, signet and healthy cases. Collectively, the accurate tumor segmentation produces the highest average patch-level F1-score, as compared with competing algorithms, on malignant and healthy cases from both the datasets. Overall the proposed framework highlights the utility of persistent homology for histopathology image analysis

    Image complexity based fMRI-BOLD visual network categorization across visual datasets using topological descriptors and deep-hybrid learning

    Full text link
    This study proposes a new approach that investigates differences in topological characteristics of visual networks, which are constructed using fMRI BOLD time-series corresponding to visual datasets of COCO, ImageNet, and SUN. A publicly available BOLD5000 dataset is utilized that contains fMRI scans while viewing 5254 images of diverse complexities. The objective of this study is to examine how network topology differs in response to distinct visual stimuli from these visual datasets. To achieve this, 0- and 1-dimensional persistence diagrams are computed for each visual network representing COCO, ImageNet, and SUN. For extracting suitable features from topological persistence diagrams, K-means clustering is executed. The extracted K-means cluster features are fed to a novel deep-hybrid model that yields accuracy in the range of 90%-95% in classifying these visual networks. To understand vision, this type of visual network categorization across visual datasets is important as it captures differences in BOLD signals while perceiving images with different contexts and complexities. Furthermore, distinctive topological patterns of visual network associated with each dataset, as revealed from this study, could potentially lead to the development of future neuroimaging biomarkers for diagnosing visual processing disorders like visual agnosia or prosopagnosia, and tracking changes in visual cognition over time

    Topology-Aware Focal Loss for 3D Image Segmentation

    Full text link
    The efficacy of segmentation algorithms is frequently compromised by topological errors like overlapping regions, disrupted connections, and voids. To tackle this problem, we introduce a novel loss function, namely Topology-Aware Focal Loss (TAFL), that incorporates the conventional Focal Loss with a topological constraint term based on the Wasserstein distance between the ground truth and predicted segmentation masks' persistence diagrams. By enforcing identical topology as the ground truth, the topological constraint can effectively resolve topological errors, while Focal Loss tackles class imbalance. We begin by constructing persistence diagrams from filtered cubical complexes of the ground truth and predicted segmentation masks. We subsequently utilize the Sinkhorn-Knopp algorithm to determine the optimal transport plan between the two persistence diagrams. The resultant transport plan minimizes the cost of transporting mass from one distribution to the other and provides a mapping between the points in the two persistence diagrams. We then compute the Wasserstein distance based on this travel plan to measure the topological dissimilarity between the ground truth and predicted masks. We evaluate our approach by training a 3D U-Net with the MICCAI Brain Tumor Segmentation (BraTS) challenge validation dataset, which requires accurate segmentation of 3D MRI scans that integrate various modalities for the precise identification and tracking of malignant brain tumors. Then, we demonstrate that the quality of segmentation performance is enhanced by regularizing the focal loss through the addition of a topological constraint as a penalty term

    Promises and pitfalls of topological data analysis for brain connectivity analysis

    Get PDF
    Acknowledgment The authors thank Jakub Kopal for sharing the preprocessed fMRI time series and Barbora BučkovÑ for sharing scripts for classification pipelinePeer reviewedPublisher PD

    PREDICTION OF 1P/19Q CODELETION STATUS IN DIFFUSE GLIOMA PATIENTS USING PREOPERATIVE MULTIPARAMETRIC MAGNETIC RESONANCE IMAGING

    Get PDF
    A complete codeletion of chromosome 1p/19q is strongly correlated with better overall survival of diffuse glioma patients, hence determining the codeletion status early in the course of a patient’s disease would be valuable in that patient’s care. The current practice requires a surgical biopsy in order to assess the codeletion status, which exposes patients to risks and is limited in its accuracy by sampling variations. To overcome such limitations, we utilized four conventional magnetic resonance imaging sequences to predict the 1p/19q status. We extracted three sets of image-derived features, namely texture-based, topology-based, and convolutional neural network (CNN)-based, and analyzed each feature’s prediction performance. The topology-based model (AUC = 0.855 +/- 0.079) performed significantly better compared to the texture-based model (AUC = 0.707 +/- 0.118) while comparably against the CNN-based model (0.787 +/- 0.195). However, none of the models performed better than the baseline model that is built with only clinical variables, namely, age, gender, and Karnofsky Performance Score (AUC = 0.703 +/- 0.256). In summary, predicting 1p/19q chromosome codeletion status via MRI scan analysis can be a viable non-invasive assessment tool at an early stage of gliomas and in follow-ups although further investigation is needed to improve the model performance

    Hochschild homology, and a persistent approach via connectivity digraphs

    Full text link
    We introduce a persistent Hochschild homology framework for directed graphs. Hochschild homology groups of (path algebras of) directed graphs vanish in degree iβ‰₯2i\geq 2. To extend them to higher degrees, we introduce the notion of connectivity digraphs and analyse two main examples; the first, arising from Atkin's qq-connectivity, and the second, here called nn-path digraphs, generalising the classical notion of line graphs. Based on a categorical setting for persistent homology, we propose a stable pipeline for computing persistent Hochschild homology groups. This pipeline is also amenable to other homology theories; for this reason, we complement our work with a survey on homology theories of digraphs.Comment: Comments are welcome
    • …
    corecore