loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06)
A Fast Algorithm for Color Image Segmentation
Beijing, China
August 30-September 01
ISBN: 0-7695-2616-0
ASCII Text
x 
 
Liju Dong, Philip Ogunbona, Wanqing Li, Ge Yu, Linan Fan, Gang Zheng, "A Fast Algorithm for Color Image Segmentation," Innovative Computing ,Information and Control, International Conference on, vol. 2, pp. 685-688, First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICICIC.2006.192,
author = {Liju Dong and Philip Ogunbona and Wanqing Li and Ge Yu and Linan Fan and Gang Zheng},
title = {A Fast Algorithm for Color Image Segmentation},
journal ={Innovative Computing ,Information and Control, International Conference on},
volume = {2},
year = {2006},
isbn = {0-7695-2616-0},
pages = {685-688},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICICIC.2006.192},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Innovative Computing ,Information and Control, International Conference on
TI - A Fast Algorithm for Color Image Segmentation
SN - 0-7695-2616-0
SP685
EP688
A1 - Liju Dong,
A1 - Philip Ogunbona,
A1 - Wanqing Li,
A1 - Ge Yu,
A1 - Linan Fan,
A1 - Gang Zheng,
PY - 2006
KW - null
VL - 2
JA - Innovative Computing ,Information and Control, International Conference on
ER -
 
Liju Dong, University of Wollongong, Australia
Philip Ogunbona, University of Wollongong, Australia
Wanqing Li, University of Wollongong, Australia
Ge Yu, Northeastern University, China
Linan Fan, Shenyang University
Gang Zheng, University of Wollongong, Australia
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.
Citation:
Liju Dong, Philip Ogunbona, Wanqing Li, Ge Yu, Linan Fan, Gang Zheng, "A Fast Algorithm for Color Image Segmentation," icicic, vol. 2, pp.685-688, First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.