基于流形特征与形状先验的红外直升机图像分割

为有效分割复杂天空背景下的直升机目标,提出了基于流形特征与形状先验的变分分割模型.根据图像数据的灰度分布构造区域能量项,推动变形曲线向目标边界演化;引入对称正定（Symmetric Positive Definite,SPD）矩阵流形上的区域协方差描述子构造流形特征能量项以提高分割算法的鲁棒性.在区域项、边界项和流形特征项的共同作用下获取红外直升机目标的第一阶段分割结果.在第二阶段分割过程中,基于主成分分析（Principal Component Analysis,PCA）方法获取直升机目标的先验形状变化模式,以变形曲线在PCA空间重构的形状作为先验知识约束曲线的演化,最终实现红外直升机图像的分割.实验结果表明,本文方法能够有效获取直升机目标的完整轮廓.     

一种改进的凸变分水平集模型在图像分割中应用

针对传统的变分水平集CV模型在图像分割中不能分割灰度不均图像的缺陷,提出一种改进的水平集公式化的凸能量函数。改进模型既可以灵活地应用初始值,也可以在算法上设置合理的终止条件,对于背景简单的图像分割效果较清晰;对于前景清晰,目标明确的图像分割的干净,前景和背景明确;对于目标与背景对比不强烈的图像,抓取的目标轮廓明了清晰。应用在图像中提高了分割精度,缩短了计算时间,效果较好。     

结合形状先验的图割目标分割方法

为了减少图像目标分割过程中噪声、阴影、背景复杂等因素的影响,将形状先验引入图割图像分割框架中,提出一种结合形状先验的图割目标分割方法。该方法给出了形状先验的定义,并将其转化为势函数的形式加入到能量函数中,通过能量最小化过程得到最终分割结果。同时,图像对齐过程能够适应形状模版与待分割目标之间的仿射不同。形状先验能够较好地约束目标边界,相比与传统图割算法,分割结果有了明显改善。实验结果表明,该算法具有有效性。     

基于形状约束和局部演化的二值水平集运动目标分割

针对水平集分割模型运算效率较低且易出现过分割的现象,结合视频中运动目标分割的应用背景,该文提出一种将运动目标检测作为先验形状约束和曲线局部演化方法相结合的二值水平集分割模型.该模型提出将运动目标检测的区域作为先验形状信息对水平集分割进行约束,并使用二值函数替换传统水平集函数提高运算效率,同时融入曲线的局部演化方法解决二值水平集模型缺乏曲线演化渐进性的问题.实验结果表明,该文方法在分割准确性、鲁棒性和运算效率等方面与相关模型相比均有不同程度的提高.     

基于边缘和区域信息相结合的变分 水平集图像分割方法

 针对GAC模型和C-V模型分别存在对弱边缘和灰度渐进图像分割效果不理想以及演化效率低等问题,提出了一种基于边缘和区域信息相结合的变分水平集图像分割方法.结合了图像边缘梯度信息和区域全局信息的能量函数作为模型的外部能量项,引入内部变形能量约束水平集函数来逼近符号距离函数,省去了重新初始化水平集函数的过程,并融入了物体形状先验知识的附加约束信息,提高了分割精度.实验结果表明,论文所用方法对分割噪声弱边缘图像和灰度渐进图像具有一定的有效性和可行性.     

基于动态形状的红外目标提取算法

提出了一种基于动态形状的红外目标提取新算法。首先提出基于先验知识的动态形状概念以描述形变的时空相关性,用logistic主成分分析(PCA)将形状映射到低维度的潜变量子空间,并对潜变量变化趋势的建立自回归模型,通过模型预测指导分割过程。然后在马尔可夫随机场(MRF)的框架下将先验形状约束定义为从分割结果到先验形状间轮廓变换的距离,并结合目标的检测似然度信息统一为随机场势函数,再用GraphCut获取全局最优解分割。试验表明,该算法能够适应目标的外形变化,并能在目标被部分遮挡或难以从背景区分的情况下准确提取,鲁棒性较好,能够为机器视觉应用提供中级视觉的信息。     

基于先验形状的CV模型肝脏CT图像分割

针对目标被部分遮挡或部分信息丢失情况下CV模型不能正确识别的问题,提出一种新的分割算法。首先,利用数学形态学对原肝脏图像进行滤波,并结合其他算法建立肝脏先验形状;然后,采用边缘查找和区域标定等算法,对肝脏先验性状的边缘以及边缘内外区域进行赋值,构建执行效率高的符号函数距离函数,将其通过形状比较函数嵌入到CV模型的能量泛函中,形成新的基于先验形状的CV模型,并将此模型用于分割存在干扰或者被部分遮挡的肝脏CT图像。与CV模型分割结果相比,本文算法能在目标周围存在干扰信息或者被部分遮挡的情形下,成功地正确识别出目标区域。     

基于不变性特征的SVM遥感图像飞机类型识别

