2015
DOI: 10.1364/oe.23.007366
|View full text |Cite
|
Sign up to set email alerts
|

Retina layer segmentation using kernel graph cuts and continuous max-flow

Abstract: Circular scan Spectral-Domain Optic Coherence Tomography imaging (SD-OCT) is one of the best tools for diagnosis of retinal diseases. This technique provides more comprehensive detail of the retinal morphology and layers around the optic disc nerve head (ONH). Since manual labelling of the retinal layers can be tedious and time consuming, accurate and robust automated segmentation methods are needed to provide the thickness evaluation of these layers in retinal disorder assessments such as glaucoma. The propos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(18 citation statements)
references
References 13 publications
0
18
0
Order By: Relevance
“…to apply constraints on the segmentation algorithms. These constraints can lead to segmentation errors when the algorithms are used on different image modalities (Kaba et al, 2015). Our segmentation method addresses these issues by using a prior knowledge including intensities variation of the tumour, which is manually selected by the user.…”
Section: Related Workmentioning
confidence: 99%
“…to apply constraints on the segmentation algorithms. These constraints can lead to segmentation errors when the algorithms are used on different image modalities (Kaba et al, 2015). Our segmentation method addresses these issues by using a prior knowledge including intensities variation of the tumour, which is manually selected by the user.…”
Section: Related Workmentioning
confidence: 99%
“…The major feature of this algorithm when applied to edge detection is that it can preserved the continuity of the boundary, which means that it is less affected by outliers. Also, compared to other graph-based edge detection methods [25], the DP algorithm is an efficient graph solving method that has a quadratic time complexity.…”
Section: Edge Detection Based On Dynamic Programmingmentioning
confidence: 99%
“…The first step of our algorithm, is based on an initial coarse segmentation with a conventional segmentation algorithm. We use GBS, which is a popular methodology for image segmentation in medical imaging [22][23][24], due to its uncomplicated implementation. The initial segmentation is used as an initialization for our second step, the matching layer attenuation coefficient segmentation (MLAS).…”
Section: Introductionmentioning
confidence: 99%