直方图模糊约束FCM聚为自适应多阈值图像分割

本文提出了一种新的有效的图像多阈值分割方法,该方法通过对模糊约束直方图目标函数的优化,获得一个最佳模糊约束Ｃ－划分,根据最大录属度原则进行图像多阈值化,文中对得以的模糊划分函数进行了分析,同时还讨论了直方图划分类数的自适应确定问题最给出了几个典型的实验,理论分析和实验表明了本文方法具有速度快、划分特性良好,鲁棒性绐的特点。     

基于平滑性测度的直方图自适应模糊增强图像分割

本文提出了一种新的基于平滑性测度的直方图自适应模糊增强图像分割方法。该方法通过定义图像的平滑性测度,采用模糊增强技术对图像的灰度直方图进行增强,然后在增强的直方图上,利用自适应多阈值分割方法进行图像分割。实验表明,该方法对强噪声图像具有良好的分割效果。     

模糊划分熵的新定义及其在图像分割中的应用

介绍了模糊划分的原理,提出用条件概率与条件熵定义模糊划分的熵,并基于最大熵原理设计了一种新的灰度直方图阈值选取算法。比较可见ＫＳＷ熵法是本文方法的一个特例,本文方法是ＫＳＷ熵法在模糊集上的推广,对几例真实目标图像的对比分割实验结果表明本文方法性能优越。     

用基函数神经网络实现多阈值图象分割

本文介绍了一种用基函数神经网络实现多阈值图象分割的新方法。它从函数逼近的角度研究基于灰度直方图的多阈值分割问题，提出了一种模糊反向传播学习算法，采用该算法的高斯基函数网络能够准确检测直方图中包含的子区域和它们的分布函数，而且速度很快。实验表明本文的方法在实际图象分割中是有效的。     

一种遗传算法优化的图像模糊边缘检测方法

提出了一种遗传算法优化的图像模糊边缘检测方法.首先利用方向模板对图像进行卷积,求得梯度图像.然后对梯度图像的直方图进行模糊化,针对模糊窗宽参数的选取困难,根据图像确定了模糊函数窗宽的范围,利用遗传算法的全局搜索性能进行阈值的搜索,并利用最小图像模糊率来确定最优阈值.根据得到的阈值对梯度图像进行分割,得到图像的边缘.结果表明,边缘检测效果较好,显著提高了运算速度.     

基于最大模糊熵的红外图像边缘检测算法

针对红外图像边缘检测这一难题,结合红外图像及其梯度图像的特点,在红外梯度图像模糊划分的基础上,提出了一种基于最大模糊熵的红外图像边缘检测方法.首先通过改进传统Sobel算子构造出红外图像的梯度图并研究其直方图特点,然后对其进行自然模糊划分,最后根据最大模糊熵准则确定最优模糊参数,进而确定梯度图像的最佳分割阈值,从而实现边缘提取.与传统的基于梯度的边缘检测算法进行对比实验,结果表明,该方法用于红外图像边缘检测能获得更好的效果.     

快速二维累积剩余Tsallis熵阈值分割方法

对灰度直方图呈现为双峰的图像，传统的二维直方图阈值分割方法虽然比较有效，但在灰度直方图呈现为无峰、单峰或多峰模式时，它们的分割结果较差。考虑到经过二维直方图映射得到的二维生存函数存在密度连续和形态统一等优点，本文基于图像二维生存函数提出一种快速二维累积剩余Tsallis熵阈值分割方法。该方法首先基于二维直方图构造二维生存函数，然后在二维生存函数的基础上定义计算分割阈值的二维累积剩余Tsallis熵目标函数。通过递推算法将计算目标函数的时间复杂度降为O (L²)。最后，基于递推形式的二维累积剩余Tsallis熵准则得到最优阈值向量以进行阈值分割。在26幅合成图像和76幅真实世界图像上将提出的方法与2种快速二维阈值分割方法、2种聚类分割方法以及1种活动轮廓分割方法分别在时间和误分类率(Misclassification Error,ME)2个指标下进行了比较。实验结果表明，在合成图像和真实世界图像中，相比于性能第2的方法，本文方法的时间平均缩短0.013 s,ME值平均降低0.051～0.089。提出的快速二维累积剩余Tsallis熵阈值分割方法不仅在计算效率方面优于...     

基于图像模糊熵邻域非一致性的过渡区提取与分割

 本文提出了一种基于图像模糊熵邻域非一致性的过渡区直接提取和分割算法.通过求出图像中介于目标和背景之间的过渡区,根据过渡区直方图获得一个最佳分割阈值.构造了描述模糊划分的隶属函数,模糊熵及其邻域非一致性测度.本文算法摆脱了传统图像过渡区提取算法对噪声比较敏感且受剪切值L_low与L_high的限制.理论分析和实验结果表明,本文算法具有速度快,抗噪声性能好和稳健性强等特点,优于现有其它基于过渡区提取和分割算法.     

