End-to-End Cell Detection via Instance-aware Graph Modeling

• URL: http://arxiv.org/abs/2609.15354v1
• Date: Mon, 14 Sep 2026 10:37:19 GMT
• Title: End-to-End Cell Detection via Instance-aware Graph Modeling
• Abstract summary: We propose an end-to-end framework for cell detection and classification.<n>It incorporates a dynamic graph construction module and an instance-aware graph network.<n>Our method significantly outperforms existing approaches in both detection and classification performance.
• Score: 31.98156719497261
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Accurate cell detection and classification are crucial for pathological analysis, directly affecting diagnostic accuracy and treatment planning. To capture complex cellular interactions beyond visual appearance within the tumor microenvironment, several approaches have employed graph neural networks to model spatial and relational patterns among cell nuclei, yielding promising results. However, these methods typically adopt a two-stage paradigm of visual extraction followed by relational modeling, which necessitates separate tuning for each stage, thereby increasing pipeline complexity and hindering end-to-end joint optimization. In this paper, we propose an end-to-end framework for cell detection and classification that jointly models patch-level visual representations and instance-level interactions, which incorporates a dynamic graph construction module and an instance-aware graph network. Specifically, the graph construction module dynamically builds the graph structure using learnable queries derived from patch-level features as cell instance representations, with adjacency defined by integrating feature similarity and spatial distances. The instance-aware graph network performs adaptive instance filtering and feature reorganization, aggregating them over the cell graph into a topological latent state for a selective state-space transition driven by visual cues, fusing appearance and relational evidence. When evaluated on multiple datasets with different staining protocols for cell and nucleus detection, our method significantly outperforms existing approaches in both detection and classification performance. The code will be released at https://github.com/RuochenLiu23/IGM.

Related papers

• Unsupervised Learning of Cell Instances with Generative Routing Pyramids [3.910659311729392]
  We describe a new unsupervised method for cell instance segmentation and phenotypic classification from unlabeled microscopy images.<n>Our method is based on reconstructing each image using a coarse-to-fine routing pyramid that associates pixels with spatially sparse latent sources.<n>We demonstrate competitive performance in instance segmentation across diverse cell morphologies and imaging modalities.
  arXiv  Detail & Related papers  (2026-08-17T17:03:32Z)
• TopoAlign: Topology-Aware Visual Representation Alignment [18.80110544625249]
  TopoAlign is a framework for visually comparing model representations from a structural perspective.<n>We show that TopoAlign provides meaningful insights into representation structure and alignment from a topological perspective.
  arXiv  Detail & Related papers  (2026-05-25T07:58:26Z)
• Robust Graph Matching through Semantic Relationship Generation for SLAM [0.15635627702544694]
  Scene Graphs enable localization in structured indoor environments by matching a locally observed graph to a prior map.<n>We propose a semantic-enhanced graph matching approach that explicitly models relations between detected objects and structural elements.<n>Results show that semantic relations significantly reduce the number of candidate matches, improve computational efficiency, and enable faster convergence.
  arXiv  Detail & Related papers  (2026-04-28T09:15:51Z)
• CoTCoNet: An Optimized Coupled Transformer-Convolutional Network with an Adaptive Graph Reconstruction for Leukemia Detection [0.3573481101204926]
  We propose an optimized Coupled Transformer Convolutional Network (CoTCoNet) framework for the classification of leukemia. Our framework captures comprehensive global features and scalable spatial patterns, enabling the identification of complex and large-scale hematological features. It achieves remarkable accuracy and F1-Score rates of 0.9894 and 0.9893, respectively.
  arXiv  Detail & Related papers  (2024-10-11T13:31:28Z)
• UniCell: Universal Cell Nucleus Classification via Prompt Learning [76.11864242047074]
  We propose a universal cell nucleus classification framework (UniCell) It employs a novel prompt learning mechanism to uniformly predict the corresponding categories of pathological images from different dataset domains. In particular, our framework adopts an end-to-end architecture for nuclei detection and classification, and utilizes flexible prediction heads for adapting various datasets.
  arXiv  Detail & Related papers  (2024-02-20T11:50:27Z)
• Histopathology Whole Slide Image Analysis with Heterogeneous Graph Representation Learning [78.49090351193269]
  We propose a novel graph-based framework to leverage the inter-relationships among different types of nuclei for WSI analysis. Specifically, we formulate the WSI as a heterogeneous graph with "nucleus-type" attribute to each node and a semantic attribute similarity to each edge. Our framework outperforms the state-of-the-art methods with considerable margins on various tasks.
  arXiv  Detail & Related papers  (2023-07-09T14:43:40Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Enforcing Morphological Information in Fully Convolutional Networks to Improve Cell Instance Segmentation in Fluorescence Microscopy Images [1.408123603417833]
  We propose a novel cell instance segmentation approach based on the well-known U-Net architecture. To enforce the learning of morphological information per pixel, a deep distance transformer (DDT) acts as a back-bone model. The obtained results suggest a performance boost over traditional U-Net architectures.
  arXiv  Detail & Related papers  (2021-06-10T15:54:38Z)
• Out-of-distribution Generalization via Partial Feature Decorrelation [72.96261704851683]
  We present a novel Partial Feature Decorrelation Learning (PFDL) algorithm, which jointly optimize a feature decomposition network and the target image classification model. The experiments on real-world datasets demonstrate that our method can improve the backbone model's accuracy on OOD image classification datasets.
  arXiv  Detail & Related papers  (2020-07-30T05:48:48Z)
• A Graph-based Interactive Reasoning for Human-Object Interaction Detection [71.50535113279551]
  We present a novel graph-based interactive reasoning model called Interactive Graph (abbr. in-Graph) to infer HOIs. We construct a new framework to assemble in-Graph models for detecting HOIs, namely in-GraphNet. Our framework is end-to-end trainable and free from costly annotations like human pose.
  arXiv  Detail & Related papers  (2020-07-14T09:29:03Z)

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.