基于距离变换的改进分水岭算法在白细胞图像分割中的应用

在白细胞图像中,由于白细胞细胞核的存在,直接应用分水岭算法时,往往达不到较好的效果。本文提出一种结合EM聚类的改进分水岭算法。通过将EM聚类获得的图像中细胞核区域替换,然后使用基于距离变换的分水岭分割,确定白细胞区域。对距离变换后的图像采用形态学处理减少了细胞分割中的过分割现象。同时使用细胞核位置的先验条件,合并分水岭分割区域,进一步减小过分割的影响。本文方法提供一种新的将分水岭算法应用于白细胞分割的思路。同时实验证明,方法在分割精度上有着良好的表现。     

分水岭算法在重叠细胞图象分割中的应用

分水岭算法是一种广泛使用的分割方法,将其用于细胞图象分割可以克服由于细胞交叠造成的图象分析困难,但缺陷在于它的过分割结果。本文给出一种针对分水岭过分割问题的解决方案,引入灰度差值图的概念,提出一种基于灰度差值图和距离图的变换,将变换结果作为分水岭算法的输入图象;最后对需要存在过分割的区域根据区域灰度性质合并过分割区域。     

分水岭算法在重叠细胞图象分割中的应用

分水岭算法是一种广泛使用的分割方法,将其用于细胞图象分割可以克服由于细胞交叠造成的图象分析困难,但缺陷在于它的过分割结果.本文给出一种针对分水岭过分割问题的解决方案,引入灰度差值图的概念,提出一种基于灰度差值图和距离图的变换,将变换结果作为分水岭算法的输入图象最后对需要存在过分割的区域根据区域灰度性质合并过分割区域.     

基于改进分水岭变换的矿石图像分割算法

为了准确测量传送带上的矿石尺寸,提出了一种局部自适应阈值化和改进的分水岭变换相结合的矿石图像分割算法.该算法利用基于积分图像的自适应阈值化算法提取矿石区域;对二值图像做距离变换与双边滤波处理,并应用提出的基于区域合并的分水岭变换算法对图像进行分割;将提取的矿石区域与分割结果进行合并,得到最终的分割结果.对现场采集的复杂的矿石图像进行仿真实验,实验结果表明,该算法分割准确、速度快、光照自适应强.     

基于分水岭变换的粘连颗粒图像分割方法

提出了一种基于分水岭变换的粘连颗粒图像分割方法. 首先对图像进行预处理,进行二值化;然后通过距离变换和灰度形态重构得到每个目标的种子区域（目标标记）;再根据目标标记使用强制最小技术修正距离变换图;最后,对修正后的距离变换图进行分水岭变换,得到分割结果. 在Matlab环境下进行实验,结果表明该算法效果良好,能有效的抑制过分割.     

混合分水岭变换和改进FCM的图像分割方法

分水岭变换是图像分割的一种强有力的形态工具,能够自动生成一系列封闭分割区域。其不足之处是过分割、对噪声敏感。为克服分水岭变换固有的缺点,综合利用非线性滤波和改进的FCM算法优化分水岭变换得出的初始分割,提出了一种新的混合分割算法-HWIF（Hybrid Watershed and Improved FCM）分割法。与MeanShift算法及区域合并算法相比,该方法充分利用了区域的灰度和区域间的空间信息。实验结果表明该算法能有效克服分水岭算法的过分割问题,且分割效果优于以上两种方法。     

基于数学形态学和区域合并的医学CT图像分割*

针对传统分水岭算法分割腹部CT图像存在的过分割情况,提出了一种基于形态学优化和区域合并的分水岭分割算法。该方法先利用多尺度数学形态学方法检测出梯度图像,并用形态学重构去除细密纹理和噪声引起的局部极值,然后进行分水岭变换。为了产生有意义的分割,采用简单的区域灰度均值对变换后的图像进行有效的合并。实验结果表明,该方法能有效解决分水岭算法的过分割问题,得到较好的分割效果。     

基于梯度修正和区域融合的分水岭分割算法

针对传统分水岭算法中存在的过分割现象,提出了一种基于梯度修正和层次区域融合的分水岭分割方法。该算法首先利用开闭双重建操作以及非线性变换对梯度图像进行修正;然后求取浮点活动图像并作为分水岭算法的输入;最后在区域灰度相似性准则的基础上,结合对比度和边界强度准则对分水岭变换结果进行小区域的合并,得到最终的分割结果。实验结果表明,该算法能有效地解决过分割问题,具有良好的鲁棒性和适应性。     

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

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

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

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

流域变换建模及其算法研究的新进展

流域变换是数学形态学中用于图象分割的一种经典方法 .虽然流域变换曾因运算量大、效率低而使得其研究工作遭到冷遇 ,但也因此出现了一些新的理论和算法 ,并随着并行手段的引入 ,又使其重新成为研究的热点 ;同时就近期许多研究成果而言 ,形式化模型的多样性 ,使得流域变换的定义、算法和实现 ,尚缺乏统一的描述和全面的总结 .针对这一情况 ,首先给出了连续域流域变换的严格数学模型和两种离散情况下典型的形式化定义 ;然后分类总结了近年来 ,流域变换算法实现的新进展 ;最后提出了有待进一步研究的问题 .     

Parallel computation of the Euclidean distance transform on a three-dimensional image array

