计算机科学 ›› 2012, Vol. 39 ›› Issue (3): 246-248.

• 图形图像 • 上一篇    下一篇

基于谱聚类的多闭值图像分割方法

邹小林,陈伟福,冯国灿,刘志勇,汤鑫   

  1. (中山大学数学与计算科学学院 广州 510275);(肇庆学院数学与信息科学学院 肇庆 526061); (广东省计算科学重点实验室 广州 5102750);(深圳职业技术学院工业中心 深圳 518055)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Image Segmentation of Multilevel Thresholding Based on Spectral Clustering

  • Online:2018-11-16 Published:2018-11-16

摘要: 阂值法是图像分割的一种重要方法,在图像处理与目标识别中广为应用。因此,如何确定阂值是图像分割的 关键。提出了一种新的图像阂值分割方法,即通过采用新的相似度函数的谱聚类算法(Dcut)确定图像阂值。采用基 于灰度级的权值矩阵代替常用的基于图像像素级的权值矩阵描述图像像素的关系,因而算法需要的存储空间及实现 的复杂性与其它基于图的图像分割方法相比大大减少。实验表明,该方法分割图像的时间少,且能够单阂值和多阂值 分割图像,与现有的阂值分割方法相比,其具有更为优越的分割性能。

关键词: 图像阂值分钊,多阂值,谱聚类,Dcut

Abstract: The thresholding is an important form of image segmentation and is used in many applications that involve image processing and object recognition. hhus, it is crucial to how to acquire a threshold of image segmentation. A novelmultilevel thresholding algorithm was presented in order to improve image segmentation performance at lower computational cost. hhe proposed algorithm determines the thresholdings by spectral clustering algorithm called Dcut that uses a new similarity function. hhe weight matrices used in evaluating the graph cuts arc based on the gray levels of an image, rather than the commonly used image pixels. For most images, the number of gray levels is much smaller than the number of pixels. Therefore, proposed algorithm occupies much smaller storage space and requires much lower com- putational costs and implementation complexity than other graph-based image segmentation algorithms. A large number of examples were presented to show the superior performance by using the proposed multilevel thrcsholding algorithm compared to existing thresholding algorithms.

Key words: Image thresholding segmentation, Multilevel thresholding, Spectral clustering, Dcut

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!