共查询到19条相似文献,搜索用时 140 毫秒
1.
一种改进的交互式医学图像序列分割方法 总被引:9,自引:0,他引:9
本文介绍了一种结合live wire算法和活动轮廓模型的医学图像序列的分割方法.我们通过把live wire算法和图像分割中一般的区域增长方法结合来改进live wire算法,并用改进后的算法来对医学图像序列中的单张或多张切片进行交互式的准确分割.然后计算机利用活动轮廓模型来自动分割相邻的未分割切片.我们通过在活动轮廓模型的边缘点中引入记录已分割物体边缘附近局部区域特征的灰度模型来把已分割切片中的物体与背景的局部区域特征带入相邻的未分割切片中,并用由灰度模型定义的区域相似性代替活动轮廓模型中的外能来引导边缘轮廓收敛到物体的实际边缘.本文还介绍了一种基于live wire算法思想的简单的分割结果交互式修补方法.实验表明我们的算法仅需少量用户交互就能快速准确的从医学图像序列中分割出感兴趣的物体. 相似文献
2.
本文提出了一种自动的运动对象分割算法,利用浮点图像的轮廓进行区域分割,然后根据帧间运动信息进行区域合并,分割出视频序列中的运动物体. 相似文献
3.
基于Snake活动轮廓模型的视频跟踪分割方法 总被引:1,自引:3,他引:1
基于Snake活动轮廓模型,采用时空融合的方式,根据短时间内相邻帧的运动趋势差异相似的前提,首先将视频序列分成若干个小段,每段有k帧视频,选取段内的前两帧为关键帧,通过运动检测的方式自动得到这两帧中运动对象的大致区域;然后进行帧内Snake演变,搜索精确轮廓;最后以关键帧间运动对象形心的运动矢量预测勾勒后续帧的初始轮廓,进行帧内Snake精确轮廓定位,从而实现所有帧的视频对象分割。相比于传统方法,本文方法克服了手动绘制初始轮廓的缺点,在空域对Snake贪婪方法进行了改进而且精确度高,速度快。实验表明,本文方法成功地实现了前后帧图像之间运动对象的对应匹配关系,并通过改进后的Snake贪婪方法得到了精确的分割结果。 相似文献
4.
Snake算法能够跟踪运动图像中对象的非刚性运动,但是对于背景复杂的图像,Snake跟踪的结果不够理想。因而在首帧分割得到对象轮廓的二值模型后,再采用基于Hausdorff距离的跟踪器,找到对象模型在后继帧中的最佳匹配位置;然后采用Snake模型对该匹配位置上的非刚性形变的像素进行匹配。实验表明:对于具有静止背景且前景对象不是快速运动的视频序列,与直接采用Snake技术进行运动对象的跟踪相比,该提取视频对象平面过程能够进一步提高结果的正确性。 相似文献
5.
本文提出了一种自动的运动对象分割算法,利用浮点图像的轮廓进行区域分割,然后根据帧间运动信息进行区域合并,分割出视频序列中的运动物体。 相似文献
6.
7.
一种基于脑部肿瘤MR图像的分割方法 总被引:1,自引:0,他引:1
针对传统的分割方法难以实现医学图像自动分割和准确分割的问题,提出了一种基于GVF Snake模型的医学图像分割方法。该方法采用Canny算子的边缘检测结果作为GVF扩散方程计算的边缘映射图,提高了GVF Snake模型的抗噪性能;用分水岭算法自动获取的轮廓作为GVF Snake模型分割的初始轮廓,降低了GVF力场计算的复杂性和分割时轮廓线的迭代次数。分析和实验结果表明,采用该方法对脑部肿瘤MR图像进行分割时,能自动准确地分割出肿瘤区域。 相似文献
8.
9.
10.
11.
12.
13.
一种用于岩心序列图像轮廓提取的改进Snake算法 总被引:2,自引:2,他引:0
针对岩心序列图像的轮廓提取,提出了一种改进的Snake算法。对序列图像第1帧手动初始化轮廓点,如果相邻轮廓点之间距离大于给定阈值,则自动插入新的点,对于每一轮廓点,按照一定规则计算其搜索半径,然后找出搜索半径内的能量最小的点代替原始点。前一帧得到的结果又作为后一帧的初始点进行轮廓提取,从而得到整个序列图像的轮廓。实验结果表明,本算法具有简单、实用、实时性强等特点。 相似文献
14.
15.
《Mechatronics》2001,11(2):199-226
An active contour model, Snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid (i.e. deformable) objects by Kass in 1987. Snake is designed on the basis of Snake energies. Segmenting and tracking can be executed successfully by the process of energy minimization. The ability to contract is an important process for segmenting objects from images, but the contraction forces of Kass’ Snake are dependent on the object’s form. In this research, new contraction energy, independent of the object’s form, is proposed for the better segmentation of objects. Kass’ Snake can be applied to the case of small changes between images because its solutions can be achieved on the basis of variational approach. If a somewhat fast moving object exists in successive images, Kass’ Snake will not operate well because the moving object may have large differences in its position or form, between successive images. Snake’s nodes may fall into the local minima in their motion to the new positions of the target object in next image. When the motion is too large to apply image flow energy to tracking, a jump mode is proposed for solving the problem. The vector used to make Snake’s nodes jump to the new location can be obtained by processing the image flow. The effectiveness of the proposed Snake is confirmed by some simulations. 相似文献
16.
If a somewhat fast moving object exists in a complicated tracking environment, snake’s nodes may fall into the inaccurate local minima. We propose a mean shift snake algorithm to solve this problem. However, if the object goes beyond the limits of mean shift snake module operation in suc- cessive sequences, mean shift snake’s nodes may also fall into the local minima in their moving to the new object position. This paper presents a motion compensation strategy by using particle filter; therefore a new Parti... 相似文献
17.
18.
传统Snake模型存在着对轮廓的初始化敏感,对高噪声图像易陷入局部极小值,以及对具有狭长深度凹陷区域的图像无法获得正确轮廓等问题.本文提出了一种基于边缘与区域信息的主动轮廓模型R-Snake(Region Snake).该模型通过文中设计的图像变换算子,并结合区域积分与曲线积分间转化的Green公式,导出了包含目标图像区域信息的区域力.然后由力平衡方程将该区域信息自然直接地引入到主动轮廓提取模型中,从而实现图像的轮廓提取.由于该模型同时利用了图像的区域信息和梯度信息来引导轮廓曲线的演化,使得本文方法不仅扩大了轮廓初始化的范围,降低了对图像噪声的敏感性,而且还增加了轮廓曲线收敛到真实边界的能力.实验结果表明,本文方法具有很强的适应性和鲁棒性,尤其是对高噪声图像和具有狭长深度凹陷的图像获得了优于传统Snake模型的结果. 相似文献
19.
This paper presents a method for segmentation and tracking of cardiac structures in ultrasound image sequences. The developed algorithm is based on the active contour framework. This approach requires initial placement of the contour close to the desired position in the image, usually an object outline. Best contour shape and position are then calculated, assuming that at this configuration a global energy function, associated with a contour, attains its minimum. Active contours can be used for tracking by selecting a solution from a previous frame as an initial position in a present frame. Such an approach, however, fails for large displacements of the object of interest. This paper presents a technique that incorporates the information on pixel velocities (optical flow) into the estimate of initial contour to enable tracking of fast-moving objects. The algorithm was tested on several ultrasound image sequences, each covering one complete cardiac cycle. The contour successfully tracked boundaries of mitral valve leaflets, aortic root and endocardial borders of the left ventricle. The algorithm-generated outlines were compared against manual tracings by expert physicians. The automated method resulted in contours that were within the boundaries of intraobserver variability 相似文献