Application of the Maximum Flow–Minimum Cut Algorithm to Segmentation and Clustering of Materials Datasets

Abstract

AbstractProblems involving image segmentation, atomic cluster identification, segmentation of microstructure constituents in images and austenite reconstruction have seen various approaches attempt to solve them with mixed results. No single computational technique has been able to effectively tackle these problems due to the vast differences between them. We propose the application of graph cutting as a versatile technique that can provide solutions to numerous materials data analysis problems. This can be attributed to its configuration flexibility coupled with the ability to handle noisy experimental data. Implementation of a Bayesian statistical approach allows for the prior information, based on experimental results and already ingrained within nodes, to drive the expected solutions. This way, nodes within the graph can be grouped together with similar, neighboring nodes that are then assigned to a specific system with respect to calculated likelihoods. Associating probabilities with potential solutions and states of the system allows for quantitative, stochastic analysis. The promising, robust results for each problem indicate the potential usefulness of the technique so long as a network of nodes can be effectively established within the model system.