Efficient 3D medical image segmentation algorithm over a secured multimedia network

Image segmentation has proved its importance and plays an important role in various domains such as health systems and satellite-oriented military applications. In this context, accuracy, image quality, and execution time deem to be the major issues to always consider. Although many techniques have been applied, and their experimental results have shown appealing achievements for 2D images in real-time environments, however, there is a lack of works about 3D image segmentation despite its importance in improving segmentation accuracy. Specifically, HMM was used in this domain. However, it suffers from the time complexity, which was updated using different accelerators. As it is important to have efficient 3D image segmentation, we propose in this paper a novel system for partitioning the 3D segmentation process across several distributed machines. The concepts behind distributed multimedia network segmentation were employed to accelerate the segmentation computational time of training Hidden Markov Model (HMMs). Furthermore, a secure transmission has been considered in this distributed environment and various bidirectional multimedia security algorithms have been applied. The contribution of this work lies in providing an efficient and secure algorithm for 3D image segmentation. Through a number of extensive experiments, it was proved that our proposed system is of comparable efficiency to the state of art methods in terms of segmentation accuracy, security and execution time.

     

基于内容的图像分割方法综述

图像分割是指将图像分成若干具有相似性质的区域的过程,是许多图像处理任务的预处理步骤.近年来,国内外学者主要研究基于图像内容的分割算法.在广泛调研大量文献和最新成果的基础上,将图像分割算法分为基于图论的方法、基于像素聚类的方法和语义分割方法这3种类型并分别介绍.对每类方法所包含的典型算法,尤其是最近几年利用深度网络技术的语义图像分割方法的基本思想、优缺点进行分析、对比和总结.介绍了图像分割常用的基准数据集和算法评价标准,并用实验对各种图像分割算法进行对比.最后总结全文,并对未来可能的发展趋势进行了展望.     

基于小波图像融合算法和改进FCM聚类的MR脑部图像分割算法

针对很多基于模糊C均值(FCM)的图像分割算法存在对噪声敏感和分割轮廓不清晰等问题,提出一种基于小波变换图像融合算法和FCM聚类算法的MR医学图像分割算法。在图像分割系统的第一阶段,利用Haar小波多分辨率特性保持像素间的空间信息;第二阶段,利用小波图像融合算法对得到的多分辨率图像和原始图像进行融合,进而增强被处理图像的清晰度并降低噪声;第三阶段,利用改进型FCM技术对所处理的图像进行分割。在BrainWeb数据集上进行实验,与现有相关算法相比,提出的算法具有较高的分割精度,且对噪声的鲁棒性比较强,处理时间也没有明显增加。     

Accelerating compute-intensive image segmentation algorithms using GPUs

Image segmentation is an important process that facilitates image analysis such as in object detection. Because of its importance, many different algorithms were proposed in the last decade to enhance image segmentation techniques. Clustering algorithms are among the most popular in image segmentation. The proposed algorithms differ in their accuracy and computational efficiency. This paper studies the most famous and new clustering algorithms and provides an analysis on their feasibility for parallel implementation. We have studied four algorithms which are: fuzzy C-mean, type-2 fuzzy C-mean, interval type-2 fuzzy C-mean, and modified interval type-2 fuzzy C-mean. We have implemented them in a sequential (CPU only) and a parallel hybrid CPU–GPU version. Speedup gains of 6\(\times \) to 20\(\times \) were achieved in the parallel implementation over the sequential implementation. We detail in this paper our discoveries on the portions of the algorithms that are highly parallel so as to help the image processing community, especially if these algorithms are to be used in real-time processing where efficient computation is critical.     

Automatic multi-thresholds selection for image segmentation based on evolutionary approach

