Choroid Segmentation of Retinal OCT Images Based on CNN Classifier and l 2 - l q Fitter.
Autor: | He F; Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong., Chun RKM; Laboratory of Experimental Optometry, Centre for Myopia Research, School of Optometry, The Hong Kong Polytechnic University, Hong Kong., Qiu Z; Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong., Yu S; Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong., Shi Y; Blue Balloon Innovative Limited, Hong Kong., To CH; Laboratory of Experimental Optometry, Centre for Myopia Research, School of Optometry, The Hong Kong Polytechnic University, Hong Kong.; Centre for Eye and Vision Research, Hong Kong., Chen X; Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong. |
---|---|
Jazyk: | angličtina |
Zdroj: | Computational and mathematical methods in medicine [Comput Math Methods Med] 2021 Jan 15; Vol. 2021, pp. 8882801. Date of Electronic Publication: 2021 Jan 15 (Print Publication: 2021). |
DOI: | 10.1155/2021/8882801 |
Abstrakt: | Optical coherence tomography (OCT) is a noninvasive cross-sectional imaging technology used to examine the retinal structure and pathology of the eye. Evaluating the thickness of the choroid using OCT images is of great interests for clinicians and researchers to monitor the choroidal thickness in many ocular diseases for diagnosis and management. However, manual segmentation and thickness profiling of choroid are time-consuming which lead to low efficiency in analyzing a large quantity of OCT images for swift treatment of patients. In this paper, an automatic segmentation approach based on convolutional neural network (CNN) classifier and l Competing Interests: The authors declare that there are no conflicts of interest regarding the publication of this paper. (Copyright © 2021 Fang He et al.) |
Databáze: | MEDLINE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |