两种超声颈动脉血管斑块图像分割方法比较与改进

针对颈动脉超声图像,实现了两种颈动脉血管斑块的分割方法—活动形状模型(Active Shape Models,ASM)和活动表观模型(Active Appearance Models,AAM),对38组颈动脉超声图像进行了内外轮廓分割,并比较了两类算法对颈动脉内外轮廓分割的有效性。在综合分析实验结果的基础上,结合颈动脉超声图像的特点,通过引入比例不变性改进了ASM算法。统计结果表明,在运行时间上,ASM和改进ASM的运行时间相近,AAM大约为ASM和改进ASM的16倍。同时,采用FOM和RAY两种方法对分割效果进行评价,结果表明,改进ASM算法的分割效果较ASM有了很大的提高,是最适合颈动脉血管斑块超声图像分割的算法。     

2D/3D information fusion for building extraction from high-resolution satellite stereo images using kernel graph cuts

This study presents a building extraction strategy from High-resolution satellite stereo images (HRSSI) using 2D and 3D information fusion. In the 2D processing strategy, a visible vegetation index (VVI) is generated. In the 3D processing, a disparity map is generated using semi-global matching (SGM). To remove defects from the disparity map, an object-based approach is proposed by using mean-shift image segmentation and extracting rectangles. By removing terrain effects, a normalized disparity map (nDM) is produced. In the next step, vegetation pixels are removed from nDM and an initial building mask is generated. As nDM does not have precise building boundaries, hybrid segmentation by the kernel graph cut (KGC) is applied to the feature space including the RGB, nDM, and VVI and the results are used in a decision level fusion step. By this methodology, segments that are highly intersected with initial building mask are classified as buildings. Finally, a building boundary refinement (BBR) algorithm is applied to buildings for removing the remaining defects. The proposed method is applied to two pairs of GeoEye-1 stereo images including residential and industrial test areas. Evaluation results show the completeness and correctness level of higher than 90% for the two test areas. Further evaluations show that the quality metric has significantly changed after decision level fusion using the KGC.     

低秩和主动形状模型的肺区分割

目的 肺区分割是肺癌计算机辅助诊断系统的首要步骤。主动形状模型（active shape model,ASM）能根据训练集获得肺区形状模型,再结合待分割肺区影像自身的局部特征,进行测试影像的分割。由于主成分分析（principal component analysis,PCA）仅能去除服从高斯分布的噪声,不能处理其他类型的噪声,所以当训练集含有非高斯类型的噪声样本时,采用基于PCA的ASM无法训练出正确的形状模型,使得肺区分割不能得到正确的结果。而低秩（low rank,LR）理论的鲁棒主成分分析（robust principal component analysis,RPCA）能去除各种类型的噪声,基于此,本文提出一种将RPCA与ASM相结合的方法。方法 首先对训练样本集标记点矩阵进行低秩分解,去除噪声样本对训练出的形状模型的影响。然后在ASM训练局部梯度模型时,用判断训练样本轮廓上的标记点曲率直方图的相似度来去除噪声样本。结果 在训练集含噪声样本时,将基于RPCA的ASM与传统ASM（即基于PCA的ASM）分别生成的形状模型进行对比,发现基于RPCA的ASM生成的形状模型与训练集无噪声样本时传统ASM生成的形状模型更相符。在训练集含噪声样本的情况下,基于RPCA的ASM方法分割EMPIRE10数据集中的22个肺影像,与金标准的重叠度为94.5%,而基于PCA的ASM方法分割准确率仅为69.5%。结论 实验结果表明,在训练样本集中有噪声样本的情况下,基于RPCA的ASM分割能得到比基于PCA的ASM更好的分割效果。     

基于三维激光雷达的道路边界提取和障碍物检测算法

为了快速有效地提取智能车辆在不同环境下的道路环境信息,提出基于三维激光雷达的道路边界提取和障碍物检测算法.首先,对三维激光雷达点云数据进行栅格化滤波处理,利用单束激光点云空间邻域联合分割的方法进行空间分析,得到点云平滑度特征图像.然后,采用自适应方向搜索算法获取道路边界候选点,并进行聚类分析和曲线拟合.最后,对道路边界约束下可通行区域内点云进行聚类分割,获得道路内障碍物方位和距离信息.实验表明,文中算法能够实时准确地提取道路边界和障碍物位置信息,满足智能车环境建模和路径规划的需求.     

利用三维自适应分裂-合并的MRI图像分割算法设计

为了在医学图像分割中,发现均匀几何三维区域的复杂形状,以提高分割准确率,提出一种基于3D几何特征分裂-合并(ASM)的脑部MRI图像分割算法;首先构建简单平行六面体的12种3D区域分割策略,体积分割技术将整个体积划分为许多大的均匀三维几何区;然后,在体积内定义更多小的均匀区域,以便在随后的合并步骤中有更大的生存概率;最后,进行多级区域合并,合并阶段只涉及复杂ASM树的叶子,考虑灰度相似性和共同边界区的大小,将小的区域合并为大邻近区;相比其他几种MRI图像分割算法,提出的方法在分割过程对噪声具有鲁棒性,提高了分割性能和准确率;另外提出的方法不需要训练数据集。     

基于QPSO的二维模糊最大熵图像阈值分割方法

针对运用图像分割方法求取阈值时存在的计算复杂、时问长、实用性差等问题,提出一种新的二维最大熵图像分割方法,该方法利用基于量子行为的微粒群算法对图像的二维阈值空间进行全局搜索,并将搜索到的二维熵最大值所对应的点灰度一区域灰度均值作为闽值进行图像分割。实验结果表明,该方法具有一定优越性,在执行时间与收敛性方面均得到较理想的分割效果。     

3维灰度矩阵的钢板缺陷图像识别

目的 钢板表面缺陷的种类多样、灰度结构复杂,现有的图像分割技术运用在灰度结构复杂、目标边缘模糊的钢板缺陷图像中仍然存在识别效率低、过分割现象明显等问题,本文结合图像灰度矩阵的空间特征,提出一种基于3维灰度矩阵的钢板表面缺陷识别算法。方法 首先根据灰度图像构建3维灰度矩阵;然后引入半类间方差改进克里金插值算法,绘制3维灰度矩阵的等值线图;接着构建等值线的拓扑关系树;最后根据自定义的全局搜索策略和局部搜索策略相结合,寻找局部凹凸区域,从而定位缺陷区域,达到分割钢板表面缺陷的目的。结果 本文方法能有效地识别钢板表面缺陷区域,对光照变化不敏感,在保证低误差率的前提下,提高了有效分割率。通过对氧化、辊印、结疤和气泡四类钢板缺陷图像进行测试,从分割效果和评价指标两方面对比其他钢板缺陷分割算法。与Fisher阈值分割法、经典的活动轮廓模型CV模型、基于半局部区域描述符的活动轮廓模型HTB模型和改进背景差分法进行分割效果对比,本文方法对四类钢板表面缺陷的识别更精确,分割结果更细致,一定程度上抑制了过分割现象。与大津法Ostu、1维最大模糊熵法1DMFE、最大模糊超熵法MFEE进行评价指标对比,得出对于分割孔洞和辊印图像,本文方法在误分割率均保持在2.0%以下的前提下,将有效信息率分别提升了1.6%和2.1%;对于夹杂图像,本文方法在3.4%的误分割率的前提下,具有85%以上的有效信息率。结论 提出的基于3维灰度矩阵的钢板缺陷图像识别算法可以有效地识别多种类型的钢板缺陷,即使在缺陷结构复杂的图像识别中仍具有较高的识别率。     

GC-ASM: Synergistic integration of graph-cut and active shape model strategies for medical image segmentation

Image segmentation methods may be classified into two categories: purely image based and model based. Each of these two classes has its own advantages and disadvantages. In this paper, we propose a novel synergistic combination of the image based graph-cut (GC) method with the model based ASM method to arrive at the GC-ASM method for medical image segmentation. A multi-object GC cost function is proposed which effectively integrates the ASM shape information into the GC framework. The proposed method consists of two phases: model building and segmentation. In the model building phase, the ASM model is built and the parameters of the GC are estimated. The segmentation phase consists of two main steps: initialization (recognition) and delineation. For initialization, an automatic method is proposed which estimates the pose (translation, orientation, and scale) of the model, and obtains a rough segmentation result which also provides the shape information for the GC method. For delineation, an iterative GC-ASM algorithm is proposed which performs finer delineation based on the initialization results. The proposed methods are implemented to operate on 2D images and evaluated on clinical chest CT, abdominal CT, and foot MRI data sets. The results show the following: (a) An overall delineation accuracy of TPVF > 96%, FPVF < 0.6% can be achieved via GC-ASM for different objects, modalities, and body regions. (b) GC-ASM improves over ASM in its accuracy and precision to search region. (c) GC-ASM requires far fewer landmarks (about 1/3 of ASM) than ASM. (d) GC-ASM achieves full automation in the segmentation step compared to GC which requires seed specification and improves on the accuracy of GC. (e) One disadvantage of GC-ASM is its increased computational expense owing to the iterative nature of the algorithm.     

局部曲线拟合的虹膜快速定位的方法研究

针对多噪声情况下虹膜准确快速定位的困难,提出了一种基于局部曲线拟合的分割算法。该算法的基本思想是离线求出清晰虹膜边界曲线的傅立叶描绘子,然后利用标准曲线对目标图像中的边界曲线进行搜寻拟合,对虹膜位置进行判断,实现对其的快速准确定位。实验结果表明,该算法能够稳定地实现目标分割提取,具有较好的鲁棒性。     

3D object segmentation using B-Surface

3D object segmentation is important in computer vision such as target detection in biomedical image analysis. A new method, called B-Surface algorithm, is generated for 3D object segmentation. An improved 3D external force field combined with the normalized GVF is utilized. After the initialization of a surface model near the target, B-Surface starts to deform to locate the boundary of the object. First, it overcomes the difficulty that comes from analyzing 3D volume image slice by slice. And the speed of B-Surface deformation is enhanced since the internal forces are not needed to compute in every iteration deformation step. Next, the normal at every surface point can be calculated easily since B-Surface is a continuous deformable model. And it has the ability to achieve high compression ratio (ratio of data to parameters) by presenting the whole surface with only a relatively small number of control points. Experimental results and analysis are presented in this paper. We can see that the B-Surface algorithm can find the surface of the target efficiently.     

Using classifiers as heuristics to describe local structure in Active Shape Models with small training sets

Active Shape Models (ASM) are a successful image segmentation technique that is widely used by the image processing community. This technique is very appealing when the results of the segmentation are going to be used to perform some kind of classification, as it provides a mathematical model of the segmented contours. Nevertheless, little attention has been paid to the development of general local appearance models for small image training sets and most researchers have resorted to ad hoc solutions. In this paper we propose a heuristic approach to this problem. A general procedure for the use of heuristics to guide the ASM search algorithm and an implementation using machine learning classifiers is presented. This procedure is also extended to cope with multichannel images. Tests are carried out over small synthetic and real image datasets. The performance of this approach is compared to the most commonly used Mahalanobis appearance model and the simpler edge search strategy. The results show that the heuristic approach performs better than the other two procedures.     

基于三维变换形状搜索的ASM人脸特征点定位

通过三维变换的特征点搜索方法对二维人脸图像进行形状搜索,形状搜索以人脸的标准三维模型为基础,将二维坐标三维化;通过三维变换、投影等过程迭代搜索逼近目标形状,最后得到三维变换的10个姿态参数。测试结果表明：在对非活动形状模型(ASM)训练集中的多姿态人脸进行形状搜索时,三维变换方法具有更好的逼近效果。较好地模拟了人脸姿态的实际变化,有效地解决了ASM人脸偏转的非线性问题。     

Geometric techniques for 3D tracking of ultrasound sensor,tumor segmentation in ultrasound images,and 3D reconstruction

This paper presents different methods, some based on geometric algebra, for ultrasound probe tracking in endoscopic images, 3D allocation of the ultrasound probe, ultrasound image segmentation (to extract objects like tumors), and 3D reconstruction of the surface defined by a set of points. The tracking of the ultrasound probe in endoscopic images is done with a particle filter and an auxiliary method based on thresholding in the HSV space. The 3D pose of the ultrasound probe is calculated using conformal geometric algebra (to locate each slide in 3D space). Each slide (ultrasound image) is segmented using two methods: the level-set method and the morphological operators approach in order to obtain the object we are interested in. The points on the object of interest are obtained from the segmented ultrasound images, and then a 3D object is obtained by refining the convex hull. To do that, a peeling process with an adaptive radius is applied, all of this in the geometric algebra framework. Results for points from ultrasound images, as well as for points from objects from the AimatShape Project, are presented (A.I.M.A.T.S.H.A.P.E. – Advanced an Innovative Models And Tools for the development of Semantic-based systems for Handling, Acquiring, and Processing knowledge Embedded in multidimensional digital objects).     

改进的红外图像2维Otsu分割算法

针对红外图像有别于一般灰度图像的特点,常用的灰度级平均灰度级2维直方图区域划分在红外图像分割中效果不佳,为此提出一种改进的灰度级梯度2维Otsu阈值选取方法,选取合适的梯度算子,利用改进的粒子群优化算法寻找分割阈值,在算法中加入有效判断早熟停滞的方法,一旦检索到早熟迹象,便随机改变最优解的任意1维分量值,使其跳出局部最大,实现全局寻优过程的快速收敛。仿真实验结果表明,该算法由于使用新的2维直方图,分割后的红外图像边界形状准确,特征细节清晰,运算速度也得到了有效提高。     

Multimodal image registration system for image-guided orthopaedic surgery

