Optimal Net Surface Problems with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Interactive Organ Segmentation Using Graph Cuts
MICCAI '00 Proceedings of the Third International Conference on Medical Image Computing and Computer-Assisted Intervention
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
Hi-index | 0.00 |
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).