Shape priors for MAP segmentation of alloy micrographs using graph cuts

State-of-the-art alloy development processes utilize computerized materials simulations relying on segmentations of alloy micrographs which indicate the arrangement of material precipitates. Automated alloy segmentation algorithms must properly account for abundant prior information regarding the shape of the precipitates, as precipitate size and shape correlate to important materials properties. We propose a novel way of constructing and enforcing shape priors within a maximum a posteriori (MAP) segmentation framework. After computing a preliminary alloy segmentation using matching pursuits, our algorithm uses it to define a shape prior for a MAP segmentation found using a min-cut algorithm. This algorithm was found to significantly outperform both the MAP segmentation obtained without the shape prior, and the matching pursuit segmentations.

[1]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[3]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[4]  S. Mallat,et al.  Matching pursuit of images , 1994, Proceedings of IEEE-SP International Symposium on Time- Frequency and Time-Scale Analysis.

[5]  Landis M. Huffman Automated methods of visual interpretation: Articulated human tracking in video and segmentation of microscopy images , 2010 .

[6]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..