Automatic thresholding has been widely used in machine vision for automatic image segmentation. Otsu’s method selects an optimum threshold by maximizing the between-class variance in a grayscale image. However, the method becomes time-consuming when extended to multi-level threshold problems, because excessive iterations are required in order to compute the cumulative probability and the mean of class. In this paper, we focus on the issue of automatic selection for multi-level thresholding, and we greatly improve the efficiency of Otsu’s method for image segmentation based on evolutionary approaches. We have investigated and evaluated the performance of the Otsu and Valleyemphasis thresholding methods. Based on our evaluation results, we have developed many different algorithms for automatic threshold selection based on the evolutionary method using the Modified Adaptive Genetic Algorithm and the Hill Climbing Algorithm. The experimental results show that the evolutionary approach achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.     

改进的FCM与局部信息相结合的图像分割

传统的EM算法和FCM算法分割精度低,时间消耗大。为解决以上不足,提出了一种基于EM、FCM和KCN三种算法相结合的全新的图像分割算法。该算法有较好的分割精度。考虑到图像会受到噪声的干扰,在改进算法的基础上又引入图像的局部信息。首先利用图像的局部信息重塑图像的灰度直方图,增强了像素的类间散布性和类内紧凑性,然后让改进的算法在重塑图像上执行。实验结果表明,该算法具有很好的分割效果和较强的抗噪性能。     

An review on superpixels generation algorithms

Superpixel segmentation is the oversegmentation of an image into a set of homogeneous regions. Superpixel has many specific properties and has been commonly used as supporting regions for primitives to reduce computations in various computer vision tasks. One property of superpixels is compactness, which is preferred in some applications. In this paper, we give an review on image superpixel segmentation algorithms proposed in recent years. Superpixel segmentation approaches are classified based on the compactness constraint and their main idea are introduced. We also compare these algorithms in visual and evaluate them with five common measurements.     

半导体器件图象阈值选取方法的研究及算法实现

图像分割是数字图象处理中的一个重要问题;基于阈值选取方法的半导体器件的图象分割,具有较高的运算效率;文中针对常见阈值选取方法的具体使用情况进行了比较研究,并提出了具体算法实现,最后提出最佳的处理算法;实验结果表明该算法能够有效提高图象分割的质量,从而提高了半导体器件检测的正确率和自动化程度。     

融合Snake模型与拓扑路线的图像分割算法

为了能够提高图像边缘检测的准确度,提出一种新型图像处理算法.该算法是基于主动轮廓方法和拓扑路线相结合的方法,目的是提高图像检测过程的精确度.该算法提出了新型技术来整合拓扑路线和主动轮廓方法各自的优点.将基于拓扑路线的初始分割边界作为Snake模型输入信号,并逐步演化成为最终对象的分割边界.实验结果表明,该算法可以处理低对比度图像,同时可以提高针对弱图像边界进行分割的准确度,取得了更好的图像分割和边缘检测效果,说明该算法有改进低对比度和自动图像分割系统的处理能力.     

A multiscale gradient algorithm for image segmentation using watershelds

Watershed transformation is a powerful tool for image segmentation. However, the effectiveness of the image segmentation methods based on watershed transformation is limited by the quality of the gradient image used in the methods. In this paper we present a multiscale algorithm for computing gradient images, with effective handling of both step and blurred edges. We also present an algorithm for eliminating irrelevant minima in the resulting gradient images. Experimental results indicate that watershed transformation with the algorithms proposed in this paper produces meaningful segmentations, even without a region merging step. The proposed algorithms can efficiently improve segmentation accuracy and significantly reduce the computational cost of watershed-based image segmentation methods.     

利用ITK和VTK集成实现三维医学图像的分割

ITK是一个对图像进行分割配准处理的开源的、基于对象的软件系统.它提供几乎所有的主流医学图像分割算法,能够解决虚拟手术中三维图像分割问题.讨论了ITK中区域生长和Level set分割算法,对CT序列图像进行分割,最后通过VTK对分割数据进行三维重建.利用ITK和VTK的功能集成,对医学图像三维组织体分割,并实现分割结果的可视化.实验证明这种方法能够满足医生对局部病变区域观测的要求,实时性良好.     