根据遥感图像飞机目标的特点,提出一种基于不变性特征的支持向量机(SVM)识别算法。首先结合小波分解进行平移、旋转、缩放不变性特征提取;然后对基于遗传算法(GA)的SVM模型参数选择方法在核函数的选择、搜索空间的确定等方面进行改进,并用改进后的算法实现SVM模型参数选择。对480幅遥感图像进行仿真实验,得到97.56%的正确识别率。与BP神经网络相比,识别率高,验证了算法的有效性。     

一种基于改进Chan-Vese模型的红外图像分割方法

为了解决基于Chan-Vese(CV)模型的传统水平集方法难以分割灰度不均匀红外图像的问题,本文提出一种基于改进CV模型的水平集分割方法。通过加入可处理局部区域信息的局部项,使得改进的CV模型能够有效避免不均匀背景对水平集演化过程的干扰。此外,通过加入符号距离能量惩罚项,使得该模型无需重新初始化过程,从而提高了水平集函数的演化效率。实验结果表明,本文方法对于红外图像的分割具有较高的精度。     

基于改进的Hu不变矩的图像检索技术研究

提出一种改进的Hu不变矩形状特征描述算法。首先使用Canny算子对图像进行边缘轮廓提取,然后分析传统Hu不变矩的缺点提出一种相对矩与离心率特征相结合的不变矩描述算法,通过实验证明改进后的形状描述算法具有良好的旋转不变性、平移不变性以及尺度不变性,同时对改进前后的检索性能进行实验对比,发现改进后算法的检索性能优于改进前。     

基于自适应TV的Chan—Vese图像分割方法

自适应整体变分(Total Variation,TV)图像平滑模型能有效去除噪声,具有较强的图像保征能力.基于多相水平集的Chan-Vese图像分割模型能有效地实现多质图像的分割.将自适应TV图像平滑方法和Chan-Vese图像分割方法有机整合,提出了自适应TV的Chan-Vese图像分割方法.实验表明,该方法能得到较好的分割结果.     

Image segmentation using fuzzy energy-based active contour with shape prior

This paper presents a fuzzy energy-based active contour model with shape prior for image segmentation. The paper proposes a fuzzy energy functional including a data term and a shape prior term. The data term, inspired from the region-based active contour approach proposed by Chan and Vese, evolves the contour relied on image information. The shape term inspired from Chan and Zhu’s work, defined as the distance between the evolving shape and a reference one, constrains the evolving contour with respect to the reference shape. To align the shapes, we exploit the shape normalization procedure which takes into account the affine transformation. In addition, to minimize the energy functional, we utilize a direct method to calculate the energy alterations. The proposed model therefore can deal with images with background clutter and object occlusion, improves the computational speed, and avoids difficulties associated with time step selection issue in gradient descent-based approaches.     

A variational model and graph cuts optimization for interactive foreground extraction

In this paper, an interactive segmentation method is proposed, which is based on an improved Chan–Vese model, i.e. multiple piecewise constant model with geodesic active contour. The k-means method is used to learn the models of the foreground and background, which are the optimal piecewise constant approximation of the original image according to the input seeds clue by the user. Based on the piecewise constant models of the foreground and background, the multiple piecewise constant with a geodesic active contour energy function can be minimized by effective graph cuts algorithm, and the minimum cuts can be used to partition the image into the foreground and background. Numerical experiments demonstrate the superior performance of the proposed interactive foreground extraction method based on the improved Chan–Vese model compared to the original Chan–Vese model by simple user interaction.     

基于Chan-Vese模型的树形结构多相水平集图像分割算法

由于Chan-Vese(C-V)模型通过单个水平集的符号将待分割图像划分为目标和背景两个部分,所以当图像的多个目标的轮廓成多连接时,C-V模型将无法表示.为了解决C-V模型在表示目标轮廓上的局限,提出了基于C-V模型的树形结构多相水平集算法.关键策略是通过改变图像背景,使得水平集在新图像上重新收敛;核心技术是依据同时明度对比提出的背景填充技术;算法流程采用多水平集串行收敛方式实现多相分割(n-1次收敛可以实现n相分割,n＞1).实验结果表明,本算法可以表示复杂的区域连接情况(n相分割最多可以表示n连接情况),能够实现多目标分割(n相分割可以实现n-1个目标分割),特别适合于目标中含有子目标的图像.     

基于Gabor小波的无边缘活动围道纹理分割方法

该文提出了一种基于Gabor小波的活动围道纹理分割新方法。该方法先用Gabor小波提取图像的纹理特征,再用Chan-Vese模型进行分割。与其它基于Chan-Vese模型的纹理分割方法相比,基于Gabor小波的活动围道的纹理分割方法有两个优点:一是同时使用纹理特征和灰度信息演化围道,可分割纹理图像和非纹理图像,分割方法的灵活性好;二是在分割多类目标时,采用多级分层式曲线演化方法解决了初始围道难以选择的问题。对自然界真实图像和遥感图像的分割实验结果说明,该文提出的分割方法精度高。     

Learning of perceptual grouping for object segmentation on RGB-D data

