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

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

基于滤波器阵列与图割的彩色纹理分割

图割法因无法体现像素点的纹理区域特性而难以应用于纹理分割。针对该问题,提出一种基于滤波器阵列与图割的彩色纹理分割算法。利用构建的滤波器阵列提取图像的纹理特征,并加入图像的H、S、I分量值组成纹理-色彩特征向量,采用texton直方图作为彩色纹理的统计模型对纹理-色彩特征向量进行统计计算,通过直方图差计算像素点间的纹理相似度,再应用图割法中的规范割准则对彩色纹理进行分割。实验结果证明,该算法具有较高的分割准确性。     

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

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

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

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

Superpixel-based class-semantic texton occurrences for natural roadside vegetation segmentation

Vegetation segmentation from roadside data is a field that has received relatively little attention in present studies, but can be of great potentials in a wide range of real-world applications, such as road safety assessment and vegetation condition monitoring. In this paper, we present a novel approach that generates class-semantic color–texture textons and aggregates superpixel-based texton occurrences for vegetation segmentation in natural roadside images. Pixel-level class-semantic textons are learnt by generating two individual sets of bag-of-word visual dictionaries from color and filter bank texture features separately for each object class using manually cropped training data. For a testing image, it is first oversegmented into a set of homogeneous superpixels. The color and texture features of all pixels in each superpixel are extracted and further mapped to one of the learnt textons using the nearest distance metric, resulting in a color and a texture texton occurrence matrix. The color and texture texton occurrences are aggregated using a linear mixing method over each superpixel and the segmentation is finally achieved using a simple yet effective majority voting strategy. Evaluations on two datasets such as video data collected by the Department of Transport and Main Roads, Queensland, Australia, and a public roadside grass dataset show high accuracy of the proposed approach. We also demonstrate the effectiveness of the approach for vegetation segmentation in real-world scenarios.     

Image segmentation by iterative optimization of multiphase multiple piecewise constant model and Four-Color relabeling

In the paper an iteratively unsupervised image segmentation algorithm is developed, which is based on our proposed multiphase multiple piecewise constant (MMPC) model and its graph cuts optimization. The MMPC model use multiple constants to model each phase instead of one single constant used in Chan and Vese (CV) model and cartoon limit so that heterogeneous image object segmentation can be effectively dealt with. We show that the multiphase optimization problem based on our proposed model can be approximately solved by graph cuts methods. Four-Color theorem is used to relabel the regions of image after every iteration, which makes it possible to represent and segment an arbitrary number of regions in image with only four phases. Therefore, the computational cost and memory usage are greatly reduced. The comparison with some typical unsupervised image segmentation methods using a large number of images from the Berkeley Segmentation Dataset demonstrates the proposed algorithm can effectively segment natural images with a good performance and acceptable computational time.     

基于图割的图像分割方法及其新进展

鉴于图割的理论意义和实际应用价值,系统综述了基于图割的图像分割方法. 首先,深入分析了基于图割的图像分割方法的基本原理,主要从定性和定量角度剖析了图割与能量函数最小化之间的关系, 然后,概括了基于图割的图像分割方法的基本步骤,包括能量函数的设计、图的构造和最小割/最大流方法, 其次,系统梳理和评述了基于图割的图像分割方法的国内外研究现状,最后,指出了基于图割的图像分割方法的发展方向.     

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.     

基于核模糊聚类的彩色图像色彩-纹理分割方法

提出了一种利用色彩-纹理综合特征进行彩色图像分割的新方法。首先利用HSI色彩模型提取图像的色彩信息,其次,采用与方向无关的Gabor变换对彩色图像的强度信息进行处理,提取图像的纹理基元。根据上述过程所获得的色彩-纹理特征,采用核模糊聚类方法实现彩色图像的自动分割。实验结果表明,所提出的方法综合利用了图像的色彩、纹理信息,使彩色图像的分割结果更准确。     

一种基于图的颜色纹理区域分割方法

针对传统基于图论的图像分割方法在分割纹理图像或有突变边缘的图像时,分割效果不理想的问题,提出了一种新的基于图论的颜色一纹理区域分割方法,该方法采用分块的小波能量直方图与三阶颜色矩组成块特征向量生成图顶点的集合,同时根据块间距离进行加权,计算块间的相似度,作为图的边权值,再利用最小生成树的方法进行图像分割,方法有效地弥补了传统基于图论的分割方法中的两个问题.实验结果表明,该算法具有良好的分割准确性与鲁棒性.     

基于色彩均匀度的自然图像色彩-纹理分割方法

针对现有图像分割方法中存在的计算复杂,分割结果平滑性不好等问题,提出了基于色彩均匀度的自然图像色彩—纹理分割方法ISBEC。该方法首先对输入图像进行色彩量化,然后利用量化得到的索引图同时进行色彩分割和基于色彩均匀度的多尺度纹理分析,接着将纹理和色彩分割的结果加以结合,最后合并去掉过分割区域。将灰度图像转为色彩分量相同的彩色图像后,ISBEC算法同样可以用于灰度图像的分割。实验结果验证了ISBEC对自然图像色彩—纹理分割的有效性。     

深度图像的分层图割算法研究

以深度图像为分割对象,在迭代图割算法的基础上,通过引入分层机制加快图割执行速度,并通过引入平衡因子来平衡颜色纹理和深度之间的重要程度,从而有效地对深度图像进行分割。利用平衡因子可以在深度信息能够明显区分前背景的情况下,重点利用深度信息来分割图像,反之则重点利用颜色和纹理信息。而在迭代图割算法中,分层机制的引入能够在不降低分割精度的情况下有效地减少图割算法的执行时间。     

基于图割精细化和可微分聚类的无监督显著性目标检测

针对传统显著性检测算法分割精度低以及基于深度学习的显著性检测算法对像素级人工注释数据依赖性过强等不足,提出一种基于图割精细化和可微分聚类的无监督显著性目标检测算法。该算法采用由“粗”到“精”的思想,仅利用单张图像的特征便可以实现精确的显著性目标检测。首先利用Frequency-tuned算法根据图像自身的颜色和亮度得到显著粗图,然后根据图像的统计特性进行二值化并结合中心优先假设得到显著目标的候选区域,进而利用基于单图像进行图割的GrabCut算法对显著目标进行精细化分割,最后为克服背景与目标极为相似时检测不精确的困难,引入具有良好边界分割效果的无监督可微分聚类算法对单张显著图做进一步的优化。所提出的算法在ECSSD和SOD数据集上进行测试并与现有的7种算法进行对比,结果表明得到的优化显著图更接近于真值图,在ECSSD和SOD数据集上分别实现了14.3%和23.4%的平均绝对误差（MAE）。     

Spectral Image Segmentation Using Image Decomposition and Inner Product-Based Metric

Image segmentation is an indispensable tool in computer vision applications, such as recognition, detection and tracking. In this work, we introduce a novel user-assisted image segmentation technique which combines image decomposition, inner product-based similarity metric, and spectral graph theory into a concise and unified framework. First, we perform an image decomposition to split the image into texture and cartoon components. Then, an affinity graph is generated and the weights are assigned to its edges according to a gradient-based inner-product function. From the eigenstructure of the affinity graph, the image is partitioned through the spectral cut of the underlying graph. The computational effort of our framework is alleviated by an image coarsening process, which reduces the graph size considerably. Moreover, the image partitioning can be improved by interactively changing the graph weights by sketching. Finally, a coarse-to-fine interpolation is applied in order to assemble the partition back onto the original image. The efficiency of the proposed methodology is attested by comparisons with state-of-art spectral segmentation methods through a qualitative and quantitative analysis of the results.     

基于QPSO算法的图像颜色分割*

目前不同种类的纹理区域组成的彩色图像分割还是一个难点。当一幅图像中包含相似的和（或）非固定的纹理区域时,难以计算出精确的纹理区域和分割区域的最优数目。描述了基于量子行为的微粒群优化算法（QPSO）的图像颜色分割方法,把图像分割问题看作一个最优化问题并且采用QPSO的进化策略聚类颜色特征空间中的区域。QPSO不仅参数个数少、随机性强,并且能覆盖所有解空间,保证算法的全局收敛。给出了三幅图像的分割效果,证明了QPSO算法在自动的和无监督的纹理分割上具有很好的效果。     

Unsupervised segmentation of color-texture regions in images andvideo

A method for unsupervised segmentation of color-texture regions in images and video is presented. This method, which we refer to as JSEG, consists of two independent steps: color quantization and spatial segmentation. In the first step, colors in the image are quantized to several representative classes that can be used to differentiate regions in the image. The image pixels are then replaced by their corresponding color class labels, thus forming a class-map of the image. The focus of this work is on spatial segmentation, where a criterion for “good” segmentation using the class-map is proposed. Applying the criterion to local windows in the class-map results in the “J-image,” in which high and low values correspond to possible boundaries and interiors of color-texture regions. A region growing method is then used to segment the image based on the multiscale J-images. A similar approach is applied to video sequences. An additional region tracking scheme is embedded into the region growing process to achieve consistent segmentation and tracking results, even for scenes with nonrigid object motion. Experiments show the robustness of the JSEG algorithm on real images and video     

Color image retrieval using multispectral random field texture model and color content features

This paper describes a color-texture-based image retrieval system for query of an image database to find similar images to a target image. The color-texture information is obtained via modeling with the multispectral simultaneous autoregressive (MSAR) random field model. The general color content characterized by ratios of sample color means is also used. The retrieval process involves segmenting the image into regions of uniform color texture using an unsupervised histogram clustering approach that utilizes the combination of MSAR and color features. The color-texture content, location, area and shape of the segmented regions are used to develop similarity measures describing the closeness of a query image to database images. These attributes are derived from the maximum fitting square and best fitting ellipse to each of the segmented regions. The proposed similarity measure combines all these attributes to rank the closeness of the images. The performance of the system is tested on two databases containing synthetic mosaics of natural textures and natural scenes, respectively.