Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Real-Time Superpixel Segmentation by DBSCAN Clustering Algorithm
371
Zitationen
6
Autoren
2016
Jahr
Abstract
In this paper, we propose a real-time image superpixel segmentation method with 50 frames/s by using the density-based spatial clustering of applications with noise (DBSCAN) algorithm. In order to decrease the computational costs of superpixel algorithms, we adopt a fast two-step framework. In the first clustering stage, the DBSCAN algorithm with color-similarity and geometric restrictions is used to rapidly cluster the pixels, and then, small clusters are merged into superpixels by their neighborhood through a distance measurement defined by color and spatial features in the second merging stage. A robust and simple distance function is defined for obtaining better superpixels in these two steps. The experimental results demonstrate that our real-time superpixel algorithm (50 frames/s) by the DBSCAN clustering outperforms the state-of-the-art superpixel segmentation methods in terms of both accuracy and efficiency.
Ähnliche Arbeiten
A Computational Approach to Edge Detection
1986 · 28.723 Zit.
Textural Features for Image Classification
1973 · 22.226 Zit.
Automated Anatomical Labeling of Activations in SPM Using a Macroscopic Anatomical Parcellation of the MNI MRI Single-Subject Brain
2002 · 16.579 Zit.
Normalized cuts and image segmentation
2000 · 15.553 Zit.
Nonlinear total variation based noise removal algorithms
1992 · 15.418 Zit.