A Graph-Based Framework for Interpretable Whole Slide Image Analysis

• URL: http://arxiv.org/abs/2503.11846v2
• Date: Mon, 06 Oct 2025 20:40:30 GMT
• Title: A Graph-Based Framework for Interpretable Whole Slide Image Analysis
• Authors: Alexander Weers, Alexander H. Berger, Laurin Lux, Peter Schüffler, Daniel Rueckert, Johannes C. Paetzold,
• Abstract summary: We develop a framework that transforms whole-slide images into biologically-informed graph representations.<n>Our approach builds graph nodes from tissue regions that respect natural structures, not arbitrary grids.<n>We demonstrate strong performance on challenging cancer staging and survival prediction tasks.
• Score: 86.37618055724441
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The histopathological analysis of whole-slide images (WSIs) is fundamental to cancer diagnosis but is a time-consuming and expert-driven process. While deep learning methods show promising results, dominant patch-based methods artificially fragment tissue, ignore biological boundaries, and produce black-box predictions. We overcome these limitations with a novel framework that transforms gigapixel WSIs into biologically-informed graph representations and is interpretable by design. Our approach builds graph nodes from tissue regions that respect natural structures, not arbitrary grids. We introduce an adaptive graph coarsening technique, guided by learned embeddings, to efficiently merge homogeneous regions while preserving diagnostically critical details in heterogeneous areas. Each node is enriched with a compact, interpretable feature set capturing clinically-motivated priors. A graph attention network then performs diagnosis on this compact representation. We demonstrate strong performance on challenging cancer staging and survival prediction tasks. Crucially, our resource-efficient model ($>$13x fewer parameters and $>$300x less data) achieves results competitive with a massive foundation model, while offering full interpretability through feature attribution. Our code is publicly available at https://github.com/HistoGraph31/pix2pathology.

Related papers

• GrapHist: Graph Self-Supervised Learning for Histopathology [27.886002403669693]
  We introduce GrapHist, a novel graph-based self-supervised learning framework for histopathology.<n>GrapHist learns generalizable and structurally-informed embeddings that enable diverse downstream tasks.<n>Our results show that GrapHist achieves competitive performance compared to its vision-based counterparts in slide-, region-hugging, and cell-level tasks.
  arXiv  Detail & Related papers  (2026-02-24T12:11:49Z)
• Beyond Message Passing: Neural Graph Pattern Machine [50.78679002846741]
  We introduce the Neural Graph Pattern Machine (GPM), a novel framework that bypasses message passing by learning directly from graph substructures.<n>GPM efficiently extracts, encodes, and prioritizes task-relevant graph patterns, offering greater expressivity and improved ability to capture long-range dependencies.
  arXiv  Detail & Related papers  (2025-01-30T20:37:47Z)
• GSpect: Spectral Filtering for Cross-Scale Graph Classification [9.800723513820046]
  We propose GSpect, an advanced spectral graph filtering model for cross-scale graph classification tasks. On open data sets, GSpect improves the performance of classification accuracy by 1.62% on average, and for a maximum of 3.33% on PROTEINS. GSpect fills the gap in cross-scale graph classification studies and has potential to provide assistance in application research like diagnosis of brain disease.
  arXiv  Detail & Related papers  (2024-08-31T03:26:32Z)
• A self-supervised framework for learning whole slide representations [52.774822784847565]
  We present Slide Pre-trained Transformers (SPT) for gigapixel-scale self-supervision of whole slide images. We benchmark SPT visual representations on five diagnostic tasks across three biomedical microscopy datasets.
  arXiv  Detail & Related papers  (2024-02-09T05:05:28Z)
• Graph-level Protein Representation Learning by Structure Knowledge Refinement [50.775264276189695]
  This paper focuses on learning representation on the whole graph level in an unsupervised manner. We propose a novel framework called Structure Knowledge Refinement (SKR) which uses data structure to determine the probability of whether a pair is positive or negative.
  arXiv  Detail & Related papers  (2024-01-05T09:05:33Z)