In a two- or three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. Because the EDT computation is a global operation, it is prohibitively time consuming when performing the EDT for image processing. In order to provide the efficient transform computations, parallelism is employed. We first derive several important geometry relations and properties among parallel planes. We then, develop a parallel algorithm for the three-dimensional Euclidean distance transform (3D-EDT) on the EREW PRAM computation model. The time complexity of our parallel algorithm is O(log/sup 2/ N) for an N/spl times/N/spl times/N image array and this is currently the best known result. A generalized parallel algorithm for the 3D-EDT is also proposed. We implement the proposed algorithms sequentially, the performance of which exceeds the existing algorithms (proposed by Yamada, 1984). Finally, we develop the corresponding parallel programs on both the emulated EREW PRAM model computer and the IBM SP2 to verify the speed-up properties of the proposed algorithms.     

基于Hausdorff距离的图像匹配并行算法设计与实现

随着图像匹配的应用越来越广泛,图像匹配的实时性要求也越来越高。为了提高图像匹配的速度和更好地利用多核计算资源,设计了一种基于Hausdorff距离的图像匹配并行算法。首先介绍了Hausdorff距离的定义,然后分析了图像匹配串行算法的效率,在此基础上设计了基于Hausdorff距离的图像匹配并行算法,最后采用Matlab在多核计算机上对并行算法进行了实现。实验结果表明,文中所设计的并行算法能够显著提高图像匹配速度,并具有较好的抗失真和抗噪声性能。文中设计的并行算法有较好的扩展性,可以将这种并行思想应用到其它图像匹配算法的并行设计中。     

A unified distance transform algorithm and architecture

Standard distance transform algorithms produce approximate results and are unsuitable for real-time implementation since they require massive parallelism. A new unified algorithm that computes distance and related nearest feature transforms concurrently for arbitrary bit maps based on any distance function from a broad class is presented. The algorithm has an efficient implementation on serial processors and a unified transform architecture is proposed for feasible real-time performance based on parallel row followed by parallel column scanning. Its importance lies in that it supports real-time performance and a broader set of machine vision applications than the standard approach.     

Parallel watershed transformation algorithms for image segmentation

The watershed transformation is a mid-level operation used in morphological image segmentation. Techniques applied on large images, which must often complete fast, are usually computationally expensive and complex entailing efficient parallel algorithms. Two distributed approaches of the watershed transformation are introduced in this paper. The algorithms survey in a Single Program Multiple Data (SPMD) model both local and global connectivity properties of the morphological gradient of a gray-scale image to label connected components. The sequentiality of the serial algorithm is broken in the parallel versions by exploiting the ordering relation between two neighboring pixels successively incorporated in the same region. Thus, a path is traced, for every unlabeled pixel, down to its region of inclusion (whose label is then propagated backwards); in the second algorithm, regions grow independently around their seeds. In both cases only pixels which satisfy the ordering relation are incorporated in any region. This way, not only different regions are explored in a parallel fashion, but also different parts of the same region, when the latter extends to neighboring subdomains, are treated likewise. Running time and relative speedup evaluated on a Cray T3D parallel computer are used to appreciate the performance of both algorithms.     

Concurrent computation of topological watershed on shared memory parallel machines

The watershed transform is considered as the most appropriate method for image segmentation in the field of mathematical morphology. In the following paper, we present an adapted topological watershed algorithm suited for a rapid and effective implementation on Shared Memory Parallel Machine (SMPM). The introduced algorithm allows a parallel watershed computing while preserving the given topology. No prior minima extraction is needed, nor the use of any sorting step or hierarchical queue. The strategy that guides the parallel watershed computing, labeled SDM-Strategy (equivalent to Split-Distributes and Merge), is also presented. Experimental analyses such as execution time, performance enhancement, cache consumption, efficiency and scalability are also presented and discussed.     

Euclidean distance transform for binary images on reconfigurable mesh-connected computers.

The distance calculation in an image is a basic operation in computer vision, pattern recognition, and robotics. Several parallel algorithms have been proposed for calculating the Euclidean distance transform (EDT). Recently, Chen and Chuang proposed a parallel algorithm for computing the EDT on mesh-connected SIMD computers (1995). For an nxn image, their algorithm runs in O(n) time on a two-dimensional (2-D) nxn mesh-connected processor array. In this paper, we propose a more efficient parallel algorithm for computing the EDT on a reconfigurable mesh model. For the same problem, our algorithm runs in O(log(2)n) time on a 2-D nxn reconfigurable mesh. Since a reconfigurable mesh uses the same amount of VLSI area as a plain mesh of the same size does when implemented in VLSI, our algorithm improves the result in [3] significantly.     

Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. ¹ published a principle of the watershed computation by means of an iterative forest transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D case (image) without a detailed discussion of its computation and memory demands for real datasets.
As IFT cleverly solves the problem of plateaus and as it gives precise results when thin objects have to be segmented, it is obvious to use this algorithm for 3D datasets taking in mind the minimizing of a higher memory consumption for the 3D case without loosing low asymptotical time complexity of O ( m + C )(and also the real computation speed). The main goal of this paper is an implementation of the IFT algorithm with a priority queue with buckets and careful tuning of this implementation to reach as minimal memory consumption as possible.
The paper presents five possible modifications and methods of implementation of the IFT algorithm. All presented implementations keep the time complexity of the standard priority queue with buckets but the best one minimizes the costly memory allocation and needs only 19–45% of memory for typical 3D medical imaging datasets.
Memory saving was reached by an IFT algorithm simplification, which stores more elements in temporary structures but these elements are simpler and thus need less memory.The best presented modification allows segmentation of large 3D medical datasets (up to 512 × 512 × 680 voxels) with 12- or 16-bits per voxel on currently available PC based workstations.