We present a novel multimodality image registration system for spinal surgery. The system comprises a surface-based algorithm that performs computed tomography/magnetic resonance (CT/MR) rigid registration and MR image segmentation in an iterative manner. The segmentation/registration process progressively refines the result of MR image segmentation and CT/MR registration. For MR image segmentation, we propose a method based on the double-front level set that avoids boundary leakages, prevents interference from other objects in the image, and reduces computational time by constraining the search space. In order to reduce the registration error from the misclassification of the soft tissue surrounding the bone in MR images, we propose a weighted surface-based CT/MR registration scheme. The resultant weighted surface is registered to the segmented surface of the CT image. Contours are generated from the reconstructed CT surfaces for subsequent MR image segmentation. This process iterates till convergence. The registration method achieves accuracy comparable to conventional techniques while being significantly faster. Experimental results demonstrate the advantages of the proposed approach and its application to different anatomies.     

Fully automatic segmentation of breast ultrasound images based on breast characteristics in space and frequency domains

Due to the complicated structure of breast and poor quality of ultrasound images, accurately and automatically locating regions of interest (ROIs) and segmenting tumors are challenging problems for breast ultrasound (BUS) computer-aided diagnosis systems. In this paper, we propose a fully automatic BUS image segmentation approach for performing accurate and robust ROI generation, and tumor segmentation. In the ROI generation step, the proposed adaptive reference point (RP) generation algorithm can produce the RPs automatically based on the breast anatomy; and the multipath search algorithm generates the seeds accurately and fast. In the tumor segmentation step, we propose a segmentation framework in which the cost function is defined in terms of tumor?s boundary and region information in both frequency and space domains. First, the frequency constraint is built based on the newly proposed edge detector which is invariant to contrast and brightness; and then the tumor pose, position and intensity distribution are modeled to constrain the segmentation in the spatial domain. The well-designed cost function is graph-representable and its global optimum can be found. The proposed fully automatic segmentation method is applied to a BUS database with 184 cases (93 benign and 91 malignant), and the performance is evaluated by the area and boundary error metrics. Compared with the newly published fully automatic method, the proposed method is more accurate and robust in segmenting BUS images.     

基于微粒群优化和粗糙熵的图像分割算法

提出一种基于微粒群优化(PSO)的边界区域粗糙熵的阈值图像分割算法。该算法采用边界粗糙熵作为图像分割的评价标准,利用优化领域的PSO功能把图像分割问题转化为优化问题。实验结果表明,该方法使用PSO算法避免了早期大量熵的计算,相对于分块大小的敏感性较小,得到较好的分割效果,并且能提高计算速度,是一种实用有效的图像分割方法。     

基于三维Otsu法的红外图像阈值分割

常用的阈值分割方法在对红外图像进行分割时,由于红外图像本身的特点,会出现准确性不高的问题。为此,提出一种基于灰 度-平均灰度-梯度直方图的三维Otsu法,使用稀疏矩阵和改进的粒子群优化(PSO)算法,并在标准PSO算法中加入判断早熟停滞的因子,进行最佳阈值的选取,以提高运算速度,保证准确度。实验结果表明,该方法能够快速有效地对红外图像进行分割。     

先验形状约束的超声前列腺图像分割方法

提出一种结合超声前列腺图像的局部特征和前列腺的先验形状知识的分割方法。该方法在传统图像分割方法中引入了前列腺的先验形状约束,使得分割能够一定程度地避免由于超声图像中噪声、伪影、灰度分布不均匀等因素对前列腺分割所造成的影响。算法分为两个部分：先验形状模型的学习和先验形状约束的分割。在先验形状模型学习阶段,采用主成分分析方法对形状作特征提取,以高斯分布作为形变参数的估计;在先验形状约束分剖阶段,将基于局部高斯拟合特征的活动轮廓模型与形状模型相结合对前列腺图像分割。实验表明,所提出的方法在超声前列腺图像中取得了良好的分割效果,为临床诊断和治疗提供了定量分析的工具。     

A multi-scale 3D Otsu thresholding algorithm for medical image segmentation

Thresholding technique is one of the most imperative practices to accomplish image segmentation. In this paper, a novel thresholding algorithm based on 3D Otsu and multi-scale image representation is proposed for medical image segmentation. Considering the high time complexity of 3D Otsu algorithm, an acceleration variant is invented using dimension decomposition rule. In order to reduce the effects of noises and weak edges, multi-scale image representation is brought into the segmentation algorithm. The whole segmentation algorithm is designed as an iteration procedure. In each iteration, the image is segmented by the efficient 3D Otsu, and then it is filtered by a fast local Laplacian filtering to get a smoothed image which will be input into the next iteration. Finally, the segmentation results are pooled to get a final segmentation using majority voting rules. The attractive features of the algorithm are that its segmentation results are stable, it is robust to noises and it holds for both bi-level and multi-level thresholding cases. Experiments on medical MR brain images are conducted to demonstrate the effectiveness of the proposed method. The experimental results indicate that the proposed algorithm is superior to the other multilevel thresholding algorithms consistently.