一种融合对数极坐标映射和归一化割的图像分割算法

为了缩减归一化割算法中权值矩阵的规模,提出了一种融合对数极坐标和归一化割的图像分割算法。首先将均匀采样的图像映射到对数极坐标系下,然后进行归一化割运算,达到减少时间复杂度、提高算法执行效率的目的。实验结果表明该方法能够取得理想的分割效果。     

结合最大方差比准则和PCNN模型的图像分割

脉冲耦合神经网络（PCNN）模型在图像分割方面有着很好的应用。在各项参数确定的情况下,其分割结果的好坏取决于循环迭代次数的多少,而PCNN模型自身无法实现迭代次数的自动判定。为此提出一种结合最大方差比准则的PCNN迭代次数自动判定算法,用于实现图像的自动分割。算法利用最大方差比准则找到图像的最优分割界限,确定PCNN的迭代次数,获得最优图像分割结果,然后利用最大香农熵准则验证分割结果。实验表明：提出的算法实现了PCNN迭代次数的自动判定,提高了PCNN的迭代速度,运行效率优于基于2D-OTSU和基于交叉熵的自动分割算法,图像分割效果良好。     

活动轮廓最大流最小切分图像分割技术研究

基于活动轮廓的CV模型缺乏边缘的信息,使得CV模型在具有相同或相似区域的彩色图像分割应用时存在困难。对活动轮廓的模型进行扩展,提出了多段活动轮廓模型,应用K均值对交互区域进行聚类,确定分割区域中心的个数,同时得到多段活动轮廓模型进化边缘内外区域的密度值,加入测地线(GAC),使其具有更好的边缘捕获能力,对于图像分割的最优化问题,转化为求能量函数对应的图切分最大流最小切分问题。通过自然图像的实验,验证了提出的方法具有高效性、准确性、耗时少等特点。     

结合小波系数的Normalized Cut分割算法

为了提高normalized cut分割算法的准确率,结合小波系数调整图像的亲和矩阵。首先采用小波系数计算图像的边缘信息,然后使用边缘信息对原始图像构造一个图,求取图的拉普拉斯矩阵的前K个特征值,并对第二个特征值对应的特征向量进行分类,得到最终的分割结果。使用一些自然图像进行了验证,结果证明新方法能提取目标更为细致的细节,保留更多有用的信息。     

Image segmentation with directed trees

This correspondence presents a simple algorithm to detect and label homogeneous areas in an image, using directed trees for region labeling. The scheme constructs directed trees with the image points as nodes, guided by an edge value computed at every point. These directed trees segment the image into disjoint regions. Because of a valley seeldng property of the tree construction procedure, the boundaries separating the resultant segments pass through the center of the edges. The algorithm thus performs wel1 with thick and wide edges of varying height, because no thresholding of the edge image is involved. The properties of the resultant segments are stated in terms of the edge image. The algorithm is shown to be simple, efficient, and effective for detecting homogeneous segments in the presence of noise. Results of application in the algorithm to segment a LANDSAT multispectral scene of an agricultural area are included.     

一种基于Multiway cut的多对象图像分割*

多对象分割是图像处理中的一个难题,基于Multiway cut的图像分割是一种人工交互式多对象分割方法,能够实现图像的粗分割和精确分割。使用分水岭分割图像,把图像分割为属性相似的小区域;根据交互建立节点层次图,构建带权无向网络;不同层次的节点参与不同的运算,采用Multiway cut迭代分割;交互和分割可以多次执行,直至满足用户的要求。实验结果表明,该方法人工参与方便,准确度得到提高,速度满足现场操作的要求。     

遥感图像分割中的信息割算法

提出了一种改进的信息割（MIC）算法。首先证明了信息割（IC）模型与Cauchy-Schwarz cut（CScut）等价,并通过图谱方法给出IC目标函数优化问题的最优解;其次利用 图像中像素点间的灰度和空间关联性,在IC算法的基础上提出一种MIC算法,该算法首次使用联合灰度信息和空间位置信息的Parzen窗函数来估计概率密度函数,降低了图像中灰度 变化对图像分割的影响。加噪合成图像及遥感图像分割实验结果表明MIC算法较IC算法具有更好的抗噪性能,且与图谱方法相比计算复杂度显著降低。     

