Tree-metrics graph cuts for brain MRI segmentation with tree cutting

Abstract

We tackle the problem of brain MRI image segmentation using the tree-metric graph cuts (TM) algorithm, a novel image segmentation algorithm, and introduce a “tree-cutting” method to interpret the labeling returned by the TM algorithm as tissue classification for the input brain MRI image. The approach has three steps: 1) pre-processing, which generates a tree of labels as input to the TM algorithm; 2) a sweep of the TM algorithm, which returns a globally optimal labeling with respect to the tree of labels; 3) post-processing, which involves running the “tree-cutting” method to generate a mapping from labels to tissue classes (GM, WM, CSF), producing a meaningful brain MRI segmentation. The TM algorithm produces a globally optimal labeling on tree metrics in one sweep, unlike conventional methods such as EMS and EM-style geo-cuts, which iterate the expectation maximization algorithm to find hidden patterns and produce only locally optimal labelings. When used with the “tree-cutting” method, the TM algorithm produces brain MRI segmentations that are as good as the Unified Segmentation algorithm used by SPM8, using a much weaker prior. Comparison with the current approaches shows that our method is faster and that our overall segmentation accuracy is better.