A fast algorithm for color image segmentation

Authors

L. Dong, University of WollongongFollow
P. Ogunbona, University of WollongongFollow
Wanqing Li, University of WollongongFollow
G. Yu, Northeastern University, China
L. Fan, Shenyang University, China
G. Zheng, University of WollongongFollow

RIS ID

17836

Publication Details

This article was originally published as: Dong, L, Ogunboba, P, Li, W, et al, A Fast Algorithm for Color Image Segmentation, First International Conference on Innovative Computing, Information and Control 2006 (ICICIC '06), 30 August-1 September 2006, 2, 685-688. Copyright IEEE 2006.

Abstract

Based on K-means and a two-layer pyramid structure, a fast algorithm is proposed for color image segmentation. The algorithm employs two strategies. Firstly, a two-layer structure of a color image is established. Then, an improved K-means with integer based lookup table implementation is applied to each layer. The clustering result on the upper layer (lower resolution) is used to guide the clustering in the lower layer (higher resolution). Experiments have shown that the proposed algorithm is significantly faster than the original K-means algorithm while producing comparable segmentation results.