z-logo
open-access-imgOpen Access
Lightweight cascade framework for optic disc segmentation
Author(s) -
Zhang Xu,
Liu Jie,
Wang Shuyan,
Chen Zhewei,
Huang Bin,
Ye Jilun
Publication year - 2019
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.2019.0244
Subject(s) - cascade , segmentation , computer science , optic disc , artificial intelligence , computer vision , image segmentation , ophthalmology , medicine , engineering , chemical engineering , glaucoma
The accurate segmentation of the optic disc (OD) is important in diagnosing and evaluating many retinal diseases. However, the OD boundary is unclear, making the task of automatic OD segmentation very challenging. Recently,many researchers have applied convolutional neural network (CNN) technology to the automatic segmentation of OD, and the network has been widened and deepened. It can effectively improves the accuracy of segmentation but also requires high computational complexity and large memory consumption. To overcome the above defects, we propose a segmentation framework of a lightweight cascade CNN. It consists of a designed‐to‐be‐lightweight segmentation network and a shape‐refinement network cascade, cascading a shape‐refined network behind a segmentation network to compensate for the degraded performance of the segmentation network after lightweight design. We tested our framework on three databases, DRIVE, DIARETDB1, and DRIONS‐DB, and found that its segmentation performance is slightly better than that of u‐net, and the trainable parameters are approximately 1/35 that of u‐net. After verified by the DRIVE dataset, the memory used for training and testing is only about 1/3 of u‐net. The method proposed in this paper can greatly reduce trainable parameters and computational resource consumption while guaranteeing satisfactory segmentation performance of the model.

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