Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Hill-Climbing Algorithm for Efficient Color-Based Image Segmentation
60
Zitationen
1
Autoren
2003
Jahr
Abstract
In this paper, we present a novel image segmentation method that produces a set of visually coherent regions. The method is based on a hill-climbing approach and achieves the segmentation by performing two main tasks. First, the hill-climbing algorithm detects local maxima of clusters in the global three-dimensional color histogram of an image. Then, the algorithm associates the pixels of an image with the detected local maxima; as a result, several visually coherent segments are generated. The segmentation algorithm is simple and fast. Moreover, the whole segmentation process is performed without any hand-tuning of parameters. This method does not assume any a priori knowledge on the number of clusters or the content of an image.
Ähnliche Arbeiten
ImageNet: A large-scale hierarchical image database
2009 · 61.466 Zit.
ImageNet Large Scale Visual Recognition Challenge
2015 · 40.046 Zit.
Learning Multiple Layers of Features from Tiny Images
2024 · 25.472 Zit.
Textural Features for Image Classification
1973 · 22.413 Zit.
Pattern Classification
2012 · 19.520 Zit.