• 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)
• Context-Aware Self-Supervised Learning of Whole Slide Images [0.0]
  A novel two-stage learning technique is presented in this work. A graph representation capturing all dependencies among regions in the WSI is very intuitive. The entire slide is presented as a graph, where the nodes correspond to the patches from the WSI. The proposed framework is then tested using WSIs from prostate and kidney cancers.
  arXiv  Detail & Related papers  (2023-06-07T20:23:05Z)
• Graph-in-Graph (GiG): Learning interpretable latent graphs in non-Euclidean domain for biological and healthcare applications [52.65389473899139]
  Graphs are a powerful tool for representing and analyzing unstructured, non-Euclidean data ubiquitous in the healthcare domain. Recent works have shown that considering relationships between input data samples have a positive regularizing effect for the downstream task. We propose Graph-in-Graph (GiG), a neural network architecture for protein classification and brain imaging applications.
  arXiv  Detail & Related papers  (2022-04-01T10:01:37Z)
• PSGR: Pixel-wise Sparse Graph Reasoning for COVID-19 Pneumonia Segmentation in CT Images [83.26057031236965]
  We propose a pixel-wise sparse graph reasoning (PSGR) module to enhance the modeling of long-range dependencies for COVID-19 infected region segmentation in CT images. The PSGR module avoids imprecise pixel-to-node projections and preserves the inherent information of each pixel for global reasoning. The solution has been evaluated against four widely-used segmentation models on three public datasets.
  arXiv  Detail & Related papers  (2021-08-09T04:58:23Z)
• Non-isomorphic Inter-modality Graph Alignment and Synthesis for Holistic Brain Mapping [1.433758865948252]
  We propose an inter-modality aligner of non-isomorphic graphs (IMANGraphNet) framework to infer a target graph modality based on a given modality. Our three core contributions lie in (i) predicting a target graph (e.g., functional) from a source graph (e.g., morphological) based on a novel graph generative adversarial network (gGAN) Our comprehensive experiments on predicting functional from morphological graphs demonstrate the outperformance of IMANGraphNet in comparison with its variants.
  arXiv  Detail & Related papers  (2021-06-30T08:59:55Z)
• HistoTransfer: Understanding Transfer Learning for Histopathology [9.231495418218813]
  We compare the performance of features extracted from networks trained on ImageNet and histopathology data. We investigate if features learned using more complex networks lead to gain in performance.
  arXiv  Detail & Related papers  (2021-06-13T18:55:23Z)
• Learning Whole-Slide Segmentation from Inexact and Incomplete Labels using Tissue Graphs [11.315178576537768]
  We propose SegGini, a weakly supervised semantic segmentation method using graphs. SegGini segment arbitrary and large images, scaling from tissue microarray (TMA) to whole slide image (WSI)
  arXiv  Detail & Related papers  (2021-03-04T16:04:24Z)
• Efficient Colon Cancer Grading with Graph Neural Networks [4.56877715768796]
  The overall model performs better compared to other state of the art methods on the colorectal cancer grading data set. The graph neural network itself consists of three convolutional blocks and linear layers.
  arXiv  Detail & Related papers  (2020-10-02T16:43:33Z)
• 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)
• Graph Neural Networks for UnsupervisedDomain Adaptation of Histopathological ImageAnalytics [22.04114134677181]
  We present a novel method for the unsupervised domain adaptation for histological image analysis. It is based on a backbone for embedding images into a feature space, and a graph neural layer for propa-gating the supervision signals of images with labels. In experiments, our methodachieves state-of-the-art performance on four public datasets.
  arXiv  Detail & Related papers  (2020-08-21T04:53:44Z)
• GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
  Graph representation learning has emerged as a powerful technique for addressing real-world problems. We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework. We conduct experiments on three graph learning tasks and ten graph datasets.
  arXiv  Detail & Related papers  (2020-06-17T16:18:35Z)
• Structured Landmark Detection via Topology-Adapting Deep Graph Learning [75.20602712947016]
  We present a new topology-adapting deep graph learning approach for accurate anatomical facial and medical landmark detection. The proposed method constructs graph signals leveraging both local image features and global shape features. Experiments are conducted on three public facial image datasets (WFLW, 300W, and COFW-68) as well as three real-world X-ray medical datasets (Cephalometric (public), Hand and Pelvis)
  arXiv  Detail & Related papers  (2020-04-17T11:55:03Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.