Object segmentation of unknown objects with arbitrary shape in cluttered scenes is an ambitious goal in computer vision and became a great impulse with the introduction of cheap and powerful RGB-D sensors. We introduce a framework for segmenting RGB-D images where data is processed in a hierarchical fashion. After pre-clustering on pixel level parametric surface patches are estimated. Different relations between patch-pairs are calculated, which we derive from perceptual grouping principles, and support vector machine classification is employed to learn Perceptual Grouping. Finally, we show that object hypotheses generation with Graph-Cut finds a globally optimal solution and prevents wrong grouping. Our framework is able to segment objects, even if they are stacked or jumbled in cluttered scenes. We also tackle the problem of segmenting objects when they are partially occluded. The work is evaluated on publicly available object segmentation databases and also compared with state-of-the-art work of object segmentation.     

Active Contours without Edges for Vector-Valued Images

In this paper, we propose an active contour algorithm for object detection in vector-valued images (such as RGB or multispectral). The model is an extension of the scalar Chan–Vese algorithm to the vector-valued case [1]. The model minimizes a Mumford–Shah functional over the length of the contour, plus the sum of the fitting error over each component of the vector-valued image. Like the Chan–Vese model, our vector-valued model can detect edges both with or without gradient. We show examples where our model detects vector-valued objects which are undetectable in any scalar representation. For instance, objects with different missing parts in different channels are completely detected (such as occlusion). Also, in color images, objects which are invisible in each channel or in intensity can be detected by our algorithm. Finally, the model is robust with respect to noise, requiring no a priori denoising step.     

Image segmentation and selective smoothing by using Mumford-Shah model.

Recently, Chan and Vese developed an active contour model for image segmentation and smoothing by using piecewise constant and smooth representation of an image. Tsai et al. also independently developed a segmentation and smoothing method similar to the Chan and Vese piecewise smooth approach. These models are active contours based on the Mumford-Shah variational approach and the level-set method. In this paper, we develop a new hierarchical method which has many advantages compared to the Chan and Vese multiphase active contour models. First, unlike previous works, the curve evolution partial differential equations (PDEs) for different level-set functions are decoupled. Each curve evolution PDE is the equation of motion of just one level-set function, and different level-set equations of motion are solved in a hierarchy. This decoupling of the motion equations of the level-set functions speeds up the segmentation process significantly. Second, because of the coupling of the curve evolution equations associated with different level-set functions, the initialization of the level sets in Chan and Vese's method is difficult to handle. In fact, different initial conditions may produce completely different results. The hierarchical method proposed in this paper can avoid the problem due to the choice of initial conditions. Third, in this paper, we use the diffusion equation for denoising. This method, therefore, can deal with very noisy images. In general, our method is fast, flexible, not sensitive to the choice of initial conditions, and produces very good results.     

A multi-object image segmentation C–V model based on region division and gradient guide

The Chan–Vese (C–V) model is an ineffective method for processing images in which the intensity is inhomogeneous. This is especially true for multi-object segmentation, in which the target may be missed or excessively segmented. In addition, for images with rich texture information, the processing speed of the C–V is slow. To overcome these problems, this paper proposes an effective multi-object C–V segmentation model based on region division and gradient guide. First, a rapid initial contour search is conducted using Otsu’s method. This contour line becomes the initial contour for our multi-object segmentation C–V model based on a gradient guide. To achieve the multi-object segmentation the image is then converted to a single level set whose evolution is controlled using an adaptive gradient. The feasibility of the proposed model is analyzed theoretically, and a number of simulation experiments are conducted to validate its effectiveness.     

An integrated region-, boundary-, shape-based active contour for multiple object overlap resolution in histological imagery

Active contours and active shape models (ASM) have been widely employed in image segmentation. A major limitation of active contours, however, is in their 1) inability to resolve boundaries of intersecting objects and to 2) handle occlusion. Multiple overlapping objects are typically segmented out as a single object. On the other hand, ASMs are limited by point correspondence issues since object landmarks need to be identified across multiple objects for initial object alignment. ASMs are also are constrained in that they can usually only segment a single object in an image. In this paper, we present a novel synergistic boundary and region-based active contour model that incorporates shape priors in a level set formulation with automated initialization based on watershed. We demonstrate an application of these synergistic active contour models using multiple level sets to segment nuclear and glandular structures on digitized histopathology images of breast and prostate biopsy specimens. Unlike previous related approaches, our model is able to resolve object overlap and separate occluded boundaries of multiple objects simultaneously. The energy functional of the active contour is comprised of three terms. The first term is the prior shape term, modeled on the object of interest, thereby constraining the deformation achievable by the active contour. The second term, a boundary-based term detects object boundaries from image gradients. The third term drives the shape prior and the contour towards the object boundary based on region statistics. The results of qualitative and quantitative evaluation on 100 prostate and 14 breast cancer histology images for the task of detecting and segmenting nuclei and lymphocytes reveals that the model easily outperforms two state of the art segmentation schemes (geodesic active contour and Rousson shape-based model) and on average is able to resolve up to 91% of overlapping/occluded structures in the images.