SCALP: Superpixels with Contour Adherence using Linear Path

• URL: http://arxiv.org/abs/1903.07149v2
• Date: Wed, 17 Sep 2025 15:19:54 GMT
• Title: SCALP: Superpixels with Contour Adherence using Linear Path
• Authors: Rémi Giraud, Vinh-Thong Ta, Nicolas Papadakis,
• Abstract summary: 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.
• Score: 5.746869663956391
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Superpixel decomposition methods are generally used as a pre-processing step to speed up image processing tasks. They group the pixels of an image into homogeneous regions while trying to respect existing contours. For all state-of-the-art superpixel decomposition methods, a trade-off is made between 1) computational time, 2) adherence to image contours and 3) regularity and compactness of the decomposition. In this paper, we propose a fast method to compute Superpixels with Contour Adherence using Linear Path (SCALP) in an iterative clustering framework. The distance computed when trying to associate a pixel to a superpixel during the clustering is enhanced by considering the linear path to the superpixel barycenter. The proposed framework produces regular and compact superpixels that adhere to the image contours. We provide a detailed evaluation of SCALP on the standard Berkeley Segmentation Dataset. The obtained results outperform state-of-the-art methods in terms of standard superpixel and contour detection metrics.

Related papers

• Superpixel-Based Image Segmentation Using Squared 2-Wasserstein Distances [11.580076885777151]
  We present an efficient method for image segmentation in the presence of strong inhomogeneities.<n>Superpixels are first grouped into superpixels via a linear least-squares assignment problem.<n>These superpixels are then greedily merged into object-level segments using the squared 2-Wasserstein distance between their empirical distributions.
  arXiv  Detail & Related papers  (2026-01-22T22:24:15Z)
• Hierarchical Superpixel Segmentation via Structural Information Theory [48.488598357738674]
  Superpixel segmentation is a foundation for many higher-level computer vision tasks.<n>We present SIT-HSS, a hierarchical superpixel segmentation method based on structural information theory.<n>We show that SIT-HSS performs better than state-of-the-art unsupervised superpixel segmentation algorithms.
  arXiv  Detail & Related papers  (2025-01-13T05:39:43Z)
• Image Reconstruction using Superpixel Clustering and Tensor Completion [21.088385725444944]
  Our method divides the image into several regions that capture important textures or semantics and selects a representative pixel from each region to store. We propose two smooth tensor completion algorithms that can effectively reconstruct different types of images from the selected pixels.
  arXiv  Detail & Related papers  (2023-05-16T16:00:48Z)
• Efficient Multiscale Object-based Superpixel Framework [62.48475585798724]
  We propose a novel superpixel framework, named Superpixels through Iterative CLEarcutting (SICLE) SICLE exploits object information being able to generate a multiscale segmentation on-the-fly. It generalizes recent superpixel methods, surpassing them and other state-of-the-art approaches in efficiency and effectiveness according to multiple delineation metrics.
  arXiv  Detail & Related papers  (2022-04-07T15:59:38Z)
• Saliency Enhancement using Superpixel Similarity [77.34726150561087]
  Saliency Object Detection (SOD) has several applications in image analysis. Deep-learning-based SOD methods are among the most effective, but they may miss foreground parts with similar colors. We introduce a post-processing method, named textitSaliency Enhancement over Superpixel Similarity (SESS) We demonstrate that SESS can consistently and considerably improve the results of three deep-learning-based SOD methods on five image datasets.
  arXiv  Detail & Related papers  (2021-12-01T17:22:54Z)
• 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)
• Superpixel Based Graph Laplacian Regularization for Sparse Hyperspectral Unmixing [1.14219428942199]
  We use a superpixel segmentation algorithm to extract the homogeneous regions by considering the image boundaries. We first extract the homogeneous regions, which are called superpixels, then a weighted graph in each superpixel is constructed by selecting $K$-nearest pixels in each superpixel. The spatial similarity is investigated using graph Laplacian regularization.
  arXiv  Detail & Related papers  (2020-07-28T07:30:50Z)
• SegFix: Model-Agnostic Boundary Refinement for Segmentation [75.58050758615316]
  We present a model-agnostic post-processing scheme to improve the boundary quality for the segmentation result that is generated by any existing segmentation model. Motivated by the empirical observation that the label predictions of interior pixels are more reliable, we propose to replace the originally unreliable predictions of boundary pixels by the predictions of interior pixels.
  arXiv  Detail & Related papers  (2020-07-08T17:08:08Z)
• Texture Superpixel Clustering from Patch-based Nearest Neighbor Matching [2.84279467589473]
  We propose a new Nearest Neighbor-based Superpixel Clustering (NNSC) method to generate texture-aware superpixels in a limited computational time.
  arXiv  Detail & Related papers  (2020-03-09T21:11:21Z)
• 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.