Abstract

The study introduces image segmentation and denoising method which is based on geodesic framework and k means algorithm. Our method combines geodesic with k means algorithm. What’s more, a denoising method is applied to denoise. We optimize the distance function of k means algorithm to achieve our goals. This method can segment and denoise image which contains a lot of noise effectually.

Keywords:

Geodesic distance, image denoising, image segmentation, k means algorithm,

References

1. Bai, X. and G. Sapiro, 2007. A geodesic framework for fast interactive image and video segmentation and matting. Proceedings of the 11th IEEE International Conference on Computer Vision. Rio de Janeiro, Brazil, Oct. 14-21, pp: 1-8.
   CrossRef    
2. Dinh, H.T., M. Luong, J.M. Rocchisani, C.D. Pham, H.D. Pham and F. Dibos, 2012. An optimal weight method for CT image denoising. J. Electr. Sci. Technol., 10(2): 124-128.
   
3. Hao, P., 2010. A connected area weighted centroidal voronoi tessellation model for image segmentation. M.A. Thesis.
   Direct Link
4. He, R., W. Yang and M. Li, 2013. An improved image denoising algorithm based on structural similarity and curvelet. Sci. Technol. Inform., No. 1.
   
5. Li, K., 2011. The research on image denoising: The application research of image denoising based on median filter and wavelet transform. M.A. Thesis.
   
6. Li, Z., B. Luo, S. Zhai and Z. Tu, 2012. An algorithm based on the partition of correlational graph. Computer Engineering and Applications.
   
7. Russell, B., A. Toralba and M. Label, 2008. A database and web-based tool for image annotation. Int. J. Comput. Vision, 77: 157-173.
   CrossRef    
8. Wang, J., L. Ju and X. Wang, 2009. An edge-weighted centroidal voronoi tessellation model for image segmentation. Image Process., 18(8): 1844-1858.
   CrossRef    PMid:19556200    
9. Xing, L., Q. Chang and T. Qiao, 2012. The algorithms about fast non-local means based image denoising. Acta Math. Appl. Sin-E., 28(2): 247-254.
   

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.