基于SLIC与Delaunay图割的交互式图像分割算法

针对现有的交互式图像分割算法在处理高分辨率图像时仍不够高效的问题,提出了一种基于简单线性迭代聚类（simple linear iterative clustering,SLIC）与Delaunay图割的交互式图像分割算法。使用一种简化但是高效的SLIC算法将图像分割为多个在感知上有意义的原子区域,并提取这些区域的代表像素点;对处在背景矩形框内的代表像素点进行Delaunay三角剖分,构建图结构;最后利用最小割最大流算法将图中的节点分为两部分,并将这些节点对应为相应的原子区域,达到将图像分割为前景和背景的目的。与其他交互式图像分割算法进行实验对比,结果表明所提算法在计算效率上有较大提升,并更为准确。     

一种分割脑部磁共振图像的FCM改进算法

脑部MRI的快速准确分割是脑部疾病临床诊断过程的关键步骤之一。针对FCM算法部分参数设置影响分割结果和鲁棒性差的缺陷,提出一种基于非局部空间信息的快速模糊C均值核聚类改进算法,并应用于脑部MRI分割中。依次通过直方图、K-means算法、核函数、基于积分图的非局部空间信息解决了部分初始参数值难以控制、抗噪性差和运算效率低等问题。实验表明,该算法错分率低至2.0%,运行时间平均减少至13.89 s。     

基于K均值聚类的图割医学图像分割算法

图割是一种同时基于区域和边界的交互式图像分割算法。传统的基于高斯混合模型的图割具有时间慢和描述组织中灰度分布不准确的缺点。为此,提出一种基于K均值聚类的图割算法。通过用改进的图割来分割仿体的和真实的脑部核磁共振图像,显示出该方法的有效性。该方法不但能提高图割在分割时的速度,在有噪音和灰度不均匀的图像上也能在较短的时间内得到更准确且鲁棒的结果。     

基于图割理论的尺度自适应人脸跟踪算法

针对连续自适应的Mean-Shift（Camshift）算法跟踪人脸时尺度过度放缩这一问题,提出了一种基于图割的Camshift人脸跟踪算法。首先,在每一帧图像的Camshift迭代结果内建立图割区域,使用高斯肤色模型作为图割权值分割出图割区域内肤色团块;然后,计算该肤色团大小得到目标真实尺度,并比较与上一帧图像跟踪框内肤色团的尺度来判断是否需要重新跟踪目标;最后,再以该团块作为下一帧跟踪目标。实验结果表明,基于图割的Camshift人脸跟踪算法有效地克服了跟踪时其他肤色区域的干扰,能有效地反映人体快速运动中人脸真实尺度变化,同时防止Camshift算法丢失跟踪目标而陷入局部最优解,具有较好的可用性和鲁棒性。     

利用视觉显著性与图割的图像分割算法

图割算法是图像分割中经典有效的算法,针对其在前景/背景颜色有重叠时容易产生分割错误、shrinking bias现象及交互实时性不佳的问题,提出一种利用视觉显著性与图割的交互式图像分割算法.首先利用Mean Shift算法将原始图像高效地预分割为基于区域的图结构,使得计算量大大下降;然后结合图像内容的显著性分析提高数据项约束的可靠性,并结合局部自适应的正则化参数,有效地改善了shrinking bias现象.实验结果表明,该算法交互快速,分割结果更加精确.     

基于高阶马尔可夫随机场的图像分割

图像分割是个病态问题,精确化的图像分割需要用户提供足够多的约束信息才能实现.近年来随着马尔可夫随机场吉布斯能量函数最小化图割求解技术的突破,许多国外研究人员开展基于图割方法的交互式图像分割技术的研究.在众多交互式图像分割技术中,由于用户友好性和潜在应用价值,采用矩形框约束的交互式图像分割方法非常吸引人.从超像素马尔可夫随机场模型和网格马尔可夫随机场模型出发,在吉布斯能量函数中引入高阶势能项,高阶势能项的引入使得新的模型既能捕捉细粒度的单个像素信息又能捕捉单像素一定范围内的关联信息,从而提高了矩形框限制条件下的图像分割性能.实验表明:与GrabCut算法相比,所提算法准确性上有一定提高.最后,将所提算法应用在视频对象分割上也取得了不错的效果.     

