A novel region-based active contour model via local patch similarity measure for image segmentation

Multimedia Tools and Applications - It is always difficult to accurately segment images with intensity inhomogeneity because most of the representative local-based models only take into account...     

A novel active contour model for image segmentation using local and global region-based information

In this paper, we propose a novel level set geodesic model for image segmentation. In our model, we define a hybrid signed pressure force (SPF) function integrating local and global region-based information to segment inhomogeneous images. The local region-based SPF utilizes mean values on local circular regions centered in each pixel. By introducing the local image information, the images with intensity inhomogeneity can be effectively segmented. In order to reduce the dependency on complex initialization, we incorporate a global region-based SPF into this model to develop a hybrid SPF. The global SPF and the local SPF are adaptively balanced by an adaptive weight. In addition, we also extend this model to four-phase level set formulation for brain MR image segmentation. Finally, a truncated Gaussian kernel is used to regularize the level set function, which not only regularizes it but also removes the need for computationally expensive re-initialization. Experimental results indicate that the proposed method achieves superior segmentation performance in terms of accuracy and robustness.     

Synthetic aperture radar river image segmentation using improved localizing region-based active contour model

Pattern Analysis and Applications - Adaptive localizing region-based active contour model driven by Laplacian kernel-based fitting energy is proposed for improving the efficiency and accuracy of...     

An efficient local Chan-Vese model for image segmentation

In this paper, a new local Chan-Vese (LCV) model is proposed for image segmentation, which is built based on the techniques of curve evolution, local statistical function and level set method. The energy functional for the proposed model consists of three terms, i.e., global term, local term and regularization term. By incorporating the local image information into the proposed model, the images with intensity inhomogeneity can be efficiently segmented. In addition, the time-consuming re-initialization step widely adopted in traditional level set methods can be avoided by introducing a new penalizing energy. To avoid the long iteration process for level set evolution, an efficient termination criterion is presented which is based on the length change of evolving curve. Particularly, we proposed constructing an extended structure tensor (EST) by adding the intensity information into the classical structure tensor for texture image segmentation. It can be found that by combining the EST with our LCV model, the texture image can be efficiently segmented no matter whether it presents intensity inhomogeneity or not. Finally, experiments on some synthetic and real images have demonstrated the efficiency and robustness of our model. Moreover, comparisons with the well-known Chan-Vese (CV) model and recent popular local binary fitting (LBF) model also show that our LCV model can segment images with few iteration times and be less sensitive to the location of initial contour and the selection of governing parameters.     

区域GMM聚类的SAR图像分割

高斯混合模型(GMM)聚类算法近年来广泛应用于图像分割领域。但在SAR图像分割中,由于忽略了图像像素间的空间相关性,使其对相干斑噪声十分敏感。提出一种基于区域的GMM聚类算法,它将空间相关性引入聚类分类中,利用分水岭分割得到基本同质区域,计算区域的灰度均值作为GMM聚类算法的输入样本,将聚类特征从像素水平提升到区域水平,减少了噪声对分割结果的影响;并将自身反馈机制引入期望最大化(EM)算法中,进一步提高了GMM模型参数估计的精度。还对合成图像和真实SAR图像进行了分割实验,结果表明新算法可有效地提高分割的     

An automatic region-based image segmentation algorithm for remote sensing applications

Object-based image analysis has proven its potentials for remote sensing applications, especially when using high-spatial resolution data. One of the first steps of object-based image analysis is to generate homogeneous regions from a pixel-based image, which is typically called the image segmentation process. This paper introduces a new automatic Region-based Image Segmentation Algorithm based on k-means clustering (RISA), specifically designed for remote sensing applications. The algorithm includes five steps: k-means clustering, segment initialization, seed generation, region growing, and region merging. RISA was evaluated using a case study focusing on land-cover classification for two sites: an agricultural area in the Republic of South Africa and a residential area in Fresno, CA. High spatial resolution SPOT 5 and QuickBird satellite imagery were used in the case study. RISA generated highly homogeneous regions based on visual inspection. The land-cover classification using the RISA-derived image segments resulted in higher accuracy than the classifications using the image segments derived from the Definiens software (eCognition) and original image pixels in combination with a minimum-distance classifier. Quantitative segmentation quality assessment using two object metrics showed RISA-derived segments successfully represented the reference objects.     

一种基于区域的彩色图像分割方法

介绍了一种基于区域的彩色图像分割方法。该方法首先提取图像像素点的颜色、纹理等特征,然后采用Gaussian混合模型,通过EM算法学习,根据提出的选择最佳高斯混合模型参数K的准则,确定K,利用图像像素点特征的相似度在特征空间中粗略的将像素点划分为不同的组,最后在各个组内依据其位置信息对图像再进一步划分,得到图像的区域分割。实验结果表明,该分割方法具有较好的分割性能。     

