| 基于两步几何主动轮廓的快速图像分割 |
| |
| 引用本文： | 肖昌炎,张素,陈亚珠.基于两步几何主动轮廓的快速图像分割[J].上海大学学报(英文版),2005,9(1):40-45. |
| |
| 作者姓名： | 肖昌炎 张素 陈亚珠 |
| |
| 作者单位： | BiomedicalInstrumentInstitute,ShanghaiJiaotongUniversity,Shanghai200030,P.R.China |
| |
| 摘 要： | A fast two-stage geometric active contour algorithm for image segmentation is developed. First, the Eikonal equation problem is quickly solved using an improved fast sweeping method, and a criterion of local minimum of area gradient (LMAG) is presented to extract the optimal arrival time. Then, the final time function is passed as an initial state to an area and length minimizing flow model, which adjusts the interface more accurately and prevents it from leaking. For object with complete and salient edge, using the first stage only is able to obtain an ideal result, and this results in a time complexity of O(M), where M is the number of points in each coordinate direction. Both stages are needed for convoluted shapes, but the computation cost can be drastically reduced. Efficiency of the algorithm is verified in segmentation experiments of real images with different feature.
|
| 关 键 词： | 图像处理 几何主动轮廓 图像分割 水平集方法 停止准则 |
| 收稿时间： | 15 September 2003 |
Fast image segmentation based on a two-stage geometrical active contour |
| |
| Xiao Chang-yan,Zhang Su,Chen Ya-zhu.Fast image segmentation based on a two-stage geometrical active contour[J].Journal of Shanghai University(English Edition),2005,9(1):40-45. |
| |
| Authors: | Xiao Chang-yan Zhang Su Chen Ya-zhu |
| |
| Institution: | Biomedical Instrument Institute, Shanghai Jiaotong University, Shanghai 200030, P. R. China |
| |
| Abstract: | A fast two-stage geometric active contour algorithm for image segmentation is developed. First, the Eikonal equation problem is quickly solved using an improved fast sweeping method, and a criterion of local minimum of area gradient (LMAG) is presented to extract the optimal arrival time. Then, the final time function is passed as an initial state to an area and length minimizing flow model, which adjusts the interface more accurately and prevents it from leaking. For object with complete and salient edge, using the first stage only is able to obtain an ideal result, and this results in a time complexity of O(M), where M is the number of points in each coordinate direction. Both stages are needed for convoluted shapes, but the computation cost can be drastically reduced. Efficiency of the algorithm is verified in segmentation experiments of real images with different feature. |
| |
| Keywords: | geometric active contours level set method image segmentation stopping criterion |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
