522 research outputs found
ΠΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΡΠΉ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡ ΠΏΡΠΈ ΠΊΠΎΠ»ΠΎΡΠ΅ΠΊΡΠ°Π»ΡΠ½ΠΎΠΌ ΡΠ°ΠΊΠ΅: ΠΎΠ±Π·ΠΎΡ
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
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
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
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
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
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
We introduce a persistent Hochschild homology framework for directed graphs.
Hochschild homology groups of (path algebras of) directed graphs vanish in
degree . To extend them to higher degrees, we introduce the notion of
connectivity digraphs and analyse two main examples; the first, arising from
Atkin's -connectivity, and the second, here called -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
- β¦