Search

In this article, we propose a new U‐Net‐based approach for intraretinal cyst segmentation across different vendors that improve some of the challenges faced by previous deep‐based techniques. The proposed method has two main steps: (1) prior information embedding and input data adjustment, (2) the segmentation model. In the first step, we inject the information into the network in a way that overcomes some of the network limitations in receiving data and learning important contextual knowledge. And in the next step, we introduce a connection module between the encoder and decoder parts that transfers information more effectively from the encoder to the decoder. Two public datasets, namely, OPTIMA and KERMANY, are employed to evaluate the proposed method. The results show that the proposed method is an efficient vendor‐independent approach for the segmentation of intraretinal cystoid fluid with mean Dice values of 0.78 and 0.81 on the OPTIMA and KERMANY datasets, respectively. [ABSTRACT FROM AUTHOR]

Purpose: Intra‐retinal cyst (IRC) is a symptom of macular disorders that occurs due to retinal blood vessel damage and fluid leakage to the macula area. These abnormalities are efficiently visualized using optical coherence tomography (OCT) imaging. These patients need to be regularly monitored for the presence and changes of IRC regions. Thus, automatic segmentation of IRCs can be beneficial to investigate disease progression. Methods: In this study, automatic IRC segmentation is accomplished by building three different masks in three unsupervised segmentation levels of a hierarchical framework. In the first level, the ROI‐mask (R‐mask) is built, and the retina area is cropped based on this mask. In the second level, the prune‐mask (P‐mask) is built, and the searching space is significantly reduced toward the target objects using this mask; and finally in the third level, by applying the Markov random field (MRF) model and employing intensity and contextual information, the cyst mask (C‐mask) is extracted. Results: The proposed method is evaluated on three datasets including OPTIMA, UMN, and KERMANY datasets. The experimental results showed that the proposed method is effective with a mean dice coefficient rate of 0.74, 0.75 and 0.79 by the intersection of ground truths on the OPTIMA, UMN and KERMANY datasets, respectively. Conclusion: The proposed method outperforms the state‐of‐the‐art methods on the OPTIMA and UMN datasets while achieving comparable results to the most recently proposed method on the KERMANY dataset. [ABSTRACT FROM AUTHOR]