z-logo
open-access-imgOpen Access
Automatic choroid layer segmentation using normalized graph cut
Author(s) -
Masood Saleha,
Sheng Bin,
Li Ping,
Shen Ruimin,
Fang Ruogu,
Wu Qiang
Publication year - 2018
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2017.0273
Subject(s) - segmentation , computer science , artificial intelligence , choroid , optical coherence tomography , cut , image segmentation , computer vision , image processing , pattern recognition (psychology) , image (mathematics) , retina , ophthalmology , optics , medicine , physics
Optical coherence tomography is an immersive technique for depth analysis of retinal layers. Automatic choroid layer segmentation is a challenging task because of the low contrast inputs. Existing methodologies carried choroid layer segmentation manually or semi‐automatically. The authors proposed automated choroid layer segmentation based on normalised cut algorithm, which aims at extracting the global impression of images and treats the segmentation as a graph partitioning problem. Due to the structure complexity of retinal and choroid layers, the authors employed a series of pre‐processing to make the cut more deterministic and accurate. The proposed method divided the image into several patches and ran the normalised cut algorithm on every patch separately. The aim was to avoid insignificant vertical cuts and focus on horizontal cutting. After processing every patch, the authors acquired a global cut on the original image by combining all the patches. Later the authors measured the choroidal thickness which is highly helpful in the diagnosis of several retinal diseases. The results were computed on a total of 525 images of 21 real patients. Experimental results showed that the mean relative error rate of the proposed method was around 0.4 when compared with the manual segmentation performed by the experts.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here