Adaptive hierarchical image segmentation technique

In the report a technique of multiple adaptive image segmentation is outlined. Three hierarchy-to-hierarchy transforms for primary digital data ordering and filtration are introduced. To optimize the approximation of observed object with image segments the 22 algorithms of sequential segmentation are tested. The required standard deviation value depending on segment number is estimated. The prototypes are reviewed.     

Adaptive Gaussian weighted filtering for image segmentation

A simple approach to image smoothing is presented using a filter whose weights are adaptive Gaussian functions of the absolute difference between the central pixel and its neighbours in a 3 × 3 window. Such a filter smooths the signal effectively within homogeneous regions whilst maintaining inter-region boundaries thus alloqing iterative processing. The filtering scheme is shown to be particularly suitable for image segmentation.     

Adaptive image segmentation with distributed behavior-based agents

Presents an autonomous agent-based image segmentation approach. In this approach, a digital image is viewed as a two-dimensional cellular environment which the agents inhabit and attempt to label homogeneous segments. In so doing, the agents rely on some reactive behaviors such as breeding and diffusion. The agents that are successful in finding the pixels of a specific homogeneous segment will breed offspring agents inside their neighboring regions. Hence, the offspring agents will become likely to find more homogeneous-segment pixels. In the mean time, the unsuccessful agents will be inactivated, without further search in the environment     

Adaptive spatial information-theoretic clustering for image segmentation

The incorporation of spatial context into clustering algorithms for image segmentation has recently received a significant amount of attention. Many modified clustering algorithms have been proposed and proven to be effective for image segmentation. In this paper, we propose a different framework for incorporating spatial information with the aim of achieving robust and accurate segmentation in case of mixed noise without using experimentally set parameters based on the original robust information clustering (RIC) algorithm, called adaptive spatial information-theoretic clustering (ASIC) algorithm. The proposed objective function has a new dissimilarity measure, and the weighting factor for neighborhood effect is fully adaptive to the image content. It enhances the smoothness towards piecewise-homogeneous segmentation and reduces the edge blurring effect. Furthermore, a unique characteristic of the new information segmentation algorithm is that it has the capabilities to eliminate outliers at different stages of the ASIC algorithm. These result in improved segmentation result by identifying and relabeling the outliers in a relatively stronger noisy environment. Comprehensive experiments and a new information-theoretic proof are carried out to illustrate that our new algorithm can consistently improve the segmentation result while effectively handles the edge blurring effect. The experimental results with both synthetic and real images demonstrate that the proposed method is effective and robust to mixed noise and the algorithm outperforms other popular spatial clustering variants.     

用于彩图分割的自适应谱聚类算法

针对自调节谱聚类算法的缺陷,提出一种新的自适应谱聚类算法。它用全局平均N近邻距离作为比例参数σ,利用本征矢差异来估计最佳聚类分组数k,达到了比前者更好的效果,且更容易实现。在彩色图像分割实际应用中的实验结果表明,该算法适应性强、计算代价小、精度较高,性能好于或至少不差于以往的类似算法。     

Adaptive diffusion flow active contours for image segmentation

Gradient vector flow (GVF) active contour model shows good performance at concavity convergence and initialization insensitivity, yet it is susceptible to weak edges as well as deep and narrow concavity. This paper proposes a novel external force, called adaptive diffusion flow (ADF), with adaptive diffusion strategies according to the characteristics of an image region in the parametric active contour model framework for image segmentation. We exploit a harmonic hypersurface minimal functional to substitute smoothness energy term in GVF for alleviating the possible leakage. We make use of the p(x) harmonic maps, in which p(x) ranges from 1 to 2, such that the diffusion process of the flow field can be adjusted adaptively according to image characteristics. We also incorporate an infinity laplacian functional to ADF active contour model to drive the active contours onto deep and narrow concave regions of objects. The experimental results demonstrate that ADF active contour model possesses several good properties, including noise robustness, weak edge preserving and concavity convergence.     

Adaptive interpolation and segmentation based reversible image watermarking

Multimedia Tools and Applications - Reversible image watermarking schemes are used to protect ownership and copyrights of digital images. This paper proposes a novel reversible image watermarking...     

自适应梯度重建分水岭分割算法

目的 针对灰度分水岭算法存在过分割且难以直接应用到彩色图像分割的问题,提出一种自适应梯度重建分水岭分割算法。方法 该方法首先利用PCA技术对彩色图像降维,然后计算降维后的梯度图像,并采用自适应重建算法修正梯度图像,最后对优化后的梯度图像应用分水岭变换实现对彩色图像的正确分割。结果 采用融合了颜色距离、均方差和区域信息的性能指标和分割区域数对分割效果进行评估,对不同类型的彩色图像进行分割实验,本文算法在正确分割图像的同时获得了较高的性能指标。与现有的分水岭分割算法相比,提出的方法能有效剔除图像中的伪极小值,减少图像中的极小值数目,从而解决了过分割问题,有效提升了分割效果。结论 本文算法具有较好的适用性和较高的鲁棒性。     

