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 o...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.展开更多
Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the sup...Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the support vector machine（SVM）models. First, the images are segmented by using SVM and textural statistics. A likelihood measurement for every pixel is derived by using the initial segmentation. The Chan-Vese model then is modified by adding two items： the likelihood and the distance between the initial segmentation and the evolving contour. Experimental results using real SAR images demonstrate the good performance of the proposed method compared to several classic GAC models.展开更多
文摘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.
基金supported by the National Natural Science Foundation of China(4117132741301361)+2 种基金the National Key Basic Research Program of China(973 Program)(2012CB719903)the Science and Technology Project of Ministry of Transport of People’s Republic of China(2012-364-X11-803)the Shanghai Municipal Natural Science Foundation(12ZR1433200)
文摘Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the support vector machine（SVM）models. First, the images are segmented by using SVM and textural statistics. A likelihood measurement for every pixel is derived by using the initial segmentation. The Chan-Vese model then is modified by adding two items： the likelihood and the distance between the initial segmentation and the evolving contour. Experimental results using real SAR images demonstrate the good performance of the proposed method compared to several classic GAC models.
