A new approach for image segmentation using Pillar-Kmeans algorithm

Ali Ridho Barakbah, Yasushi Kiyoki

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper presents a new approach for image segmentation by applying Pillar-Kmeans algorithm. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after optimized by Pillar Algorithm. The Pillar algorithm considers the pillars' placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroids amongst the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in aspects of precision and computation time. It designates the initial centroids' positions by calculating the accumulated distance metric between each data point and all previous centroids, and then selects data points which have the maximum distance as new initial centroids. This algorithm distributes all initial centroids according to the maximum accumulated distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means and Gaussian Mixture Model algorithm and involving RGB, HSV, HSL and CIELAB color spaces. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time.

Original languageEnglish
Pages (from-to)23-28
Number of pages6
JournalWorld Academy of Science, Engineering and Technology
Volume59
Publication statusPublished - 2009 Nov

Fingerprint

Image segmentation
Image resolution
Pressure distribution
Roofs
Color

Keywords

  • Color spaces
  • Image segmentation
  • K-means clustering
  • Pillar algorithm

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A new approach for image segmentation using Pillar-Kmeans algorithm. / Barakbah, Ali Ridho; Kiyoki, Yasushi.

In: World Academy of Science, Engineering and Technology, Vol. 59, 11.2009, p. 23-28.

Research output: Contribution to journalArticle

@article{c8c520e8b9154ed8a4e2206b4199752b,
title = "A new approach for image segmentation using Pillar-Kmeans algorithm",
abstract = "This paper presents a new approach for image segmentation by applying Pillar-Kmeans algorithm. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after optimized by Pillar Algorithm. The Pillar algorithm considers the pillars' placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroids amongst the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in aspects of precision and computation time. It designates the initial centroids' positions by calculating the accumulated distance metric between each data point and all previous centroids, and then selects data points which have the maximum distance as new initial centroids. This algorithm distributes all initial centroids according to the maximum accumulated distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means and Gaussian Mixture Model algorithm and involving RGB, HSV, HSL and CIELAB color spaces. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time.",
keywords = "Color spaces, Image segmentation, K-means clustering, Pillar algorithm",
author = "Barakbah, {Ali Ridho} and Yasushi Kiyoki",
year = "2009",
month = "11",
language = "English",
volume = "59",
pages = "23--28",
journal = "World Academy of Science, Engineering and Technology",
issn = "2010-376X",
publisher = "World Academy of Science Engineering and Technology",

}

TY - JOUR

T1 - A new approach for image segmentation using Pillar-Kmeans algorithm

AU - Barakbah, Ali Ridho

AU - Kiyoki, Yasushi

PY - 2009/11

Y1 - 2009/11

N2 - This paper presents a new approach for image segmentation by applying Pillar-Kmeans algorithm. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after optimized by Pillar Algorithm. The Pillar algorithm considers the pillars' placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroids amongst the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in aspects of precision and computation time. It designates the initial centroids' positions by calculating the accumulated distance metric between each data point and all previous centroids, and then selects data points which have the maximum distance as new initial centroids. This algorithm distributes all initial centroids according to the maximum accumulated distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means and Gaussian Mixture Model algorithm and involving RGB, HSV, HSL and CIELAB color spaces. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time.

AB - This paper presents a new approach for image segmentation by applying Pillar-Kmeans algorithm. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after optimized by Pillar Algorithm. The Pillar algorithm considers the pillars' placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroids amongst the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in aspects of precision and computation time. It designates the initial centroids' positions by calculating the accumulated distance metric between each data point and all previous centroids, and then selects data points which have the maximum distance as new initial centroids. This algorithm distributes all initial centroids according to the maximum accumulated distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means and Gaussian Mixture Model algorithm and involving RGB, HSV, HSL and CIELAB color spaces. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time.

KW - Color spaces

KW - Image segmentation

KW - K-means clustering

KW - Pillar algorithm

UR - http://www.scopus.com/inward/record.url?scp=78650577741&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650577741&partnerID=8YFLogxK

M3 - Article

VL - 59

SP - 23

EP - 28

JO - World Academy of Science, Engineering and Technology

JF - World Academy of Science, Engineering and Technology

SN - 2010-376X

ER -