A Fast Algorithm for Color Image Segmentation
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2（2006）
摘要
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
更多查看译文
关键词
clustering result,integer based lookup table implementation,pattern clustering,original k-means algorithm,color image segmentation,image color analysis,k-means clustering algorithm,image segmentation,color image,upper layer,fast algorithm,proposed algorithm,improved k-means,comparable segmentation result,lower layer,image colour analysis,two-layer pyramid structure,lookup table,k means,k means algorithm,k means clustering algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要