Use of varying constraints in optimal 3-D graph search for segmentation of macular optical coherence tomography images

22Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An optimal 3-D graph search approach designed for simultaneous multiple surface detection is extended to allow for varying smoothness and surface interaction constraints instead of the traditionally used constant constraints. We apply the method to the intraretinal layer segmentation of 24 3-D optical coherence tomography (OCT) images, learning the constraints from examples in a leave-one-subject-out fashion. Introducing the varying constraints decreased the mean unsigned border positioning errors (mean error of 7.3 ±3.7 μm using varying constraints compared to 8.3 ± 4.9 μm using constant constraints and 8.2 ± 3.5 μm for the inter-observer variability). © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Haeker, M., Abràmoff, M. D., Wu, X., Kardon, R., & Sonka, M. (2007). Use of varying constraints in optimal 3-D graph search for segmentation of macular optical coherence tomography images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4791 LNCS, pp. 244–251). Springer Verlag. https://doi.org/10.1007/978-3-540-75757-3_30

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