Generalized Shortest Path-based Superpixels for 3D Spherical Image Segmentation

• URL: http://arxiv.org/abs/2509.19895v1
• Date: Wed, 24 Sep 2025 08:47:34 GMT
• Title: Generalized Shortest Path-based Superpixels for 3D Spherical Image Segmentation
• Abstract summary: We introduce a new general superpixel method called SphSPS dedicated to wide 360o spherical or omnidirectional images.<n>Our method respects the geometry of the 3D spherical acquisition space and generalizes the notion of shortest path between a pixel and a superpixel center.<n>We demonstrate that considering the geometry of the acquisition space to compute the shortest path enables to jointly improve the segmentation accuracy and the shape regularity of superpixels.
• Score: 0.254890465057467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The growing use of wide angle image capture devices and the need for fast and accurate image analysis in computer visions have enforced the need for dedicated under-representation approaches. Most recent decomposition methods segment an image into a small number of irregular homogeneous regions, called superpixels. Nevertheless, these approaches are generally designed to segment standard 2D planar images, i.e., captured with a 90o angle view without distortion. In this work, we introduce a new general superpixel method called SphSPS (for Spherical Shortest Path-based Superpixels)1 , dedicated to wide 360o spherical or omnidirectional images. Our method respects the geometry of the 3D spherical acquisition space and generalizes the notion of shortest path between a pixel and a superpixel center, to fastly extract relevant clustering features. We demonstrate that considering the geometry of the acquisition space to compute the shortest path enables to jointly improve the segmentation accuracy and the shape regularity of superpixels. To evaluate this regularity aspect, we also generalize a global regularity metric to the spherical space, addressing the limitations of the only existing spherical compactness measure. Finally, the proposed SphSPS method is validated on the reference 360o spherical panorama segmentation dataset and on synthetic road omnidirectional images. Our method significantly outperforms both planar and spherical state-of-the-art approaches in terms of segmentation accuracy,robustness to noise and regularity, providing a very interesting tool for superpixel-based applications on 360o images.

Related papers

• SphereSOD: Geometry-Structure Coupled Learning for 360 Salient Object Detection [75.77856258186854]
  360 salient object detection aims to accurately segment salient regions across a full field of view.<n>Existing methods mainly focus on compensating projection distortion while overlooking the interaction between panoramic geometry and salient object structure.<n>We propose SphereSOD, an ERP-native framework that couples panoramic geometry with evolving salient structures.
  arXiv  Detail & Related papers  (2026-09-07T14:47:54Z)
• 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)
• Superpixel Anything: A general object-based framework for accurate yet regular superpixel segmentation [1.121518046252855]
  SPAM (SuperPixel Anything Model) is a versatile framework for segmenting images into accurate yet regular superpixels.<n>We leverage a large-scale pretrained model for semantic-agnostic segmentation to ensure that superpixels align with object masks.<n> SPAM can handle any prior high-level segmentation, resolving uncertainty regions, and is able to interactively focus on specific objects.
  arXiv  Detail & Related papers  (2025-09-16T08:09:24Z)
• You Need a Transition Plane: Bridging Continuous Panoramic 3D Reconstruction with Perspective Gaussian Splatting [57.44295803750027]
  We present a novel framework, named TPGS, to bridge continuous panoramic 3D scene reconstruction with perspective Gaussian splatting.<n>Specifically, we optimize 3D Gaussians within individual cube faces and then fine-tune them in the stitched panoramic space.<n>Experiments on indoor and outdoor, egocentric, and roaming benchmark datasets demonstrate that our approach outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-04-12T03:42:50Z)
• Splatter-360: Generalizable 360$^{\circ}$ Gaussian Splatting for Wide-baseline Panoramic Images [52.48351378615057]
  textitSplatter-360 is a novel end-to-end generalizable 3DGS framework to handle wide-baseline panoramic images.<n>We introduce a 3D-aware bi-projection encoder to mitigate the distortions inherent in panoramic images.<n>This enables robust 3D-aware feature representations and real-time rendering capabilities.
  arXiv  Detail & Related papers  (2024-12-09T06:58:31Z)
• Deep Spherical Superpixels [1.2604738912025477]
  We introduce the first deep learning-based superpixel segmentation approach tailored for omnidirectional images called DSS (for Deep Spherical Superpixels)<n>Our methodology leverages on spherical CNN architectures and the differentiable K-means clustering paradigm for superpixels, to generate superpixels that follow the spherical geometry.
  arXiv  Detail & Related papers  (2024-07-24T15:27:21Z)
• Superpixel Graph Contrastive Clustering with Semantic-Invariant Augmentations for Hyperspectral Images [73.01141916544103]
  Hyperspectral images (HSI) clustering is an important but challenging task.<n>We first use 3-D and 2-D hybrid convolutional neural networks to extract the high-order spatial and spectral features of HSI.<n>We then design a superpixel graph contrastive clustering model to learn discriminative superpixel representations.
  arXiv  Detail & Related papers  (2024-03-04T07:40:55Z)
• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• Pixel-Perfect Structure-from-Motion with Featuremetric Refinement [96.73365545609191]
  We refine two key steps of structure-from-motion by a direct alignment of low-level image information from multiple views. This significantly improves the accuracy of camera poses and scene geometry for a wide range of keypoint detectors. Our system easily scales to large image collections, enabling pixel-perfect crowd-sourced localization at scale.
  arXiv  Detail & Related papers  (2021-08-18T17:58:55Z)
• OSLO: On-the-Sphere Learning for Omnidirectional images and its application to 360-degree image compression [59.58879331876508]
  We study the learning of representation models for omnidirectional images and propose to use the properties of HEALPix uniform sampling of the sphere to redefine the mathematical tools used in deep learning models for omnidirectional images. Our proposed on-the-sphere solution leads to a better compression gain that can save 13.7% of the bit rate compared to similar learned models applied to equirectangular images.
  arXiv  Detail & Related papers  (2021-07-19T22:14:30Z)
• 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)
• Generalized Shortest Path-based Superpixels for Accurate Segmentation of Spherical Images [2.4063592468412267]
  We introduce a new superpixel method for spherical images called SphSPS (for Spherical Shortest Path-based Superpixels) Our approach respects the spherical geometry and generalizes the notion of shortest path between a pixel and a superpixel center on the 3D spherical acquisition space. We show that the feature information on such path can be efficiently integrated into our clustering framework and jointly improves the respect of object contours and the shape regularity.
  arXiv  Detail & Related papers  (2020-04-15T23:41:32Z)
• SCALP: Superpixels with Contour Adherence using Linear Path [5.746869663956391]
  We propose a fast method to compute Superpixels with Contour Adherence using Linear Path (SCALP) in an iterative clustering framework.<n>The proposed framework produces compact and superpixels that adhere to contour contours.
  arXiv  Detail & Related papers  (2019-03-17T19:23:00Z)

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.