Image segmentation techniques

There are now a wide variety of image segmentation techniques, some considered general purpose and some designed for specific classes of images. These techniques can be classified as: measurement space guided spatial clustering, single linkage region growing schemes, hybrid linkage region growing schemes, centroid linkage region growing schemes, spatial clustering schemes, and split-and-merge schemes. In this paper, each of the major classes of image segmentation techniques is defined and several specific examples of each class of algorithm are described. The techniques are illustrated with examples of segmentations performed on real images.     

Graph cut segmentation with a statistical shape model in cardiac MRI

Segmenting the right ventricle (RV) in magnetic resonance (MR) images is required for cardiac function assessment. The segmentation of the RV is a difficult task due to low contrast with surrounding tissues and high shape variability. To overcome these problems, we introduce a segmentation method based on a statistical shape model obtained with a principal component analysis (PCA) on a set of representative shapes of the RV. Shapes are not represented by a set of points, but by distance maps to their contour, relaxing the need for a costly landmark detection and matching process. A shape model is thus obtained by computing a PCA on the shape variations. This prior is registered onto the image via a very simple user interaction and then incorporated into the well-known graph cut framework in order to guide the segmentation. Our semi-automatic segmentation method has been applied on 248 MR images of a publicly available dataset (from MICCAI’12 Right Ventricle Segmentation Challenge). We show that encouraging results can be obtained for this challenging application.     

Deep graph cut network for weakly-supervised semantic segmentation

The scarcity of fully-annotated data becomes the biggest obstacle that prevents many deep learning approaches from widely applied.Weakly-supervised visual learn...     

基于最小割的极化特征图像分割

针对极化合成孔径雷达(SAR)所固有的斑点噪声很难分割出精确结果的问题,提出了一种基于图论的极化SAR图像分割方法。该方法结合极化SAR的多个极化特征, 用K均值聚类算法得到像素的初始标号,然后建立一个关于标号的能量函数并构造相应的网络,用最小割方法求取网络中全局能量函数的近似最优解,由此得到每个像素点的恰当标号,最终完成图像的准确分类。该方法与传统的分割方法相比,能够充分考虑极化SAR图像的全局信息和极化特征对图像进行精确的分割。实验结果证明,该算法具有较好的分割效果。     

基于图割的矩形目标交互式分割方法

为得到更加精确的图像分割结果,可以在基于图割的分割框架中引入形状先验指导分割。针对矩形目标提出了一种目标/背景交互式分割方法。分割能量用马尔可夫随机场最大后验概率描述,通过限制有向图中的流向引入形状先验,可以保证图割优化后的分割结果为矩形形状。对仿真图像与真实图像的实验结果证明了该算法的有效性。     

差分演化优化Ncut准则的彩色图像分割

针对解Ncut准则的SM算法寻优能力不足的问题,提出一种基于差分演化优化归一化准则的彩色图像分割算法。首先对彩色图像进行爬山法预分割为多类,并构造类级间的无向完全图,之后再使用二进制差分演化算法求得Ncut准则最小化的图二分,最后通过映射获得图像的二值分割。实验结果表明,在相同预处理情况下,本文的寻优算法与SM算法相比,分割效果更为精准。     

Image segmentation functional model

We propose a new approach of the image segmentation methods. This approach is based on a functional model composed of five elementary blocks called in an iterative process. Different segmentation methods can be decomposed with such a scheme and lead to elementary building blocks with unified functionality and interfaces. We present the decompositions of three segmentation methods and the implementation results, which illustrate the potential of the proposed model. This generic model is a common framework, which makes segmentation techniques more readable and offers new perspectives for the development, the comparison and the implementation of segmentation methods.     

基于分割块的图像语义分割方法

