Multiple Surface Segmentation Using Truncated Convex Priors

Multiple surface segmentation with mutual interaction between surface pairs is a challenging task in medical image analysis. In this paper we report a fast multiple surface segmentation approach with truncated convex priors for a segmentation problem, in which there exist abrupt surface distance changes between mutually interacting surface pairs. A 3-D graph theoretic framework based on

local range search

is employed. The use of truncated convex priors enables to capture the surface discontinuity and rapid changes of surface distances. The method is also capable to enforce a minimum distance between a surface pair. The solution for multiple surfaces is obtained by iteratively computing a maximum flow for a subset of the voxel domain at each iteration. The proposed method was evaluated on simultaneous intraretinal layer segmentation of optical coherence tomography images of normal eye and eyes affected by severe drusen due to age related macular degeneration. Our experiments demonstrated statistically significant improvement of segmentation accuracy by using our method compared to the optimal surface detection method using convex priors without truncation (OSDC). The mean unsigned surface positioning errors obtained by OSDC for normal eyes (4.47 ±1.10)

μ

m was improved to (4.29 ±1.02)

μ

m, and for eyes with drusen was improved from (7.98 ±4.02)

μ

m to (5.12 ±1.39)

μ

m using our method. The proposed approach with average computation time of 539 sec is much faster than 10014 sec taken by OSDC.