C2P-GCN: Cell-to-Patch Graph Convolutional Network for Colorectal Cancer Grading

• URL: http://arxiv.org/abs/2403.04962v2
• Date: Mon, 13 May 2024 07:09:55 GMT
• Title: C2P-GCN: Cell-to-Patch Graph Convolutional Network for Colorectal Cancer Grading
• Authors: Sudipta Paul, Bulent Yener, Amanda W. Lund,
• Abstract summary: Graph-based learning approaches are increasingly favored for grading colorectal cancer histology images. Recent graph-based techniques involve dividing whole slide images into smaller or medium-sized patches, and then building graphs on each patch for direct use in training. This method fails to capture the tissue structure information present in an entire WSI and relies on training from a significantly large dataset of image patches. We propose a novel cell-to-patch graph convolutional network (C2P-GCN), which is a two-stage graph formation-based approach.
• Score: 2.570529808612886
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-based learning approaches, due to their ability to encode tissue/organ structure information, are increasingly favored for grading colorectal cancer histology images. Recent graph-based techniques involve dividing whole slide images (WSIs) into smaller or medium-sized patches, and then building graphs on each patch for direct use in training. This method, however, fails to capture the tissue structure information present in an entire WSI and relies on training from a significantly large dataset of image patches. In this paper, we propose a novel cell-to-patch graph convolutional network (C2P-GCN), which is a two-stage graph formation-based approach. In the first stage, it forms a patch-level graph based on the cell organization on each patch of a WSI. In the second stage, it forms an image-level graph based on a similarity measure between patches of a WSI considering each patch as a node of a graph. This graph representation is then fed into a multi-layer GCN-based classification network. Our approach, through its dual-phase graph construction, effectively gathers local structural details from individual patches and establishes a meaningful connection among all patches across a WSI. As C2P-GCN integrates the structural data of an entire WSI into a single graph, it allows our model to work with significantly fewer training data compared to the latest models for colorectal cancer. Experimental validation of C2P-GCN on two distinct colorectal cancer datasets demonstrates the effectiveness of our method.

Related papers

• From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited [51.24526202984846]
  Graph-based semi-supervised learning (GSSL) has long been a hot research topic. graph convolutional networks (GCNs) have become the predominant techniques for their promising performance.
  arXiv  Detail & Related papers  (2023-09-24T10:10:21Z)
• Explainable and Position-Aware Learning in Digital Pathology [0.0]
  In this work, classification of cancer from WSIs is performed with positional embedding and graph attention. A comparison of the proposed method with leading approaches in cancer diagnosis and grading verify improved performance. The identification of cancerous regions in WSIs is another critical task in cancer diagnosis.
  arXiv  Detail & Related papers  (2023-06-14T01:53:17Z)
• Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data [91.27527985415007]
  Existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph. We advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set.
  arXiv  Detail & Related papers  (2023-06-05T07:53:52Z)
• Graph Contrastive Learning for Skeleton-based Action Recognition [85.86820157810213]
  We propose a graph contrastive learning framework for skeleton-based action recognition. SkeletonGCL associates graph learning across sequences by enforcing graphs to be class-discriminative. SkeletonGCL establishes a new training paradigm, and it can be seamlessly incorporated into current graph convolutional networks.
  arXiv  Detail & Related papers  (2023-01-26T02:09:16Z)
• Template based Graph Neural Network with Optimal Transport Distances [11.56532171513328]
  Current Graph Neural Networks (GNN) architectures rely on two important components: node features embedding through message passing, and aggregation with a specialized form of pooling. We propose in this work a novel point of view, which places distances to some learnable graph templates at the core of the graph representation. This distance embedding is constructed thanks to an optimal transport distance: the Fused Gromov-Wasserstein (FGW) distance.
  arXiv  Detail & Related papers  (2022-05-31T12:24:01Z)
• A graph-transformer for whole slide image classification [11.968797693846476]
  We present a Graph-Transformer (GT) that fuses a graph-based representation of an whole slide image (WSI) and a vision transformer for processing pathology images, called GTP, to predict disease grade. Our findings demonstrate GTP as an interpretable and effective deep learning framework for WSI-level classification.
  arXiv  Detail & Related papers  (2022-05-19T16:32:10Z)
• Spatio-Temporal Inception Graph Convolutional Networks for Skeleton-Based Action Recognition [126.51241919472356]
  We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition. Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
  arXiv  Detail & Related papers  (2020-11-26T14:43:04Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)
• Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification [63.56018768401328]
  We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions. Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
  arXiv  Detail & Related papers  (2020-09-19T09:26:20Z)
• Latent-Graph Learning for Disease Prediction [44.26665239213658]
  We show that it is possible to learn a single, optimal graph towards the GCN's downstream task of disease classification. Unlike commonly employed spectral GCN approaches, our GCN is spatial and inductive, and can thus infer previously unseen patients as well.
  arXiv  Detail & Related papers  (2020-03-27T08:18:01Z)
• K-Core based Temporal Graph Convolutional Network for Dynamic Graphs [19.237377882738063]
  We propose a novel k-core based temporal graph convolutional network, the CTGCN, to learn node representations for dynamic graphs. In contrast to previous dynamic graph embedding methods, CTGCN can preserve both local connective proximity and global structural similarity. Experimental results on 7 real-world graphs demonstrate that the CTGCN outperforms existing state-of-the-art graph embedding methods in several tasks.
  arXiv  Detail & Related papers  (2020-03-22T14:15:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.