Bayesian Segmentation of Atrium Wall Using Globally-Optimal Graph Cuts on 3D Meshes [chapter]

Gopalkrishna Veni, Zhisong Fu, Suyash P. Awate, Ross T. Whitaker
2013 Lecture Notes in Computer Science  
Efficient segmentation of the left atrium (LA) wall from delayed enhancement MRI is challenging due to inconsistent contrast, combined with noise, and high variation in atrial shape and size. We present a surface-detection method that is capable of extracting the atrial wall by computing an optimal a-posteriori estimate. This estimation is done on a set of nested meshes, constructed from an ensemble of segmented training images, and graph cuts on an associated multi-column, proper-ordered
more » ... The graph/mesh is a part of a template/model that has an associated set of learned intensity features. When this mesh is overlaid onto a test image, it produces a set of costs which lead to an optimal segmentation. The 3D mesh has an associated weighted, directed multi-column graph with edges that encode smoothness and inter-surface penalties. Unlike previous graph-cut methods that impose hard constraints on the surface properties, the proposed method follows from a Bayesian formulation resulting in soft penalties on spatial variation of the cuts through the mesh. The novelty of this method also lies in the construction of properordered graphs on complex shapes for choosing among distinct classes of base shapes for automatic LA segmentation. We evaluate the proposed segmentation framework on simulated and clinical cardiac MRI.
doi:10.1007/978-3-642-38868-2_55 pmid:24684007 pmcid:PMC4157062 fatcat:nzzvez5aijfgzbqwhf7fcizvmm