Interactively multiphase image segmentation based on variational formulation and graph cuts

In this paper the multiple piecewise constant (MPC) active contour model is extended to deal with multiphase case. This proposed multiphase model can be effectively optimized by solving the minimum cuts problem of a specially devised multilayer graph. Based on the proposed energy functional and its graph cuts optimization, an interactively multiphase partition method for image segmentation is presented. The user places some scribbles with different colors on the image according to the practical application demand and each group of scribbles with the same color corresponds to a potential image region. The distribution of each region can be learned from the input scribbles with some particular color. Then the corresponding multilayer graph can be constructed and its minimum cuts can be computed to determine the segmentation result of the image. Numerical experiments show that the proposed interactively multiphase segmentation method can accurately segment the image into different regions according to the input scribbles with different color.     

模糊C 均值聚类与多相水平集图割优化相结合的图像分割

针对在分割多个目标时多相水平集模型对初始轮廓曲线敏感且计算量大的问题, 提出采用模糊C 均值聚类算法将图像进行粗分割,初始化多相水平集函数,使用图割算法分割 出多相结果的方法。该方法能有效减小多相水平集算法对初始轮廓曲线的敏感性,使图割算法 在分割图像时更容易分割出理想的目标轮廓;同时,采用图割算法可使水平集函数很快收敛到 能量最小值,有效减少计算量,提高计算效率。实验表明该方法具有较好地分割效果和较高地 分割效率。     

Multiple piecewise constant with geodesic active contours (MPC-GAC) framework for interactive image segmentation using graph cut optimization

This paper proposes an improved variational model, multiple piecewise constant with geodesic active contour (MPC-GAC) model, which generalizes the region-based active contour model by Chan and Vese, 2001 [11] and merges the edge-based active contour by Caselles et al., 1997 [7] to inherit the advantages of region-based and edge-based image segmentation models. We show that the new MPC-GAC energy functional can be iteratively minimized by graph cut algorithms with high computational efficiency compared with the level set framework. This iterative algorithm alternates between the piecewise constant functional learning and the foreground and background updating so that the energy value gradually decreases to the minimum of the energy functional. The k-means method is used to compute the piecewise constant values of the foreground and background of image. We use a graph cut method to detect and update the foreground and background. Numerical experiments show that the proposed interactive segmentation method based on the MPC-GAC model by graph cut optimization can effectively segment images with inhomogeneous objects and background.     

融合区域合并和Graph Cuts的彩色图像分割方法

针对使用Graph Cuts方法对图像进行分割极大影响分割精度这一问题,提出了一种新的融合区域分级合并和Graph Cuts的彩色图像分割算法。该算法首先使用均值漂移算法对图像进行初始分割,将原图像分割为具有较好边界的同质区域;然后,通过计算区域相似度对区域进行分级合并,之后构建精简的加权图,并使用Graph Cuts进行分割。多幅彩色图像的分割实验结果证明,所提算法具有较好的分割效果。     

多相图像分割Vese-Chan模型连续最大流方法

目的 多相图像分割是图像处理与分析的重要问题,变分图像分割的Vese-Chan模型是多相图像分割的基本模型,由于该模型使用较少的标签函数构造区域划分的特征函数,具有求解规模小的优点。图割（graph cut,GC）算法可将上述能量泛函的极值问题转化为最小割/最大流问题求解,大大提高了计算效率。连续最大流（continuous max-flow,CMF）方法是经典GC算法的连续化表达,不仅具备GC算法的高效性,且克服了经典GC算法由于离散导致的精度下降问题。本文提出基于凸松弛的多相图像分割Vese-Chan模型的连续最大流方法。方法 根据划分区域编号的二进制表示构造两类特征函数,将多相图像分割转化为多个交替优化的两相图像分割问题。引入对偶变量将Vese-Chan模型转化为与最小割问题相对应的连续最大流问题,并引入Lagrange乘子设计交替方向乘子方法（alternating direction method of multipliers,ADMM）,将能量泛函的优化问题转化为一系列简单的子优化问题。结果 对灰度图像和彩色图像进行数值实验,从分割效果看,本文方法对于医学图像、遥感图像等复杂图像的分割效果更加精确,对分割对象和背景更好地分离;从分割效率看,本文方法减少了迭代次数和运算时间。在使用2个标签函数的分割实验中,本文方法运算时间加速比分别为6.35%、10.75%、12.39%和7.83%;在使用3个标签函数的分割实验中,运算时间加速比分别为12.32%、15.45%和14.04%;在使用4个标签函数的分割实验中,运算时间加速比分别为16.69%和20.07%。结论 本文提出的多相图像分割Vese-Chan模型的连续最大流方法优化了分割效果,减少了迭代次数,从而提高了计算效率。     

基于多层水平集函数的三维多相图像分割

