首页 | 本学科首页   官方微博 | 高级检索  
     

基于图划分的图像直方图聚类分割
引用本文:闫成新,桑农,张天序.基于图划分的图像直方图聚类分割[J].计算机应用,2005,25(3):570-572.
作者姓名:闫成新  桑农  张天序
作者单位:1. 石油大学(华东)机电工程学院; 2.华中科技大学图像识别与人工智能研究所
基金项目:国家自然科学基金资助项目(60135020)
摘    要:传统的基于图论的图像分割方法都是直接对图像灰度数据进行聚类分割,算法计算量较大。提出一种新的基于图论的直方图聚类分割算法,算法对图像直方图数据进行聚类,并由此得到分割阈值。由于输入值为直方图数据而不是图像灰度,数据量最大为 256而与像素数无关。实验研究表明,本方法在分割质量基本不变的情况下使得计算量大为减少。

关 键 词:图像分割    图论    直方图    聚类
文章编号:1001-9081(2005)03-0570-03

Image segmentation by graph partition on histogram clustering
YAN Cheng-xin,Sang Nong,ZHANG Tian-xu.Image segmentation by graph partition on histogram clustering[J].journal of Computer Applications,2005,25(3):570-572.
Authors:YAN Cheng-xin  Sang Nong  ZHANG Tian-xu
Affiliation:1. College of Machinery and Eletronic Engineering, University of Petroleum (East China), Dongying Shandong 257061, China; 2. Institute for Pattern Recognition & Artificial Intelligence, Huazhong University of Science & Technology, Wuhan Hubei 430074, China
Abstract:In traditional graph theory based image segmentation methods,the grayscale value of an image is processed directly to obtain clustering results, but the computing time of these methods is very large. A novel segmentation method based on graph partition on histogram clustering was presented. The proposed algorithm obtained threshold by clustering histogram potential function. Since the input is histogram data, the computation time will not be affected by the image size. Experiment results demonstrate that the computation time can be significantly reduced by the proposed algorithm.
Keywords:image segmentation  graph theory  histogram  clustering
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号