A Multichannel Edge-Weighted Centroidal Voronoi Tessellation algorithm for 3D super-alloy image segmentation

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2011, Pages 17-24

  Cao, Yu ^a   Ju, Lili ^b   Zou, Qin ^a,c   Qu, Chengzhang ^a,c   Wang, Song ^a  

^a The Department of Mechanical Engineering   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

^c WUHAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL GEOMETRY; EDGE DETECTION; STRUCTURE (COMPOSITION); SUPERALLOYS;

CENTROIDAL VORONOI TESSELLATION; COMPARISON METHODS; GRAIN SEGMENTATION; MECHANICAL AND PHYSICAL PROPERTIES; MULTICHANNEL IMAGES; MULTICHANNEL IMAGING; SEGMENTATION ALGORITHMS; SEGMENTATION PERFORMANCE;

IMAGE SEGMENTATION;

EID: 80052873178     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995590     Document Type: Conference Paper

References (28)

1. Y. Boykov and G. Funka-Lea. Graph cuts and efficient N-D image segmentation. IJCV, Vol. 70, pp. 109-131, 2006.
2. H. C. Chuang, L. M. Huffman, M. L. Comer, J. P. Simmons, and I. Pollak. An automated segmentation for nickel-based superalloy. In IEEE ICIP, pp. 2280-2283, 2008.
3. D. Comaniciu, P. Meer, and S. Member. Mean shift: A robust approach toward feature space analysis. IEEE PAMI, Vol. 24, pp. 603-619, 2002.
4. C. Couprie, L. Grady, L. Najman, and H. Talbot. Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest. ICCV, pp. 731-738, 2009.
5. J. Cousty, G. Bertrand, L. Najman and M. Couprie. Watershed cuts: thinnings, shortest-path forests and topological watersheds IEEE PAMI, Vol. 32, pp. 925-939, 2010.
6. K. M. David, D. E. Breen, L. Zhukov, and R. T. Whitakery. Level set segmentation from multiple non-uniform volume datasets. In IEEE Conf. Visualization, pp. 179-186, 2002.
7. Q. Du, V. Faber, and M. Gunzburger. Centroidal voronoi tessellations: applications and algorithms. SIAM Rev., Vol. 41, pp. 37-676, 1999.
8. Q. Du, M. Gunzburger, L. Ju, and X. Wang. Centroidal Voronoi tessellation algorithms for image compression, segmentation, and multichannel restoration. J. Mathematical Imaging and Vision, Vol. 24, pp. 102-119, 2006.
9. Q. Du, M. Gunzburger, and L. Ju. Advances in studies and applications of centroidal Voronoi tessellations. Numer. Math. Theo. Meth. Appl., Vol. 3, pp. 119-142, 2010.
10. P. Felzenszwalb and D. Huttenlocher. Efficient graph-based image segmentation. IJCV, Vol. 59, pp. 167-181, 2004.
11. L. Grady. Random walks for image segmentation. IEEE PA M I, Vol. 28, pp. 1768-1783, 2006.
12. J. A. Hartigan and M. A. Wong. A k-means clustering algorithm. J. the Royal Statistical Society. Series C, Vol. 28, pp. 100-108, 1979.
13. C. Li, C. Xu, C. Gui, and M. D. Fox. Level set evolution without re-initialization: A new variational formulation. In IEEE CVPR, pp. 430-436, 2005.
14. D. Magee, A. Bulpitt, and E. Berry. Level set methods for the 3d segmentation of ct images of abdominal aortic aneurysms. in Proc. Medical Image Understanding and Analysis, pp. 141-144, 2001.
15. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In IEEE ICCV, Vol. 2, pp. 416-423, 2001.
16. F. Meyer. Topographic distance and watershed lines. Signal Processing, Vol. 38, pp. 113-125, 1994.
17. R. Nock and F. Nielsen. Statistical region merging. IEEE PA M I, Vol. 26, pp. 1452-1458, 2004.
18. A. Okabe, B. Boots, K. Sugihara, and S. Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester, 2000.
19. M. J. Powell. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Computer Journal, Vol. 7, pp. 152-162, 1964.
20. R. C. Reed. The Superalloys Fundamentals and Applications. Cambridge Press, 2001.
21. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, Vol. 22, pp. 888-905, 1997.
22. D. N. Sparks. Euclidean cluster analysis. J. the Royal Statistical Society. Series C (Applied Statistics), Vol. 22, pp. 126-130, 1973.
23. H. Späth. Cluster Dissection and Analysis. Theory, FOR-TRAN Programs, Examples. Prentice Hall, Upper Saddle River, 1985.
24. G. F. Vander Voort, F. J. Warmuth, S. M. Purdy, and A. Szirmae. Metallography: Past, Present, and Future (75th Anniversary Volume). ASTM, 1993.
25. F. Vivodtzev, L. Linsen, G. P. Bonneau, B. Hamann, K. I. Joy, and B. A. Olshausen. Hierarchical isosurface segmentation based on discrete curvature. In Proc. Conf. Data Visualization, pp. 249-258, ACM Press, 2003.
26. J. Wang, L. Ju, and X. Wang. An edge-weighted centroidal voronoi tessellation model for image segmentation. In IEEE Trans. Image Processing, Vol. 18, pp. 1844-1858, 2009.
27. R. T. Whitaker. A level-set approach to 3d reconstruction from range data. IJCV, Vol. 29, pp. 203-231, 1998.
28. P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik. Contour Detection and Hierarchical Image Segmentation. IEEE PA M I, Vol. 33, pp. 898-916, 2011.