多相图像分割通常利用多个水平集函数分别定义不同区域的特征函数,其极值求解问题需要对多个函数分别求极值,计算效率较低。针对三维多相图像,提出一种改进的变分水平集模型,采用一个多层水平集函数的n层水平集隐式曲面,将图像划分为n个区域,通过对一个水平集函数求极值,实现三维多相分段常值图像的快速分割与重建。将能量泛函表达为数据项和规则项,借助规则化Heaviside函数设计区域划分的通用特征函数,采用Split-Bregman投影方法进行能量最小化求解。实验结果表明,该模型可以有效地实现三维多相图像分割,与Chan-Vese模型相比,其迭代步数较少,分割速度较快。     

基于图割的低景深图像自动分割

结合图割算法,提出了一种针对低景深(Depth of field, DOF)图像的自动分割模型.首先,通过改进的点锐度算法得到图像的点锐度图, 并结合图像的颜色特征,得到一个四维的特征向量.其次, 通过对图像点锐度图强边缘的计算,利用图像清晰部分边缘较连续, 模糊部分边缘较弱、连续性较差的特点得到图像初步的前景/背景区域. 然后,对前景/背景的颜色和点锐度特征进行高斯混合模型(Gaussian mixture model, GMM)建模,结合全局、局部自适应的λ值,对图割算法的Shrinking bias 现象进行改善.最后,通过迭代的图割算法对前景/背景区域进行修正. 实验结果表明,该模型鲁棒性较高,分割结果更加精确.     

模糊相关图割的非监督层次化彩色图像分割

目的 基于阈值的分割方法能根据像素的信息将图像划分为同类的区域,其中常用的最大模糊相关分割方法,因能利用模糊相关度量划分的适当性,得到较好的分割结果,而广受关注。然而该算法存在划分数需预先确定,阈值的分割结果存在孤立噪声,无法对彩色图像实施分割的问题。为此,提出基于模糊相关图割的非监督层次化分割策略来解决该问题。方法 算法首先将图像划分为若干超像素,以提高层次化图像分割的效率;随后将快速模糊相关算法与图割结合,构成模糊相关图割2-划分算子,在确保分割效率的基础上,解决单一阈值分割存在孤立噪声的问题;最后设计了自顶向下层次化分割策略,利用构建的2-划分算子选择合适的区域及通道,迭代地对超像素实施层次化分割,直到算法收敛,划分数自动确定。结果 对Berkeley分割数据库上300幅图像进行了测试,结果表明算法能有效分割彩色图像,分割精度优于Ncut、JSEG方法,运行时间较这两种方法也提高了近20%。结论 本文算法为最大模糊相关算法在非监督彩色图像分割领域的应用提供指导依据,能用于目标检测和识别领域。     

A novel multiphase active contour model for inhomogeneous image segmentation

The problem of image segmentation has been investigated with a focus on inhomogeneous multiphase image segmentation. Intensity inhomogeneity is an undesired phenomenon that represents the main obstacle for magnetic resonance (MR) and natural images segmentation. The complex images usually contain an arbitrary number of objects. This paper presents a new multiphase active contour model method for simultaneous regions classification of MR images and natural images without bias field correction. In this model, a simple and effective initialization method is taken to speed up the curve evolution toward final results; a new multiphase level set method is proposed to segment the multiple regions. This model not only extracts multiple objects simultaneously, but also provides smooth and accurate boundaries of the objects. The results for experiments on several synthetic and real images demonstrate the effectiveness and accuracy of our model.     

基于两段多组件图割的非监督彩色图像分割算法

提出基于两段多组件图割的彩色图像分割算法,以解决因标签过多和噪声导致的过分割和图割算法低效等问题.多组件图割算法分割图像时,把标签相同的区域处理为该标签的多个组件,结合两层高斯金字塔形成两段多组件图割,以减少分割错误和标签数量,提高分割的性能.算法首先提取基于多尺度四元数Gabor滤波的texton纹理特征,并自适应融合颜色特征;然后使用两段多组件图割获取图像的优化分割,其中,为了引导图割优化的方向,在平滑项中引入彩色梯度信息;最后去除分割结果中的弱边界,获得最终的分割结果.实验结果表明,相对于比较算法,新算法的分割性能有明显提升.     

基于空间模式聚类最大熵图像分割算法研究

研究图像分割优化问题,在分割图像中,提取信息受到各种因素影响,分割效果不理想。针对图像分割计算复杂,造成图像分割分辨率低,清晰度不高。同时,当图像中的信息量非常大时,图像分割非常耗时。为了有效地分割图像,提出了一种基于空间模式聚类和最大熵算法原理相结合的图像分割方法。首先对图像采用最大熵算法进行图像分割,为每个熵区域定义特征量。根据不同的特征量计算相似区域之间的欧氏距离和空间距离,从而确定像素聚类中心的距离。然后对分割后的图像区域采用基于空间模式聚类方案进行合并,并对图像进行二值化处理。仿真表明与传统图像分割相比,提高了分割效率,分割出的图像边缘效果清晰,证明了算法的可行性和有效性。     

Unsupervised multiphase segmentation: A recursive approach

We propose an unsupervised multiphase segmentation algorithm based on Bresson et al.’s fast global minimization of Chan and Vese’s two-phase piecewise constant segmentation model. The proposed algorithm recursively partitions a region into two subregions, starting from the largest scale. The segmentation process automatically terminates and detects when all the regions cannot be partitioned further. The number of regions is not given and can be arbitrary. Furthermore, this method provides a full hierarchical representation that gives a structure of a given image.     