平衡图分割:基于标签交换的割优化

平衡图分割是基本的组合优化问题之一,针对超大规模图高效实现高质量的平衡图分割仍然是一个极富挑战性的问题。提出了一种基于标签交换图分割算法,以最小化规格化割(normalized cut)作为优化目标,利用顶点标签交换迭代更新以达到平衡图分割;针对大规模图,引入采样技术,通过计算局部最优的方式提高算法效率,最后采用邻域抖动(VNS)策略抖动计算多个局部最优解,然后取其中最好的解近似作为全局最优解。实验结果表明,该算法分割得到的子图内密度较好,与最权威图分割算法METIS相比,算法求得的最小割质量更优。     

基于超像素和随机游走的交互式分割算法

交互式图像分割通过先验信息指导获取图像中人们感兴趣的部分,但是现有算法无法在效率和精度上实现平衡,为了解决此问题,提出了一种基于超像素和随机游走的快速交互式分割算法（random walk on superpixel,SPRW）。首先,将图像预分割为具有局部相似性的超像素区域,使用像素颜色均值对超像素区域表示;其次,根据人工标记的先验信息建立F-B图结构,扩展随机游走的范围,并使用随机游走的方法求解,获得硬分割结果;最后,针对分割结果的边界不光滑问题,提出改进的抠图算法（fast robust matting,FRB）进行二次处理,得到软分割结果。在BSD500和MSRC数据集上的实验证实,所提出的硬分割方法与其他算法在时间和平均交并比等指标上有较大优势;在Alpha Matting数据集上的实验充分证实所提出的软算法在提高效率的同时精度也有一定的提升;此外,在生活照更换背景的实验上展现了该算法的应用价值。     

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

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

结合全卷积网络和K均值聚类的球栅阵列焊球边缘气泡分割

针对在球栅阵列（BGA）气泡检测中,由于图像干扰因素的多样性导致焊球存在边缘气泡与背景之间灰度级接近,从而造成焊球气泡分割结果不精确的问题,提出了一种结合全卷积神经网络（FCN）和K均值（K-means）聚类分割的焊球气泡分割方法。首先根据所制作的BGA标签数据集搭建FCN,通过训练该网络得到合适的网络模型,再对待测BGA图像进行预测处理得到图像的粗分割结果;然后对焊球区域映射提取,通过同态滤波法提高气泡区域辨识度,再使用K-means聚类分割对图像进行细分割处理,得到最终分割结果图;最后对原图焊球及气泡区域进行标注识别。将所提出的算法与传统BGA气泡分割算法进行对比,实验结果表明,所提出的算法对复杂BGA焊球的边缘气泡分割精确,图像分割结果与其真实轮廓高度匹配,准确度更高。     

形状模板约束的图像协同分割

已有的协同分割方法没有考虑到同一类图像所具有的目标形状相似性,从而使得分割结果不一致。提出了形状模板约束的图像交互协同分割算法,通过少量用户交互提高协同分割质量。该算法首先定义形状模板;然后通过形状上下文实现分割结果传递,自动形成图像分割所需的前景和背景掩码;最后采用最小割理论进行分割边界优化。实验结果表明,与已有的协同分割算法相比,该算法能在简单用户交互下明显提高分割质量,使分割结果更具有语义性。     

图像分割的自适应交互核图割模型

为了克服图割模型算法在实现图像分割时需要人为选定参数,以及图割模型可能会陷入局部最小值的不足,考虑到交互图割是一种灵活的全局最优算法,提出了基于EM方法的交互核图割算法。数据映射到核空间,构造了新的目标函数,这样可以更有效地解决分类分割问题;为了估计交互图割所需要的参数以及图割算法所需要的各种阈值,采用EM算法来估计这些参数,避免人为随机选取可能造成的不利影响,因而该方法是一种自适应的分割算法。实验结果表明,相对于交互图割算法,该算法分割合成图像时具有更低的误分率,处理光学等图像时,分割结果更准确,保留图像细节信息的能力更强。     

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.     

