Optimal multiple surface segmentation with shape and context priors

93Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Segmentation of multiple surfaces in medical images is a challenging problem, further complicated by the frequent presence of weak boundary evidence, large object deformations, and mutual influence between adjacent objects. This paper reports a novel approach to multi-object segmentation that incorporates both shape and context prior knowledge in a 3-D graph-theoretic framework to help overcome the stated challenges. We employ an arc-based graph representation to incorporate a wide spectrum of prior information through pair-wise energy terms. In particular, a shape-prior term is used to penalize local shape changes and a context-prior term is used to penalize local surface-distance changes from a model of the expected shape and surface distances, respectively. The globally optimal solution for multiple surfaces is obtained by computing a maximum flow in a low-order polynomial time. The proposed method was validated on intraretinal layer segmentation of optical coherence tomography images and demonstrated statistically significant improvement of segmentation accuracy compared to our earlier graph-search method that was not utilizing shape and context priors. The mean unsigned surface positioning errors obtained by the conventional graph-search approach 6.30 ± 1.58 μm) was improved to 5.14±0.99 μ m when employing our new method with shape and context priors. © 2012 IEEE.

Cite

CITATION STYLE

APA

Song, Q., Bai, J., Garvin, M. K., Sonka, M., Buatti, J. M., & Wu, X. (2013). Optimal multiple surface segmentation with shape and context priors. IEEE Transactions on Medical Imaging, 32(2), 376–386. https://doi.org/10.1109/TMI.2012.2227120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free