一种适用于GPU图像处理算法的合并存储结构

大多数图像处理算法都可利用GPU进行加速以达到更好的执行性能,但数据传输操作与核函数执行之间的调度策略问题仍是桎梏加速性能进一步提升的主要瓶颈。为了解决这个问题,通常采用GPU任务流将核函数执行与数据传输操作进行重叠,以隐藏部分数据传输与核函数执行耗时。但是,由于CUDA编程模型的特性以及GPU硬件资源的限制,在某些情况下,即使创建较多的任务流用于任务重叠,每个流上仍会存在串行执行的任务,导致加速效果无法进一步提升。因此,考虑利用CSS将待处理图像进行合并从而将单个流中的算子核函数及数据传输操作进行合并,以减少数据传输操作和核函数执行的固定代价及调用间隙。通过实验结果可知,提出的CSS结构不仅能在单流的情况下提高GPU图像处理算法执行性能,在多流的情况下其加速性能也得到了进一步提升,具有较好的实用性及可扩展性,适用于包含较多算子操作或较小尺寸图像批量处理的情况。此外,提出的方法对图像处理算法的GPU加速提供了新的研究思路。     

基于粗糙集与差分免疫模糊聚类算法的图像分割

提出了基于粗糙集模糊聚类与差分免疫克隆聚类的图像分割算法。该算法在差分免疫克隆聚类算法的基础上,通过引入粗糙集模糊聚类,将差分免疫克隆聚类算法中的硬聚类变成模糊聚类,从而获得更丰富的聚类信息。具体来说,由于粗糙集的优势是处理不确定的数据,因此,加入粗糙集模糊聚类后更有利于算法解决不确定性问题。通过对9幅图像分割实验结果与4种算法的对比,验证了该算法在聚类性能稳定性方面的优越性,结果还同时证明了该算法具有更高的分割正确率和更好的分割结果。     

利用Kolmogorov-Smirnov统计的区域化图像分割

目的 为了在未知或无法建立图像模型的情况下,实现统计图像分割,提出一种结合Voronoi几何划分、K-S(Kolmogorov-Smirnov)统计以及M-H(Metropolis-Hastings)算法的图像分割方法.方法 首先利用Voronoi划分将图像域划分成不同的子区域,而每个子区域为待分割同质区域的一个组成部分,并利用K-S统计定义类属异质性势能函数,然后应用非约束吉布斯表达式构建概率分布函数,最后采用M-H算法进行采样,从而实现图像分割.结果 采用本文算法,分别对模拟图像、合成图像、真实光学和SAR图像进行分割实验,针对模拟图像和合成图像,分割结果精度均达到98%以上,取得较好的分割结果.结论 提出基于区域的图像分割算法,由于该算法中图像分割模型的建立无需原先假设同质区域内像素光谱测度的概率分布,因此提出算法具有广泛的适用性.为未知或无法建立图像模型的统计图像分割提供了一种新思路.     

Retinal vessel extraction using dynamic multi-scale matched filtering and dynamic threshold processing based on histogram fitting

Automatic extraction of retinal vessels is of great significance in the field of medical diagnosis. Unfortunately, extracting vessels in retinal images with uneven background is a challenging task. In addition, accurate extraction of vessels with different widths is difficult. Aiming at these problems, in this paper, a new dynamic multi-scale filtering method together with a dynamic threshold processing scheme was proposed. The image is first divided into sub-images to facilitate the analysis of gray features. Then for each sub-image, the scales of the matched filter and the segmentation threshold are dynamically determined in accordance with the Gaussian fitting results of the gray distribution. Compared with the current blood vessel extraction algorithms based on multi-scale matched filter using uniform scales for the whole retinal image, the proposed method detects many fine vessels drowned by noise and avoids an overestimation of the thin vessels while improving the accuracy of segmentation in general.     