基于加权模糊c均值聚类与统计检验指导的 多阈值图像自动分割算法

图像分割是计算机视觉中一个重要的研究课题.本文提出一种基于直方图的多阈值灰度图像自动分割方法,该方法利用加权模糊c-均值聚类算法快速实现分割过程,同时通过单峰统计检验指导来自动确定多阈值的合适数目.实验结果表明了该方法的有效性.     

基于改进PSO算法的Otsu快速多阈值图像分割

为了确定图像分割的最佳阈值,基于改进粒子群优化算法,提出了一种快速多阈值图像分割方法。首先引入独立峰值将直方图划分为若干区域,然后在各个区域使用最大类间方差法得到优化的目标函数,用具有非均匀变异特性和雁群飞行启示的线性递减惯性权重粒子群算法对目标函数进行优化,得到分割的最佳阈值,并用该阈值对图像进行分割。将分割结果与常规最大类问方差法的多阈值分割结果相比较,证明该算法不仅可以正确地实现图像分割,并可使分割速度大大提高。     

Automated seeded lesion segmentation on digital mammograms

Segmenting lesions is a vital step in many computerized mass-detection schemes for digital (or digitized) mammograms. The authors have developed two novel lesion segmentation techniques-one based on a single feature called the radial gradient index (RGI) and one based on simple probabilistic models to segment mass lesions, or other similar nodular structures, from surrounding background. In both methods a series of image partitions is created using gray-level information as well as prior knowledge of the shape of typical mass lesions. With the former method the partition that maximizes the RGI is selected. In the latter method, probability distributions for gray-levels inside and outside the partitions are estimated, and subsequently used to determine the probability that the image occurred for each given partition. The partition that maximizes this probability is selected as the final lesion partition (contour). The authors tested these methods against a conventional region growing algorithm using a database of biopsy-proven, malignant lesions and found that the new lesion segmentation algorithms more closely match radiologists' outlines of these lesions. At an overlap threshold of 0.30, gray level region growing correctly delineates 62% of the lesions in the authors' database while the RGI and probabilistic segmentation algorithms correctly segment 92% and 96% of the lesions, respectively     

Image coding by adaptive tree-structured segmentation

A new algorithmic approach to segmentation-based image coding is proposed. A good compromise is achieved between segmentation by quadtree-based decomposition and by free region-growing in terms of time complexity and scene adaptability. Encoding is to recursively partition an image into convex n-gons, 3⩽n⩽8, until the pixels in the current n-gon satisfy a uniformity criterion. The recursive partition generates a valid segmentation by aligning the polygon boundaries with image edges. This segmentation is embedded into a binary tree for compact encoding of its geometry. The compressed image is sent as a labeled pointerless binary tree, and decoding is simply polygon filling. High compression ratios are obtained by balancing the accuracy and geometric complexity of the image segmentation, a key issue for segmentation-driven image coding that was not addressed before. Due to its tree structure, the method is also suitable for progressive image coding     

Segmentation of Gabor-filtered textures using deterministicrelaxation

A supervised texture segmentation scheme is proposed in this article. The texture features are extracted by filtering the given image using a filter bank consisting of a number of Gabor filters with different frequencies, resolutions, and orientations. The segmentation model consists of feature formation, partition, and competition processes. In the feature formation process, the texture features from the Gabor filter bank are modeled as a Gaussian distribution. The image partition is represented as a noncausal Markov random field (MRF) by means of the partition process. The competition process constrains the overall system to have a single label for each pixel. Using these three random processes, the a posteriori probability of each pixel label is expressed as a Gibbs distribution. The corresponding Gibbs energy function is implemented as a set of constraints on each pixel by using a neural network model based on Hopfield network. A deterministic relaxation strategy is used to evolve the minimum energy state of the network, corresponding to a maximum a posteriori (MAP) probability. This results in an optimal segmentation of the textured image. The performance of the scheme is demonstrated on a variety of images including images from remote sensing.     

基于混沌蚁群算法的快速红外图像分割

提出了一种基于混沌蚁群算法优化二维模糊划分最大熵的红外图像分割方法。二维模糊划分最大熵分割方法不仅利用了灰度信息以及空间邻域信息,并且兼顾图像自身的模糊性,能取得很好的分割效果,然而最大熵的最优参量组合却很难快速准确地获得。本文将混沌蚁群优化算法应用到二维模糊划分最大熵分割方法当中,充分利用混沌蚁群算法快速寻找最优解的特点,来搜索二维模糊划分最大熵的最优参量组合。实验仿真结果表明,该方法比传统的图像分割方法有更好地分割效果,有效抑制了图像噪声对目标区域分割的干扰。     

