基于小波变换和kd树聚类的快速纹理分割算法

计算机应用 ›› 2005, Vol. 25 ›› Issue (01): 114-116.

基于小波变换和kd树聚类的快速纹理分割算法

侯艳丽，杨国胜

河南大学计算机与信息工程学院

发布日期:2005-01-01 出版日期:2005-01-01
基金资助:
河南科委自然科学研究基金项目资助项目(0411013700)

Fast texture segmentation algorithm based on wavelet transform and kd-tree clustering

HOU Yan-li, YANG Guo-sheng

College of Computer and Information Engineering, Henan University

Online:2005-01-01 Published:2005-01-01

摘要/Abstract

摘要：

提出了一种基于小波变换和k均值聚类的快速纹理图像分割算法。该方法包括特征提取、特征平滑、纹理分割三个阶段。其中,特征提取在金字塔结构小波变换的基础上进行;特征平滑利用一种四分法来完成特征图像的噪声平滑和边缘保持;纹理分割则利用kd树作为数据结构来运行k均值聚类算法从而实现纹理图像的快速分割。实验结果表明与直接的k均值聚类算法相比,该方法在运行时间上得到了明显的提高。

关键词: 纹理分割小波变换特征提取k均值聚类

Abstract:

A texture image segmentation algorithm based on wavelet transform and kd-tree clustering was studied in this paper. Firstly, texture features of an image were extracted using wavelet transform. Secondly, an improved algorithm based on quarter partition was given to smooth the texture feature image. Thirdly, the clustering algorithm using the kd-tree data structure was applied to the texture segmentation, and then a fast texture feature clustering effect was achieved. At last, simulations were performed on the presented algorithm, and the simulation result showed that the presented algorithm has lower segmentation error rate, higher accuracy and better in-time performance.

Key words: texture segmentationwavelet transformfeature extractionk-means clustering

侯艳丽，杨国胜. 基于小波变换和kd树聚类的快速纹理分割算法[J]. 计算机应用, 2005, 25(01): 114-116.

HOU Yan-li, YANG Guo-sheng. Fast texture segmentation algorithm based on wavelet transform and kd-tree clustering[J]. Journal of Computer Applications, 2005, 25(01): 114-116.