Color texture segmentation based on image pixel classification

Image segmentation partitions an image into nonoverlapping regions, which ideally should be meaningful for a certain purpose. Thus, image segmentation plays an important role in many multimedia applications. In recent years, many image segmentation algorithms have been developed, but they are often very complex and some undesired results occur frequently. By combination of Fuzzy Support Vector Machine (FSVM) and Fuzzy C-Means (FCM), a color texture segmentation based on image pixel classification is proposed in this paper. Specifically, we first extract the pixel-level color feature and texture feature of the image via the local spatial similarity measure model and localized Fourier transform, which is used as input of FSVM model (classifier). We then train the FSVM model (classifier) by using FCM with the extracted pixel-level features. Color image segmentation can be then performed through the trained FSVM model (classifier). Compared with three other segmentation algorithms, the results show that the proposed algorithm is more effective in color image segmentation.     

基于GrabCut改进算法的服装图像检索方法

为了消除服装图像背景的影响,针对目前的GrabCut算法存在对图像局部像素值的变化敏感、时间开销大、边缘不准确等问题,提出了改进的GrabCut算法。在改进算法中,通过对梯度图像使用多尺度分水岭去噪增强了图像的边缘信息,减少了后续处理的计算量;通过采取熵惩罚因子最优能量函数减少了检索图像的有效信息丢失。将改进后的GrabCut算法引入基于内容的服装图像检索系统中,实验结果表明与同类方法相比,所提方法在检索显示准确性以及检索的平均查准率和查全率方面均有明显的提升。     

基于混沌电磁场优化算法的多阈值彩色图像分割

为了解决彩色图像多阈值分割中计算时间长、分割精度低的问题,在电磁场优化算法(Electromagnetic Field Optimization,EFO)的基础上引入一种混沌策略用于算法初始化中,提出混沌电磁场优化算法(Chaotic Electromagnetic Field Optimization,CEFO)对图像的最佳阈值向量进行搜索。将其与另外5种优化算法进行对比,采用PSNR、MSSIM和FSIM 3个图像质量评价指标和算法运行时间(CPU Time)对6种分割算法进行分析比较。结果表明,CEFO具有收敛速度快、分割精度高的优势,能够胜任多阈值彩色图像分割的工程任务。     

一种基于边缘生长的灰度和彩色图象分割方法

边缘检测可以快速准确地提供区域分割的边缘点,是图象处理的一个重要领域。但由于边缘点不连续和难以把存在大量碎边缘点的高细节区提取出来这两个原因,而不能直接实现完整意义上的图象分割。为此提出用边缘生长的方法来解决不连续的边缘点链接问题和通过找出高细节区周围的区域,以便间接地将高细节区围成一个区域。该算法是边缘检测的后续处理,适合于多种应用目的,同时还可以嵌入到其它利用边缘信息的分割算法中。     

A Practical Case Study: Face Recognition on Low Quality Images Using Gabor Wavelet and Support Vector Machines

Image segmentation is accepted to be one of the most important problems in image analysis. The good performance of any recognition system strongly depends on the results provided by the segmentation module. According to many researchers, segmentation finishes when the goal of observer is satisfied. Experience has shown that the most effective methods continue to be the iterative algorithms. However, a problem with these algorithms is the stopping criterion. In this work, we present a strategy for image segmentation through a new algorithm based on recursively applying the mean shift filtering, where entropy is used as a stopping criterion. The main feature of the proposed algorithm is to carry out segmentation in an only step. In other words, with the new algorithm is not necessary to carry out additionally the segmentation step, where in many occasions (mainly in complex applications), it can be computationally expensive. The effectiveness of the proposed algorithm is shown through several experimental results. The obtained results proved that the proposed segmentation algorithm is a straightforward extension of the filtering process. In this paper a comparison between our algorithm and so called EDISON System was carried out.