工业CT图像自适应三维裂纹面分割*

在图像分割方法中,CV模型可以得到较好的分割结果,但是模型的收敛速度慢.在三维CV模型检测工件裂纹面的过程中,由于三维CT图像数据量比较庞大且三维CV模型本身分割速度慢,使得检测时间比较长.对于这一问题,研究了一种自适应预处理算法.该算法先对体数据进行三个方向投影,再对投影图利用迭代求最佳阈值的阈值分割方法和自适应矩形框来定位缺陷的大致区域.该方法能够自动适应裂纹面形状变化,同时大幅度减少了需要三维CV模型分割的数据量,可以非常明显地提高分割的速度.实验结果表明利用该预处理算法,三维CV模型的分割裂纹面的速度提高了近8倍.     

优化的PCNN自适应三维图像分割算法*

脉冲耦合神经网络(pulse coupled neural network,PCNN)对图像分割具有天然的优势,但是传统的PCNN模型参数难以确定,且算法耗时多。对多种PCNN模型进行研究改进,并利用统计学知识提出了一种精简高效的自适应三维分割算法。将其用于脑部磁共振成像(magnetic resonance imaging,MRI)图像的分割,把脑组织分成白质、灰质和脑脊液。与标准PCNN、传统的Otsu阈值方法、SPM8工具箱及专家手动分割结果的对比实验表明,该自适应算法具有精确性、高效性。     

微分进化的自适应彩色图像阈值分割

针对阈值的选择依赖于经验和试验的问题,提出了结合微分进化算法和二维最大熵算法得到图像自适应阈值的方法。该方法首先利用全局阈值法中的迭代法得到图像的阈值并初次对图像进行分割,然后利用微分进化算法并且结合二维最大熵阈值进行适应度的计算、个体编码、终断条件等计算图像的自适应阈值,最后对测试的图像应用微分进化算法实现对图像的正确分割。采用微分进化算法可以准确地对图像进行分割,是一个比较高效的方法,有效地提升了分割效果。与现有的自适应阈值分割算法相比,本文算法缩短了计算时间。阈值分割不仅可以对灰度图像进行分割,彩色图像也可以用阈值分割。     

自适应灰度加权的鲁棒模糊C均值图像分割

针对传统模糊C均值(fuzzy C-means,FCM)算法以及结合空间信息的相关改进算法分割精度较低、对噪声敏感的问题,提出一种自适应灰度加权的鲁棒模糊C均值图像分割算法。首先,通过定义像素间的局部灰度相似性测度来反映各像素对局部邻域的影响程度,并根据邻域窗口中各像素的灰度差异,利用指数函数进一步控制邻域像素的影响权重,实现像素灰度的自适应加权,从而提高像素灰度计算的准确性。其次,构造出一种改进的距离测度代替传统的欧氏距离,用于计算各像素与聚类中心之间的相似距离,增强算法对噪声和异常值的鲁棒性。最后,将提出的自适应灰度加权方法与改进的距离测度应用到FCM算法中,实现图像分割。实验结果表明,该算法需根据图像噪声的强度适当地选取邻域窗口大小,在此条件下算法能够取得较优的分割效果和运行效率,且对噪声具有较强的鲁棒性。     

基于小波变换的权重自适应图像分割模型

针对灰度不均匀且含噪声图像的分割问题,提出了全局和局部灰度信息的权重参 数自适应水平集分割模型。首先,利用图像的全局和局部灰度信息构造全局能量项和局部能量 项;然后,利用小波变换和小波阈值去噪方法,构造对噪声不敏感的边缘信息刻画矩阵,定义包含 图像边缘信息的自适应权重系数矩阵;最后,利用定义的权重系数矩阵组合全局和局部能量项, 得到分割模型的能量泛函。使用变分法得到了水平集函数演化方程,利用有限差分法实现数值 求解。实验结果表明,该模型兼有 Chan-Vese 模型和 Local Binary Fitting 模型的优点,能够有效 地分割灰度不均匀含噪图像,并对活动轮廓曲线的初始位置和初始形状具有很强的鲁棒性。     

Adaptive k-means clustering algorithm for MR breast image segmentation

