
2
(a) iAMD (b) nAMD (c) GA
Fig. 1: The three stages of AMD, where the Bruch’s Membrane
is marked with a green line. As a reference, retina from the
Internal Limiting Membrane to the outer boundary of the RPE
is denoted with cyan lines.
annotated training data that is often difficult and expensive
to obtain. In addition, these models, when based only on
textural features of the OCT images, may fail where the
images contain artifacts due to the limitations in the scanning
process, e.g., shadowing, eye-movement or low-resolution
acquisition [15]. The introduction of prior knowledge about
the target domain imposes constraints on the possible solutions,
thus reducing the search space [16]. Such knowledge can
take several forms, including topology specification, distances
between regions [17], or shape models [16]. Utilizing prior
anatomical information for medical image segmentation has
already been proven useful in order to obtain more accurate
and plausible results, and with smaller training sets. They have
been successfully applied among others to improve cardiac
image segmentations [15], liver segmentation [18] and retinal
layer segmentation [17], [19], [20].
Quantifying uncertainty of DL models is crucial for clinical
applications in order to build trust in systems’ prediction
and at the same time for reducing the associated risks of
downstream tasks relying on uncertain or incorrect results. This
is particularly pertinent for image segmentation, where there is
an inherent ambiguity in the reference, due to the limitations
in the image acquisition processes and the subjectivity and
complexity of the annotation task, resulting in variations
between the manual annotations. However, DL segmentation
methods tend to provide unrealistic overconfident predictions
on these complex tasks, especially when they are applied on a
different patient cohort or pathologies not observed during the
training.
Having the above considerations in mind, in this paper,
we propose a new deep learning method for automated
segmentation of the BM. By using a probability distribution
function to infer its spatial coordinates, together with a loss
term incorporating anatomical priors which promotes smooth
predictions, the method accounts for local morphological
changes resulting from pathologies or acquisition artifacts,
and is capable of identifying regions of potential segmentation
failure. The acquired local uncertainty information is utilized
in a post-processing step to further improve the segmentation
in the areas of potentially erroneous segmentations. Large-
scale multi-dataset experiments show the robustness of the
developed model, which furthermore achieves the state-of-the-
art performance on an external public dataset.
A. Related works
The goal of layer segmentation is to obtain anatomically
coherent, smooth, and continuous retinal layer boundary
surfaces. The first widely-used approach was to extract image
features from the B-scans, which are then used by graph-based
methods to estimate the surface positions. For instance, the
IOWA Reference Algorithms [19], [21] represented the OCT
as a graph and the surface positioning was solved with dynamic
programming algorithms, while guaranteeing the correct topo-
logical ordering, satisfying prior layer thickness constraints,
and smoothing the results. The graph-based methods were later
further improved in several works [22]--[24]. Rathke et al. [25]
proposed a method using a probabilistic graphical model, which
incorporated anatomical shape priors for OCT segmentation,
including a post-processing fix for the BM. A drawback of
these methods is that they rely on hand-crafted image features
as the backbone for the graph construction and may perform
poor in the presence of noise or other imaging artifacts, as well
as severe pathologies. Several approaches attempted to improve
on this by incorporating machine learning-based methods to
estimate the cost function for the nodes of the graph [9], [26]-
-[28]. For these types of approaches, the performance of the
graph-search method is still tied to the quality of the initial
probability map, and subject to predefined hard morphological
constraints on layer thickness and smoothness variability.
With the advent of deep learning, U-Net [29] and its variants
became a dominant approach for medical image segmentation,
including retinal layer segmentation. In particular, ReLayNet
proposed in Roy et al. [11] presented a network architecture
similar to U-Net, which represented nine retinal layers and
possible fluid-filled pockets as distinct classes and predicted
their pixel-wise locations. A deficiency of this algorithm is
that it is not guaranteed to predict a single unique BM position
in an A-scan. Sousa et al. [13] uses a U-Net to create an initial
segmentation followed by a CNN based edge detection network
to further refine the results, while predicting one single location
per A-scan.
A major weakness of these two deep learning methods is that
they do not account for the natural ordering of the layers, and
consequently do not guarantee anatomically plausible results.
The framework presented by He et al. [10] improves on this by
predicting the surface positions using column-wise soft-argmax,
thus ensuring that only one position is inferred per A-scan. Also,
proper layer ordering is guaranteed with a topological module.
They further improved their method in [20] by removing the
fully-connected layers and hence requiring fewer parameters
than in their previous work, while also evaluating the model
performance on a BM segmentation task. Besides showing
improvement against the state of the art they also showed that
the surface connectivity is well constrained. However, they
did not include uncertainty estimation in their work and the
method was not validated on AMD patients.
An alternative, not machine learning based approach was
presented in Lou et al. [30], which uses a mathematical model
of the potential fluid energy in fluid mechanics. This method
inherently guarantees the correct topological ordering and the
smoothness of the predicted layers, however its performance