Adaptive pixon represented segmentation (APRS) for 3D MR brain images based on mean shift and Markov random fields

In this paper, we proposed an adaptive pixon represented segmentation (APRS) algorithm for 3D magnetic resonance (MR) brain images. Different from traditional method, an adaptive mean shift algorithm was adopted to adaptively smooth the query image and create a pixon-based image representation. Then K-means algorithm was employed to provide an initial segmentation by classifying the pixons in image into a predefined number of tissue classes. By using this segmentation as initialization, expectation-maximization (EM) iterations composed of bias correction, a priori digital brain atlas information, and Markov random field (MRF) segmentation were processed. Pixons were assigned with final labels when the algorithm converges. The adoption of bias correction and brain atlas made the current method more suitable for brain image segmentation than the previous pixon based segmentation algorithm. The proposed method was validated on both simulated normal brain images from BrainWeb and real brain images from the IBSR public dataset. Compared with some other popular MRI segmentation methods, the proposed method exhibited a higher degree of accuracy in segmenting both simulated and real 3D MRI brain data. The experimental results were numerically assessed using Dice and Tanimoto coefficients.     

一种基于图的交互式目标分割算法

静态图片的编辑中,交互式背景、前景分割的高效性研究有着重大的实际意义。传统的分割方法或是应用图片的纹理(色彩)信息,如Magic Wand,或是利用边界(对比度)信息,如Intelligent Scissors。最近提出的Graph cuts分割算法很好地结合了以上的两种信息。该文将介绍Graph cuts算法以及在该算法基础上改进得到的Grab cut算法。Grab cut算法堪称目前交互式分割方法中分割效果较好的方法,其分割精度高,交互工作少,具有较好的应用前景。文章结合作者当前的研究课题,把Grab cut算法应用在医学图像器官分割中得到了令人满意的效果。     

Semiautomatic segmentation with compact shape prior

In recent years, interactive methods for segmentation are increasing in popularity due to their success in different domains such as medical image processing, photo editing, etc. We present an interactive segmentation algorithm that can segment an object of interest from its background with minimum guidance from the user, who just has to select a single seed pixel inside the object of interest. Due to minimal requirements from the user, we call our algorithm semiautomatic. To obtain a reliable and robust segmentation with such low user guidance, we have to make several assumptions. Our main assumption is that the object to be segmented is of compact shape, or can be approximated by several connected roughly collinear compact pieces. We base our work on the powerful graph cut segmentation algorithm of Boykov and Jolly, which allows straightforward incorporation of the compact shape constraint. In order to make the graph cut approach suitable for our semiautomatic framework, we address several well-known issues of graph cut segmentation technique. In particular, we counteract the bias towards shorter segmentation boundaries and develop a method for automatic selection of parameters. We demonstrate the effectiveness of our approach on the challenging industrial application of transistor gate segmentation in images of integrated chips. Our approach produces highly accurate results in real-time.     

A K-Means-Galactic Swarm Optimization-Based Clustering Algorithm with Otsu’s Entropy for Brain Tumor Detection

Image segmentation is a technique in order to segment an image into various parts and derive meaningful information out of each one. In this article, problem of image segmentation is applied on brain MRI images. This is done in order to detect and capture the location, size and shape of five different types of tumors. Here, image segmentation is viewed as an clustering problem and a new hybrid K-means Galatic Swarm Optimization (GSO) algorithm is proposed for effective solution. The Otsus entropy measure is used as the fitness function for deriving the segments. Extensive simulation studies with five performance measures on five different brain MRI images reveal the superior performance of the proposed approach over GSO, Real Coded Genetic Algorithm (RCGA), and K-Means clustering algorithms.     

粒子群算法优化归一化划分的彩色图像分割

为克服谱聚类算法求解归一化彩色图像划分时计算复杂度高、寻优能力差的不足,先对彩色图像各通道进行模糊C均值聚类,综合各通道聚类结果获得待分割图像,构造无向带权图;再使用二进制离散化粒子群算法替代谱聚类算法求解归一化划分准则的最小值,最后通过最优粒子获得分割结果。实验表明该方法耗时少,能完整准确地提取彩色图像中的目标。