Hybrid geodesic region-based active contours for image segmentation

In this paper, we propose novel hybrid edge and region based active contour models. First, we consider geodesic curve and region-based model, and evolve contours based on global information to segment images with intensity homogeneity. Second, we extend the global model to the local intensity fitting energy for segmenting the images with intensity inhomogeneity. Moreover, the level set regularization term is added to the energy functional to ensure accurate computation and avoid expensive re-initialization of the evolving level set function. Experimental results indicate the proposed method has advantage over the geodesic active contour (GAC) model, the Chan–Vese (C–V) model, the Lankton’s method and the local binary fitting (LBF) model in terms of efficiency and robustness.     

自适应尺度的局部强度聚类图像分割模型

针对传统活动轮廓模型无法精确分割强度不均匀图像，并且对尺度参数比较敏感的问题，提出了一种基于区域信息的自适应尺度的活动轮廓模型。根据图像的局部熵构建自适应尺度算子，利用图像的局部强度聚类性质构建能量函数。使用一组平滑基函数的线性组合来表示偏移场，这样可以增加模型的稳定性。通过最小化该能量，所提模型能够同时分割图像和估计偏移场，并且估计的偏移场可以用于强度不均匀校正。实验结果表明，与其它4种模型相比，该模型拥有更高的分割精确度，且分割结果对水平集函数的初始化和噪声具有鲁棒性。     

结合纹理特征改进的GBIS图像分割方法

针对GBIS(efficient graph-based image segmentation)方法在分割含有较丰富纹理信息的图像时, 分割效果不理想的问题, 在L*a*b*彩色空间下, 结合图像的纹理特征, 提出了一种改进GBIS图像分割方法, 记为IGBIS(improved efficient graph-based image segmentation)。该方法首先将图像由RGB空间转换到L*a*b*颜色空间; 接着, 结合L*a*b*彩色空间, 对GBIS方法中的权值函数作了改进, 引入了一个常数s, 用于控制相邻像素之间颜色的差异程度; 然后, 用熵的方法来获取L*a*b*彩色图像的纹理特征; 最后, 结合图像的纹理信息, 改变了GBIS方法中的区域合并条件, 得到最终的分割结果。实验证明, 与原算法相比, 该方法在分割精度与分割质量上有了很大程度的提高。IGBIS有效地抑制了彩色图像在分割中存在的过分割现象, 并适合于含有丰富纹理的彩色图像。     

结合目标局部和全局特征的 CV遥感图像分割模型

摘 要：随着遥感卫星技术的发展,高分辨率遥感影像不断涌现。从含有较多信息、背景 复杂的遥感影像中自动提取目标成为一个亟待解决的难题。传统的图像分割方法主要依赖图像 光谱、纹理等底层特征,容易受到图像中遮挡和阴影等的干扰。为此,针对特定的目标类型, 提出结合目标局部和全局特征的 CV (Chan Vest)遥感图像目标分割模型,首先,采用深度学习 生成模型——卷积受限玻尔兹曼机建模表征目标全局形状特征,以及重建目标形状;其次,利 用 Canny 算子提取目标边缘信息,经过符号距离变换得到综合了局部边缘和全局形状信息的约 束项;最终,以 CV 模型为图像目标分割模型,增加新的约束项得到结合目标局部和全局特征 的 CV 遥感图像分割模型。在遥感小数据集 Levir-oil drum、Levir-ship 和 Levir-airplane 上的实 验结果表明：该模型不仅可以克服 CV 模型对噪声敏感的缺点,且在训练数据有限、目标尺寸 较小、遮挡及背景复杂的情况下依然能完整、精确地分割出目标。     

A novel region-based active contour model based on kernel function for image segmentation

It is a difficult task to accurately segment images with intensity inhomogeneity, because most of existing algorithms are based upon the assumption of the homogeneity of image intensity. In this paper, we propose a novel region-based active contour model, referred to as the K-GLIF, which utilizes both global and local image intensity fittings with kernel functions. The model consists of an intensity fitting term and a new regularization term. The intensity fitting term of the level set function is the gradient descent flow that minimizes the global binary fitting energy functional. The local intensity fitting value based on the generalized Gaussian kernel function is then incorporated into the global intensity fitting value to form the weighted intensity fitting value on the two sides of the contour. Owing to the kernel function, the intensity information in local regions is extracted to guide the motion of the contour, which enables the model to effectively segment images with intensity inhomogeneity and smooth noise. A new regularization term is used to control the smoothness of the level set function and avoid complicated re-initialization. Experimental results and comparisons with other models of inhomogeneous images, synthetic images, medical images, multi-object images, natural and infrared images show that the proposed K-GLIF model improves the quality of image segmentation in terms of accuracy and robustness of initial contours.

     

