首页> 外文学位 >A Clustering Approach for Color Texture Segmentation.
【24h】

A Clustering Approach for Color Texture Segmentation.

机译:一种颜色纹理分割的聚类方法。

获取原文
获取原文并翻译 | 示例

摘要

The segmentation of natural images into perceptually uniform regions remains a challenging task. There is a substantial literature on color image segmentation, but there has been relatively little work on texture. A recently proposed perceptually-based color-texture segmentation algorithm achieves good performance on a wide variety of natural images. However, the computational requirements are quite substantial. The challenge, and primary goal of this thesis, is to develop computationally efficient algorithms without significant sacrifices in performance. The proposed approach is based on the observation that most natural textures consist of one or two dominant colors, and that the probability of having a third or even fourth dominant color is very low and can be negligible. We present a novel feature-aligned dominant-color-based clustering algorithm for image segmentation, which is aimed at segmenting natural scenes into perceptually uniform regions. The proposed approach uses the well-established adaptive clustering algorithm (ACA) to obtain spatial adaptive dominant colors, and relies on the two-dominant color representation of perceptually uniform textures to obtain a compact feature representation for each pixel in the image. At the core of the proposed algorithm, is a feature-aligned clustering algorithm, which is a generalization of ACA to include perceptually uniform textured regions in addition to regions of slowly varying colors. Like ACA, it includes adaptation to local image characteristics and spatial constraints in the form of Markov random fields. The initial step of the proposed feature-aligned adaptive clustering algorithm is a new feature-aligned K-means algorithm.;Experimental results with natural images indicate that the performance of the proposed approach is comparable to or better than the perceptually-based color-texture segmentation algorithm mentioned above, and comes at a drastically lower computational cost. We also show that the proposed approach outperforms other color-texture segmentation techniques.
机译:将自然图像分割成感知上均匀的区域仍然是一项艰巨的任务。关于彩色图像分割的文献很多,但是关于纹理的工作却很少。最近提出的基于感知器的颜色纹理分割算法在各种自然图像上均具有良好的性能。但是,计算要求相当大。本文的挑战和主要目标是开发一种计算效率高的算法,而又不牺牲性能。所提出的方法基于以下观察:大多数自然纹理由一种或两种主色组成,并且具有第三或什至第四主色的可能性非常低并且可以忽略不计。我们提出了一种新颖的基于特征对齐的基于主色的聚类算法,用于图像分割,该算法旨在将自然场景分割成可感知的均匀区域。所提出的方法使用公认的自适应聚类算法(ACA)获得空间自适应主色,并依靠感知均匀纹理的双主色表示来获得图像中每个像素的紧凑特征表示。提出的算法的核心是特征对齐的聚类算法,它是ACA的概括,除了颜色变化缓慢的区域外,还包括感知均匀的纹理区域。像ACA一样,它包括以马尔可夫随机场的形式适应局部图像特征和空间约束。提出的特征对齐自适应聚类算法的第一步是一种新的特征对齐K均值算法。自然图像的实验结果表明,该方法的性能与基于感知的颜色纹理相当或更好。上面提到的分割算法,计算成本大大降低。我们还表明,所提出的方法优于其他颜色纹理分割技术。

著录项

  • 作者

    He, Lulu.;

  • 作者单位

    Northwestern University.;

  • 授予单位 Northwestern University.;
  • 学科 Engineering Electronics and Electrical.;Engineering Computer.
  • 学位 Ph.D.
  • 年度 2012
  • 页码 73 p.
  • 总页数 73
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号