1. Automatic Superpixel-Based Clustering for Color Image Segmentation Using q-Generalized Pareto Distribution under Linear Normalization and Hunger Games Search.
- Author
-
Abd Elaziz, Mohamed, Abo Zaid, Esraa Osama, Al-qaness, Mohammed A. A., and Ibrahim, Rehab Ali
- Subjects
- *
PARETO distribution , *IMAGE segmentation , *HUNGER , *ALGORITHMS , *KEY performance indicators (Management) - Abstract
Superixel is one of the most efficient of the image segmentation approaches that are widely used for different applications. In this paper, we developed an image segmentation based on superpixel and an automatic clustering using q-Generalized Pareto distribution under linear normalization (q-GPDL), called ASCQPHGS. The proposed method uses the superpixel algorithm to segment the given image, then the Density Peaks clustering (DPC) is employed to the results obtained from the superpixel algorithm to produce a decision graph. The Hunger games search (HGS) algorithm is employed as a clustering method to segment the image. The proposed method is evaluated using two different datasets, collected form Berkeley segmentation dataset and benchmark (BSDS500) and standford background dataset (SBD). More so, the proposed method is compared to several methods to verify its performance and efficiency. Overall, the proposed method showed significant performance and it outperformed all compared methods using well-known performance metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF