Square Superpixel Generation and Representation Learning via Granular Ball Computing

• URL: http://arxiv.org/abs/2603.29460v1
• Date: Tue, 31 Mar 2026 09:06:58 GMT
• Title: Square Superpixel Generation and Representation Learning via Granular Ball Computing
• Abstract summary: 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.
• Score: 97.99956628286243
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Superpixels provide a compact region-based representation that preserves object boundaries and local structures, and have therefore been widely used in a variety of vision tasks to reduce computational cost. However, most existing superpixel algorithms produce irregularly shaped regions, which are not well aligned with regular operators such as convolutions. Consequently, superpixels are often treated as an offline preprocessing step, limiting parallel implementation and hindering end-to-end optimization within deep learning pipelines. Motivated by the adaptive representation and coverage property of granular-ball computing, we develop a square superpixel generation approach. Specifically, we approximate superpixels using multi-scale square blocks to avoid the computational and implementation difficulties induced by irregular shapes, enabling efficient parallel processing and learnable feature extraction. For each block, a purity score is computed based on pixel-intensity similarity, and high-quality blocks are selected accordingly. The resulting square superpixels can be readily integrated as graph nodes in graph neural networks (GNNs) or as tokens in Vision Transformers (ViTs), facilitating multi-scale information aggregation and structured visual representation. Experimental results on downstream tasks demonstrate consistent performance improvements, validating the effectiveness of the proposed method.

Related papers

• Superpixel Integrated Grids for Fast Image Segmentation [0.07639235704257864]
  We introduce a new superpixel-based data structure, SIGRID, as an alternative to full-resolution images in segmentation tasks.<n>By leveraging classical shape descriptors, SIGRID encodes both color and shape information of superpixels while substantially reducing input dimensionality.
  arXiv  Detail & Related papers  (2025-10-07T22:02:48Z)
• Graph-Weighted Contrastive Learning for Semi-Supervised Hyperspectral Image Classification [9.640130509216629]
  We propose a graph-weighted contrastive learning approach that avoids the use of superpixel partitioning and directly employs neural networks to learn hyperspectral image representation.<n>Our approach supports mini-batch training by processing only a subset of nodes at a time, reducing computational complexity and improving generalization to unseen nodes.
  arXiv  Detail & Related papers  (2025-03-19T22:55:52Z)
• Parameter-Inverted Image Pyramid Networks [49.35689698870247]
  We propose a novel network architecture known as the Inverted Image Pyramid Networks (PIIP) Our core idea is to use models with different parameter sizes to process different resolution levels of the image pyramid. PIIP achieves superior performance in tasks such as object detection, segmentation, and image classification.
  arXiv  Detail & Related papers  (2024-06-06T17:59:10Z)
• Pixel-Inconsistency Modeling for Image Manipulation Localization [59.968362815126326]
  Digital image forensics plays a crucial role in image authentication and manipulation localization. This paper presents a generalized and robust manipulation localization model through the analysis of pixel inconsistency artifacts. Experiments show that our method successfully extracts inherent pixel-inconsistency forgery fingerprints.
  arXiv  Detail & Related papers  (2023-09-30T02:54:51Z)
• SuperpixelGraph: Semi-automatic generation of building footprint through semantic-sensitive superpixel and neural graph networks [21.523846989009886]
  Most urban applications necessitate building footprints in the form of concise vector graphics with sharp boundaries. This paper introduces a semi-automatic approach for building footprint extraction through semantically-sensitive superpixels and neural graph networks.
  arXiv  Detail & Related papers  (2023-04-12T07:39:20Z)
• Implicit Integration of Superpixel Segmentation into Fully Convolutional Networks [11.696069523681178]
  We propose a way to implicitly integrate a superpixel scheme into CNNs. Our proposed method hierarchically groups pixels at downsampling layers and generates superpixels. We evaluate our method on several tasks such as semantic segmentation, superpixel segmentation, and monocular depth estimation.
  arXiv  Detail & Related papers  (2021-03-05T02:20:26Z)
• AINet: Association Implantation for Superpixel Segmentation [82.21559299694555]
  We propose a novel textbfAssociation textbfImplantation (AI) module to enable the network to explicitly capture the relations between the pixel and its surrounding grids. Our method could not only achieve state-of-the-art performance but maintain satisfactory inference efficiency.
  arXiv  Detail & Related papers  (2021-01-26T10:40:13Z)
• 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)
• Spatially-Adaptive Pixelwise Networks for Fast Image Translation [57.359250882770525]
  We introduce a new generator architecture, aimed at fast and efficient high-resolution image-to-image translation. We use pixel-wise networks; that is, each pixel is processed independently of others. Our model is up to 18x faster than state-of-the-art baselines.
  arXiv  Detail & Related papers  (2020-12-05T10:02:03Z)
• Superpixel Segmentation with Fully Convolutional Networks [32.878045921919714]
  We present a novel method that employs a simple fully convolutional network to predict superpixels on a regular image grid. Experimental results on benchmark datasets show that our method achieves state-of-the-art superpixel segmentation performance. We modify a popular network architecture for stereo matching to simultaneously predict superpixels and disparities.
  arXiv  Detail & Related papers  (2020-03-29T02:42:07Z)

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.