基于多尺度分析和均值漂移的Kway-Ncut算法

提出一种基于多尺度分析和均值漂移的谱聚类算法.该算法以Kway-Ncut算法为基础,通过缩小待分割图片的分辨率来实现快速和对大分辨率图片的分割.首先,利用均值漂移算法对图片进行预分割,随后缩减图像和预分割结果的分辨率.再利用预分割提供的先验信息和像素的空间一致性构建相似度模型,计算缩小后的图片像素相似度,使用Kway-Ncut进行分割.最后,将分割结果扩展为原始分辨率,用原始分辨率的预分类信息对图像边界及细节部分加以恢复,获得最终的分割结果.通过使用多幅彩色图像进行分割实验,结果表明文中算法在准确性和高效性方面都有良好表现.     

Image segmentation by iterated region merging with localized graph cuts

This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide class of energy functions. However, the extraction of objects in a complex background often requires a lot of user interaction. The proposed algorithm starts from the user labeled sub-graph and works iteratively to label the surrounding un-segmented regions. In each iteration, only the local neighboring regions to the labeled regions are involved in the optimization so that much interference from the far unknown regions can be significantly reduced. Meanwhile, the data models of the object and background are updated iteratively based on high confident labeled regions. The sub-graph requires less user guidance for segmentation and thus better results can be obtained under the same amount of user interaction. Experiments on benchmark datasets validated that our method yields much better segmentation results than the standard graph cuts and the Grabcut methods in either qualitative or quantitative evaluation.     

基于SLIC的自适应多主体图像分割算法

为了解决多主体图像分割的交互分割问题,提出了一种基于SLIC超像素的自适应图像分割算法。首先利用SLIC对图像进行超像素分割处理,把原图像分割为大小相似、形状规则的超像素,以超像素中心点的五维特征值作为原始数据点通过自适应参数的DBSCAN算法聚类,确定多主体数目和分割边界。算法不需要用户交互,自适应确定分割数目。为了验证算法的有效性,在伯克利大学标准数据集BSDS500上与人工标注的分割图像进行比较, 前期的超像素处理使算法在时间上有很好的提升,对于一幅481×321像素的图像,只需要1.5 s就可以获得结果。实验结果表明,该方法可以有效解决多主体图像分割中的人工交互问题,同时在PRI和VOI的指数对比上也优于传统算法,本文算法可以在保证分割效果的基础上自适应确定分割数目,提高分割效率。     

Interactive image segmentation by matching attributed relational graphs

A model-based graph matching approach is proposed for interactive image segmentation. It starts from an over-segmentation of the input image, exploiting color and spatial information among regions to propagate the labels from the regions marked by the user-provided seeds to the entire image. The region merging procedure is performed by matching two graphs: the input graph, representing the entire image; and the model graph, representing only the marked regions. The optimization is based on discrete search using deformed graphs to efficiently evaluate the spatial information. Note that by using a model-based approach, different interactive segmentation problems can be tackled: binary and multi-label segmentation of single images as well as of multiple similar images. Successful results for all these cases are presented, in addition to a comparison between our binary segmentation results and those obtained with state-of-the-art approaches. An implementation is available at http://structuralsegm.sourceforge.net/.     

Perceptual hashing for SAR image segmentation

Image segmentation is an important step in the implementation of the interpretation of synthetic aperture radar (SAR) image due to speckle. This article proposes a SAR image segmentation method based on perceptual hashing. The new algorithm is divided into two phases. The first phase is to obtain initial regions with multi-thresholding based on histogram after reducing the speckle noise. The initial regions are used as input data. And the next phase is to merge regions according to the similarity between regions. In this phase, to segment SAR image effectively, the proposed hashing algorithm is used to obtain hash value and similarity between regions, which preserve the texture features of SAR images. In addition, we can obtain a smooth segmentation result by reducing the redundant information with principal component analysis. Furthermore, morphological methods are used to eliminate the uneven background in the segmentation results. These improvements make our algorithm more effective to segment the images with high speed. The experimental results of four real and one synthetic SAR images verify the efficiency of our algorithm.     

Segmentation of psoriasis vulgaris images using multiresolution-based orthogonal subspace techniques.

In this paper, a method is proposed for the segmentation of color images using a multiresolution-based signature subspace classifier (MSSC) with application to psoriasis images. The essential techniques consist of feature extraction and image segmentation (classification) methods. In this approach, the fuzzy texture spectrum and the two-dimensional fuzzy color histogram in the hue-saturation space are first adopted as the feature vector to locate homogeneous regions in the image. Then these regions are used to compute the signature matrices for the orthogonal subspace classifier to obtain a more accurate segmentation. To reduce the computational requirement, the MSSC has been developed. In the experiments, the method is quantitatively evaluated by using a similarity function and compared with the well-known LS-SVM method. The results show that the proposed algorithm can effectively segment psoriasis images. The proposed approach can also be applied to general color texture segmentation applications.