结合局部灰度差异的噪声图像分割模型

针对未知强度和分布规律的噪声图像难以得到正确分割,现有模型无法适应多种噪声环境的问题,提出了一种基于图像局部灰度差异的噪声图像分割模型。首先,分析局部K均值聚类（LCK）模型和局部相似性系数（RLSF）模型中能量泛函对噪声点的降权机制的不足,提出优化方案;其次,将一种结合局部灰度差异的噪声点修复函数引入能量泛函,降低了显著偏离局部均值的噪声点对分割结果的干扰;最后使用变分法推导出该模型的水平集迭代方程。与局部二值拟合（LBF）模型、LCK模型和RLSF模型相比,使用该模型进行噪声自然图像分割时,可得到更高的查全率、查准率和F值。实验结果表明,所提模型可稳定、有效地分割非均匀和高噪声图像。     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

一种改进的桥梁图像分水岭分割算法

针对传统分水岭分割方法存在的过分割问题,提出了一种改进的桥梁图像分水岭分割算法。该算法首先对桥梁裂缝图像进行高低帽形态学滤波,并运用多尺度梯度算子提取梯度图像,在分水岭变换之前使用自适应的标记提取方法对区域极小值进行标定,然后对初步分水岭分割的过分割区域使用改进fisher距离的区域合并算法进行合并,取散度作为停止度量。实验表明,该算法减少了分水岭算法的过分割现象,提高了桥梁图像分割的精确性,具有很好的鲁棒性和适应性。     

基于GAC模型实现交互式图像分割的改进算法

提出了一种改进的交互式图像分割算法。采用全变分去噪模型对图像进行预处理,在去除噪声的同时更好地保护了边缘;提出了一种对梯度模值进行曲率加权的边缘检测方法,采用该方法获得图像的边缘点集;将边缘点集中曲率较大的边缘点作为候选边界点推荐给用户;用户通过主观判断,在候选边界点中选择合适的"初始边界点",算法便可采用GAC模型完成对目标的分割。实验结果表明,改进算法提高了交互式图像分割的自动化程度,有效地减少了交互过程中的人工参与量。     

局部GAC模型在医学图像分割中的应用

针对基于区域测地线活动轮廓(GAC)模型很难准确分割灰度不均匀图像的问题,提出基于局部信息的GAC模型。该方法首先将图像区域进行局部化,来克服灰度不均匀对分割结果的影响,然后构造局部符号压力函数(ISPF)指导轮廓线在目标外部(或内部)收缩(或扩张)来完成分割。为了提高算法效率和稳定性,用二值水平集方法实现整个分割过程,避免了传统水平集数值不稳定性。实验结果表明,本文方法可以快速有效地分割灰度不均匀的医学图像。     

An improved K-means algorithm for underwater image background segmentation

Conventional algorithms fail to obtain satisfactory background segmentation results for underwater images. In this study, an improved K-means algorithm was developed for underwater image background segmentation to address the issue of improper K value determination and minimize the impact of initial centroid position of grayscale image during the gray level quantization of the conventional K-means algorithm. A total of 100 underwater images taken by an underwater robot were sampled to test the aforementioned algorithm in respect of background segmentation validity and time cost. The K value and initial centroid position of grayscale image were optimized. The results were compared to the other three existing algorithms, including the conventional K-means algorithm, the improved Otsu algorithm, and the Canny operator edge extraction method. The experimental results showed that the improved K-means underwater background segmentation algorithm could effectively segment the background of underwater images with a low color cast, low contrast, and blurred edges. Although its cost in time was higher than that of the other three algorithms, it none the less proved more efficient than the time-consuming manual segmentation method. The algorithm proposed in this paper could potentially be used in underwater environments for underwater background segmentation.

     

An intelligent approach for fingerprint presentation attack detection using ensemble learning with improved local image features

Multimedia Tools and Applications - The fingerprint-based authentication systems are being extensively deployed as security tool for providing access to the critical Cyber Physical Systems (CPS)....     

一种改进的One-Cut交互式图像分割算法

GrabCut算法作为一种典型的交互式彩色图像分割算法,是计算机图像领域中的重要技术手段。然而随着大数据时代的到来,图像数据种类和数量都呈指数级增长,显著地增加了图像分割的任务量,对图像分割效率提出了更高的要求。针对GrabCut算法图像分割效率及精度低的问题,提出了一种改进的One Cut交互式图像分割算法。首先采用One Cut的L1距离项构建能量函数避免GrabCut算法所面临的NP hard问题。然后改进能量函数中表观重叠惩罚项,并结合颜色直方图加速技术,优化网络图结构,显著降低网络图的复杂度,从而提高图像分割的效率及精度。实验结果表明,改进后的One Cut图像分割算法显著提升了图像分割效率,提高了分割精度,得到了较好分割结果。