一种基于DFC聚类算法的图像分割方法

图像分割是一种重要的图像技术,在理论研究和实际应用中都得到了人们的广泛重视。图像分割的方法和种类很多,有些分割运算可直接应用于任何图像,而另一些只能适用于特殊类别的图像。目前,图像分割的方法层出不穷。其中,最具代表性的图像分割算法是基于FCM聚类算法的图像分割方法。然而FCM聚类算法从理论上来说存在着聚类数目无法自动确定及运算的开销太大的缺点,因而限制了这种方法的应用。针对其不足,本文将FCM聚类算法引入到图像分割方法中。数值实验结果显示：新方法分割图像的效果是良好的。     

An efficient face segmentation algorithm based on binary partition tree

This paper presents an efficient face segmentation algorithm based on binary partition tree. Skin-like regions are first obtained by integrating the results of pixel classification and watershed segmentation. Facial features are extracted by the techniques of valley detection and entropic thresholding, and are used to refine the skin-like regions. In order to segment the facial regions from the skin-like regions, a novel region merging algorithm is proposed by considering the impact of the common border ratio between adjacent regions, and the binary partition tree is used to represent the whole region merging process. Then the facial likeness of each node in the binary partition tree is evaluated using a set of fuzzy membership functions devised for a number of facial primitives of geometrical, elliptical and facial features. Finally, an efficient algorithm of node selecting in the binary partition tree is proposed for the final face segmentation, which can exactly segment the faces without any underlying assumption. The performance of the proposed face segmentation algorithm is demonstrated by experimental results carried out on a variety of images in different scenarios.     

Segmentation by fusion of histogram-based k-means clusters in different color spaces.

This paper presents a new, simple, and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable and accurate segmentation result. The different label fields to be fused in our application are given by the same and simple (K-means based) clustering technique on an input image expressed in different color spaces. Our fusion strategy aims at combining these segmentation maps with a final clustering procedure using as input features, the local histogram of the class labels, previously estimated and associated to each site and for all these initial partitions. This fusion framework remains simple to implement, fast, general enough to be applied to various computer vision applications (e.g., motion detection and segmentation), and has been successfully applied on the Berkeley image database. The experiments herein reported in this paper illustrate the potential of this approach compared to the state-of-the-art segmentation methods recently proposed in the literature.     

Segmentation by Fusion of Histogram-Based $K$-Means Clusters in Different Color Spaces

This paper presents a new, simple, and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable and accurate segmentation result. The different label fields to be fused in our application are given by the same and simple (K-means based) clustering technique on an input image expressed in different color spaces. Our fusion strategy aims at combining these segmentation maps with a final clustering procedure using as input features, the local histogram of the class labels, previously estimated and associated to each site and for all these initial partitions. This fusion framework remains simple to implement, fast, general enough to be applied to various computer vision applications (e.g., motion detection and segmentation), and has been successfully applied on the Berkeley image database. The experiments herein reported in this paper illustrate the potential of this approach compared to the state-of-the-art segmentation methods recently proposed in the literature.     

Extensive partition operators, gray-level connected operators, andregion merging/classification segmentation algorithms: theoretical links

The relation between morphological gray-level connected operators and segmentation algorithms based on region merging/classification strategies has been pointed out several times in the literature. However, to the best of our knowledge, the formal relation between them has not been established. This paper presents the link between the two domains based on the observation that both connected operators and segmentation algorithms share a key mechanism: they simultaneously operate on images and on partitions, and therefore they can be described as operations on a joint image-partition model. As a result, we analyze both segmentation algorithms and connected operators by defining operators on complete product lattices, that explicitly model gray-level and partition attributes. In the first place, starting with a complete lattice of partitions, we initially define the concept of the segmentation model as a mapping in a product lattice, whose elements are three-tuples consisting of a partition, an image that models the partition attributes, and an image that represents the gray-level model associated to the segmentation. Then, assuming a conditional ordering relation, we show that any region merging/classification segmentation algorithm can be defined as an extensive operator in such a complete product lattice, in the second place, we proposed a very similar lattice-based extended representation of gray-level functions in the context of connected operators, that highlights the mathematical analogy with segmentation algorithms, but in which the ordering relation is different. We use this framework to show that every region merging/classification segmentation algorithm indeed corresponds to a connected operator. While this result provides an explanation to previous work in the area, it also opens possibilities for further analysis in the two domains. From this perspective, we additionally study some theoretical properties of a general region merging segmentation algorithm.