10 April 2024 in ACM Computing Surveys
Superpixel segmentation consists of partitioning images into regions composed of similar and connected pixels. Its methods have been widely used in many computer vision applications, since it allows for reducing the workload, removing redundant information, and preserving regions with meaningful features. Due to the rapid progress in this area, the literature fails to catch up on more recent works among the compared ones and to categorize the methods according to all existing strategies. This work fills this gap by presenting a comprehensive review with a new taxonomy for superpixel segmentation, in which methods are classified according to their processing steps and processing levels of image features. We revisit the recent and popular literature according to our taxonomy and evaluate 23 strategies and a grid segmentation baseline based on nine criteria: connectivity, compactness, delineation, control over the number of superpixels, color homogeneity, robustness, running time, stability, and visual quality. Our experiments show the trends of each approach in superpixel segmentation and discuss individual trade-offs. Finally, we provide a new benchmark for superpixel assessment, available at https://github.com/IMScience-PPGINF-PucMinas/superpixel-benchmark .
11 August 2020 in IEEE Signal Processing Letters
As constituent parts of image objects, superpixels can improve several higher-level operations. However, image segmentation methods might have their accuracy severely compromised for reduced numbers of superpixels. To mitigate the problem, we introduce Dynamic Iterative Spanning Forest (DISF), a seed-based method that improves all components in the Iterative Spanning Forest (ISF) framework for superpixel segmentation. DISF relies on a new strategy for seed estimation that can find more relevant seeds, reconstruct relevant edges along with iterations, and guarantee the desired number of superpixels. DISF also assures optimal spanning forests for path costs based on dynamic arc-weight estimation, being faster as the desired number of superpixels grows. We show that DISF can improve effectiveness on three datasets with distinct object properties, requiring significantly fewer iterations than all seed-based baselines.
17 January 2025 in Journal of the Brazilian Computer Society
Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload. However, classical methods do not incorporate information about the desired object. Deep-learning-based approaches consider object information, but their delineation performance depends on data annotation. Additionally, the computational time of object-based methods is usually much higher than desired. In this work, we propose a novel superpixel framework which exploits object information being able to generate a multiscale segmentation on-the-fly. Our method starts off from seed oversampling and repeats optimal connectivity-based superpixel delineation and object-based seed removal until a desired number of superpixels is reached. It generalizes recent superpixel methods, surpassing them and other state-of-the-art approaches in efficiency and effectiveness according to multiple delineation metrics.