针对复杂室外环境下,传统语义分割模型无法准确描述对象轮廓的问题,提出了采用结构森林法生成边缘概率,运用分水岭算法将边缘概率转化成初始割块.为避免过分分割,利用超度量轮廓图算法选取适当阈值生成分割块以获取更准确的轮廓信息,通过随机森林训练分割块,得到语义分割结果.实验结果表明:在处理复杂的语义分割任务时,基于分割块的方法在精度、鲁棒性和速率方面均具有良好表现.     

结合支持向量机与C均值聚类的图像分割

针对支持向量机进行图像分割时需要用户设定训练样本问题,提出一种根据图像特征使用C均值聚类算法自动获取支持向量机训练样本的方法。首先将图像分成几个区域,对每个区域利用小波分解去掉含有图像边缘的区域,然后对剩余的平滑区域计算能量均值作为特征值,使用C均值聚类算法对平滑区域分类,将特征值与类别标记作为支持向量机的训练样本,最后用训练后的分类器对图像进行分割。实验结果表明提出的方法取得了很好的分割结果,同时用一幅有代表性的图像进行支持向量机训练,所产生的分类器可以应用于所有该类图像,因此可以很容易应用到体数据的分割中。     

Texture based segmentation using graph cut and Gabor filters

This paper describes a method for texture based segmentation. Texture features are extracted by applying a bank of Gabor filters using two-sided convolution strategy. Probability texture model is represented by Gaussian mixture that is trained with the Expectation-maximization algorithm. Texture similarity, obtained this way, is used like the input of a Graph cut method. We show that the combination of texture analysis and the Graph cut method produce good results.     

3D Graph cut with new edge weights for cerebral white matter segmentation

Accurate and efficient automatic or semi-automatic brain image segmentation methods are of great interest to both scientific and clinical researchers of the human central neural system. Cerebral white matter segmentation in brain Magnetic Resonance Imaging (MRI) data becomes a challenging problem due to a combination of several factors like low contrast, presence of noise and imaging artifacts, partial volume effects, intrinsic tissue variation due to neurodevelopment and neuropathologies, and the highly convoluted geometry of the cortex. In this paper, we propose a new set of edge weights for the traditional graph cut algorithm (Boykov and Jolly, 2001) to correctly segment the cerebral white matter from T1-weighted MRI sequence. In this algorithm, the edge weights of Boykov and Jolly (2001) are modified by comparing the probabilities of an individual voxel and its neighboring voxels to belong to different segmentation classes. A shape prior in form of a series of ellipses is used next to model the contours of the human skull in various 2D slices in the sequence. This shape constraint is imposed to prune the original graph constructed from the input to form a subgraph consisting of voxels within the skull contours. Our graph cut algorithm with new set of edge weights is applied to the above subgraph, thereby increasing the segmentation accuracy as well as decreasing the computation time. Average segmentation errors for the proposed algorithm, the graph cut algorithm (Boykov and Jolly, 2001), and the Expectation Maximization Segmentation (EMS) algorithm Van Leemput et al., 2001 in terms of Dice coefficients are found to be (3.72 ± 1.12)%, (14.88 ± 1.69)%, and (11.95 ± 5.2)%, respectively.     

Image segmentation using evolutionary computation

Image segmentation denotes a process by which a raw input image is partitioned into nonoverlapping regions such that each region is homogeneous and the union of any two adjacent regions is heterogeneous. A segmented image is considered to be the highest domain-independent abstraction of an input image. The image segmentation problem is treated as one of combinatorial optimization. A cost function which incorporates both edge information and region gray-scale uniformity is defined. The cost function is shown to be multivariate with several local minima. The genetic algorithm, a stochastic optimization technique based on evolutionary computation, is explored in the context of image segmentation. A class of hybrid evolutionary optimization algorithms based on a combination of the genetic algorithm and stochastic annealing algorithms such as simulated annealing, microcanonical annealing, and the random cost algorithm is shown to exhibit superior performance as compared with the canonical genetic algorithm. Experimental results on gray-scale images are presented