Superpixel-Based QUBO for Scalable Quantum-Enhanced Medical Image Segmentation

• URL: http://arxiv.org/abs/2607.24288v1
• Date: Mon, 27 Jul 2026 11:37:40 GMT
• Title: Superpixel-Based QUBO for Scalable Quantum-Enhanced Medical Image Segmentation
• Abstract summary: Quadratic unconstrained binary optimization (QUBO) has emerged as a powerful framework for medical computing problems.<n>This paper addresses the challenge through hierarchical problem reduction, as demonstrated in medical image segmentation.<n>A superpixel-based QUBO framework is proposed using simple linear iterative clustering to group pixels into perceptually meaningful regions.
• Score: 4.308188815612659
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quadratic unconstrained binary optimization (QUBO) has emerged as a powerful framework for medical computing problems. Binary decision variables naturally represent clinical choices, making QUBO formulations well-suited for quantum annealing hardware. However, a fundamental scalability challenge limits practical deployment: problem size grows rapidly with input dimensionality, creating computational bottlenecks that restrict applications to simplified scenarios. This paper addresses this challenge through hierarchical problem reduction, as demonstrated in medical image segmentation, where pixel-level QUBO formulations create over 65,000 variables for a 256x256 image, forcing existing approaches to downsample to 42x42 resolution and discard 97% of pixel information. A superpixel-based QUBO framework is proposed using simple linear iterative clustering (SLIC) to group pixels into perceptually meaningful regions, then formulate segmentation as QUBO over a region adjacency graph (RAG) combining min-cut and smoothness objectives. Validation on INbreast mammography breast cancer images demonstrates a 4.2% improvement in segmentation quality (mean IoU 0.76 vs 0.73) with 33 computational speedup (0.67s vs 21.97s) and a 97.3% reduction in problem size (1764 to 48 variables), all achieved while processing full-resolution images rather than downsampled versions. The reduced problem size also fits well within current quantum annealer connectivity limits, removing the embedding overhead that has historically blocked direct deployment of pixel-level QUBO segmentation on quantum hardware.

Related papers

• Square Superpixel Generation and Representation Learning via Granular Ball Computing [97.99956628286243]
  Superpixels provide a compact region-based representation that preserves object boundaries and local structures.<n>Most existing superpixel algorithms produce irregularly shaped regions, which are not well aligned with regular operators such as convolutions.<n>Motivated by the adaptive representation and coverage property of granular-ball computing, we develop a square superpixel generation approach.
  arXiv  Detail & Related papers  (2026-03-31T09:06:58Z)
• Generative Latent Coding for Ultra-Low Bitrate Image Compression [61.71793017252801]
  We introduce a Generative Latent Coding architecture, which performs transform coding in the latent space of a generative vector-quantized variational auto-encoder (VQ-VAE), instead of in the pixel space.<n>The generative latent space is characterized by greater sparsity, richer semantic and better alignment with human perception, rendering it advantageous for achieving high-realism and high-fidelity compression.
  arXiv  Detail & Related papers  (2025-12-23T09:35:40Z)
• Superpixel Boundary Correction for Weakly-Supervised Semantic Segmentation on Histopathology Images [12.002538365135642]
  Weakly supervised semantic segmentation (WSSS) reduces the annotation requirement by using image-level labels instead of pixel-level ones.<n>Class Activation Map (CAM)-based methods still suffer from low spatial resolution and unclear boundaries.<n>We propose a multi-level superpixel correction algorithm that refines CAM boundaries using superpixel clustering and floodfill.
  arXiv  Detail & Related papers  (2025-01-07T15:54:03Z)
• Accelerating Image Super-Resolution Networks with Pixel-Level Classification [29.010136088811137]
  Pixel-level for Single Image SuperResolution is a novel method designed to distribute computational resources adaptively at the pixel level. Our method allows for performance and computational cost balance during inference without re-training.
  arXiv  Detail & Related papers  (2024-07-31T08:53:10Z)
• Accurate Gigapixel Crowd Counting by Iterative Zooming and Refinement [90.76576712433595]
  GigaZoom iteratively zooms into the densest areas of the image and refines coarser density maps with finer details. We show that GigaZoom obtains the state-of-the-art for gigapixel crowd counting and improves the accuracy of the next best method by 42%.
  arXiv  Detail & Related papers  (2023-05-16T08:25:27Z)
• Enhanced Sharp-GAN For Histopathology Image Synthesis [63.845552349914186]
  Histopathology image synthesis aims to address the data shortage issue in training deep learning approaches for accurate cancer detection. We propose a novel approach that enhances the quality of synthetic images by using nuclei topology and contour regularization. The proposed approach outperforms Sharp-GAN in all four image quality metrics on two datasets.
  arXiv  Detail & Related papers  (2023-01-24T17:54:01Z)
• Class Balanced PixelNet for Neurological Image Segmentation [20.56747443955369]
  We propose an automatic brain tumor segmentation approach (e.g., PixelNet) using a pixel-level convolutional neural network (CNN) The proposed model has achieved promising results in brain tumor and ischemic stroke segmentation datasets.
  arXiv  Detail & Related papers  (2022-04-23T10:57:54Z)
• Generating Superpixels for High-resolution Images with Decoupled Patch Calibration [82.21559299694555]
  Patch Networks (PCNet) is designed to efficiently and accurately implement high-resolution superpixel segmentation. DPC takes a local patch from the high-resolution images and dynamically generates a binary mask to impose the network to focus on region boundaries. In particular, DPC takes a local patch from the high-resolution images and dynamically generates a binary mask to impose the network to focus on region boundaries.
  arXiv  Detail & Related papers  (2021-08-19T10:33:05Z)
• Superpixel Segmentation Based on Spatially Constrained Subspace Clustering [57.76302397774641]
  We consider each representative region with independent semantic information as a subspace, and formulate superpixel segmentation as a subspace clustering problem. We show that a simple integration of superpixel segmentation with the conventional subspace clustering does not effectively work due to the spatial correlation of the pixels. We propose a novel convex locality-constrained subspace clustering model that is able to constrain the spatial adjacent pixels with similar attributes to be clustered into a superpixel.
  arXiv  Detail & Related papers  (2020-12-11T06:18:36Z)
• Robust superpixels using color and contour features along linear path [5.746869663956391]
  We propose a framework that provides accurate and regular Superpixels with Contour Adherence using Linear Path (SCALP)<n>A contour prior is also used to prevent the crossing of image boundaries when associating a pixel to a superpixel.<n>SCALP is extensively evaluated on standard segmentation dataset, and the obtained results outperform the ones of the state-of-the-art methods.
  arXiv  Detail & Related papers  (2019-03-17T23:00:13Z)

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.