Image segmentation is vital for meaningful analysis and interpretation of the medical images. The most popular method for clustering is k-means clustering. This article presents a new approach intended to provide more reliable magnetic resonance (MR) breast image segmentation that is based on adaptation to identify target objects through an optimization methodology that maintains the optimum result during iterations. The proposed approach improves and enhances the effectiveness and efficiency of the traditional k-means clustering algorithm. The performance of the presented approach was evaluated using various tests and different MR breast images. The experimental results demonstrate that the overall accuracy provided by the proposed adaptive k-means approach is superior to the standard k-means clustering technique.     

复杂光照下DPM图像自适应多阈值分割方法研究

复杂工况下,CCD相机采集到的DPM（Direct Part Mark）工业二维码图像受光照影响易出现大片光斑或阴影区域,造成DPM区域的信息遗漏,从而导致识别困难。为此,提出一种基于分段直方图凹度分析的多阈值自适应分割算法。首先在灰度直方图平滑的基础上计算出系列局部峰值,并借此完成直方图分段,再递推计算出每分段区域下凹处的分割阈值。其次通过引入基于阈值点局部区域信息的修正因子,使分割阈值自适应变化而更适用于局部对比度较低的状况。实验结果表明,该方法分割效果优于经典的阈值分割算法,平均运行效率比最快的多阈值分割算法提高17.75倍。经自适应局部阈值分割后,DPM图像复杂光照区域有用信息得以增强,缺失信息得以弥补,为后续的对象识别奠定基础。该方法也可推广于对比度多变的图像增强。     

改进的自适应模糊ISODATA灰度图像分割算法

传统模糊ISODATA（Fuzzy ISODATA,FISODATA）算法中,分裂-合并操作需人工选取阈值参数。而不适当的阈值往往使算法陷入局部极值,因而得到错误的类属数并最终影响图像分割结果。为此,在模糊集理论基础上提出一种改进的自适应FISODATA算法。该算法设计了自适应分裂-合并操作,即在每次分裂-合并后,根据该次计算结果改变参数阈值,解决了人为选取参数带来的诸多问题。利用该算法对模拟图像和真实IKONOS图像进行分割实验,均能得到良好的分割结果。     

Adaptive image segmentation by combining photometric invariantregion and edge information

An adaptive image segmentation scheme is proposed employing the Delaunay triangulation for image splitting. The tessellation grid of the Delaunay triangulation is adapted to the semantics of the image data by combining region and edge information. To achieve robustness against imaging conditions (e.g. shading, shadows, illumination and highlights), photometric invariant similarity measures and edge computation are proposed. Experimental results on synthetic and real images show that the segmentation method is robust to edge orientation, partially weak object boundaries and noisy-but-homogeneous regions. Furthermore, the method is robust, to a large degree, to varying imaging conditions     

融合多颜色空间分量的自适应彩色图像分割

提出了一种新的简单有效的融合多颜色分量的分割方法,首先在六个不同的颜色空间中选择最佳的待分割颜色分量,然后应用直方图和空间模糊C均值（SFCM）技术对不同颜色分量进行自适应初始分割,最后融合分割结果并进行区域合并。利用该算法在Berkeley图像库上进行了大量实验,实验结果表明,与当前一些经典分割算法Mean-shift、FCR、CTM等相比,利用该方法能够获得更好的分割结果以及更优的性能指标。     

Adaptive image segmentation for region-based object retrieval using generalized Hough transform

Finding an object inside a target image by querying multimedia data is desirable, but remains a challenge. The effectiveness of region-based representation for content-based image retrieval is extensively studied in the literature. One common weakness of region-based approaches is that perform detection using low level visual features within the region and the homogeneous image regions have little correspondence to the semantic objects. Thus, the retrieval results are often far from satisfactory. In addition, the performance is significantly affected by consistency in the segmented regions of the target object from the query and database images. Instead of solving these problems independently, this paper proposes region-based object retrieval using the generalized Hough transform (GHT) and adaptive image segmentation. The proposed approach has two phases. First, a learning phase identifies and stores stable parameters for segmenting each database image. In the retrieval phase, the adaptive image segmentation process is also performed to segment a query image into regions for retrieving visual objects inside database images through the GHT with a modified voting scheme to locate the target visual object under a certain affine transformation. The learned parameters make the segmentation results of query and database images more stable and consistent. Computer simulation results show that the proposed method gives good performance in terms of retrieval accuracy, robustness, and execution speed.     

基于归一化割的自适应多阈值图像分割方法

基于图谱理论的图像闽值分割方法是一种基于全局的单阈值分割方法,其对复杂图像的分割效果不明显,而且其采用的权值计算公式中含有两个需手动调整的参数,这些都限制了该算法的通用性.据此提出基于归一化割的自适应多阈值图像分割方法,它通过几个阈值来分割复杂图像,并且采用了一个自适应权值计算公式,提高了该方法的通用性.大量的实验结果表明该方法具有很好的分割效果,可以保留更多的图像细节.