Advertisement

Grain Segmentation of 3D Superalloy Images Using Multichannel EWCVT under Human Annotation Constraints

  • Yu Cao
  • Lili Ju
  • Song Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7574)

Abstract

Grain segmentation on 3D superalloy images provides superalloy’s micro-structures, based on which many physical and mechanical properties can be evaluated. This is a challenging problem in senses of (1) the number of grains in a superalloy sample could be thousands or even more; (2) the intensity within a grain may not be homogeneous; and (3) superalloy images usually contains carbides and noises. Recently, the Multichannel Edge-Weighted Centroid Voronoi Tessellation (MCEWCVT) algorithm [1] was developed for grain segmentation and showed better performance than many widely used image segmentation algorithms. However, as a general-purpose clustering algorithm, MCEWCVT does not consider possible prior knowledge from material scientists in the process of grain segmentation. In this paper, we address this issue by defining an energy minimization problem which subject to certain constraints. Then we develop a Constrained Multichannel Edge-Weighted Centroid Voronoi Tessellation (CMEWCVT) algorithm to effectively solve this constrained minimization problem. In particular, manually annotated segmentation on a very small set of 2D slices are taken as constraints and incorporated into the whole clustering process. Experimental results demonstrate that the proposed CMEWCVT algorithm significantly improve the previous grain-segmentation performance.

Keywords

Image Segmentation Image Slice Voronoi Tessellation Segmentation Accuracy Constrain Minimization Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Cao, Y., Ju, L., Zou, Q., Qu, C., Wang, S.: A multichannel edge-weighted centroid Voronoi tessellation algorithm for 3D superalloy image segmentation. In: CVPR, pp. 17–24 (2011)Google Scholar
  2. 2.
    Reed, R.C.: The Superalloys Fundamentals and Applications. Cambridge Press (2001)Google Scholar
  3. 3.
    Voort, G.F.V., Warmuth, F.J., Purdy, S.M.: Metallography: Past, Present, and Future (75th Anniversary Vol.). Astm Special Technical Publication (1993)Google Scholar
  4. 4.
    Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. TPAMI 24, 603–619 (2002)CrossRefGoogle Scholar
  5. 5.
    Meyer, F.: Topographic distance and watershed lines. Signal Processing 38, 113–125 (1994)zbMATHCrossRefGoogle Scholar
  6. 6.
    Nock, R., Nielsen, F.: Statistical region merging. TPAMI 26, 1425–1458 (2004)CrossRefGoogle Scholar
  7. 7.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22, 888–905 (1997)Google Scholar
  8. 8.
    Felzenszwalb, P.F.: Efficient graph-based image segmentation. IJCV 59, 167–181 (2004)CrossRefGoogle Scholar
  9. 9.
    Li, C., Xu, C., Gui, C., Fox, M.D.: Level set evolution without re-initialization: A new variational formulation. In: CVPR, pp. 430–436 (2005)Google Scholar
  10. 10.
    Couprie, C., Najman, L., Grady, L., Talbot, H.: Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest. In: ICCV, pp. 731–738 (2009)Google Scholar
  11. 11.
    Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: thinnings, shortest-path forests and topological watersheds. TPAMI 32, 925–939 (2010)CrossRefGoogle Scholar
  12. 12.
    Chuang, H.-C., Huffman, L.M., Comer, M.L., Simmons, J.P., Pollak, I.: An automated segmentation for Nickel-based superalloy. In: ICPR, pp. 2280–2283 (2008)Google Scholar
  13. 13.
    Boykov, Y., Funka-Lea, G.: Graph cuts and efficient N-D image segmentation. IJCV 70, 109–131 (2006)CrossRefGoogle Scholar
  14. 14.
    Grady, L.: Random walks for image segmentation. TPAMI 28, 1768–1783 (2006)CrossRefGoogle Scholar
  15. 15.
    Whitaker, R.T.: A level-set approach to 3D reconstruction from range data. IJCV 29, 203–231 (1998)CrossRefGoogle Scholar
  16. 16.
    Magee, D., Bulpitt, A., Berry, E.: Level set methods for the 3D segmentation of CT images of abdominal aortic aneurysms. In: Medical Image Understanding and Analysis, pp. 141–144 (2001)Google Scholar
  17. 17.
    Wang, J., Ju, L., Wang, X.: An edge-weighted centroidal Voronoi tessellation model for image segmentation. IEEE TIP 18, 1844–1858 (2009)MathSciNetGoogle Scholar
  18. 18.
    Powell, M.J.D.: An efficient method for finding the minimum of a function of several variables without calculating derivatives. Computer Journal 7, 152–162 (1964)CrossRefGoogle Scholar
  19. 19.
    Du, Q., Faber, V., Gunzburger, M.: Centroidal Voronoi tessellations: applications and algorithms. SIAM Review 41, 637–676 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Martin, D.R., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: ICCV, pp. 416–423 (2001)Google Scholar
  21. 21.
    Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. TPAMI 33, 898–916 (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yu Cao
    • 1
  • Lili Ju
    • 2
  • Song Wang
    • 1
  1. 1.Department of Computer Science & EngineeringUniversity of South CarolinaColumbiaUSA
  2. 2.Department of MathematicsUniversity of South CarolinaColumbiaUSA

Personalised recommendations