Background/Objectives: Accurate delineation of the optic disc and optic cup in retinal fundus photographs is a prerequisite for automated glaucoma screening. While encoder–decoder segmentation models have advanced considerably, the contribution of upstream preprocessing to segmentation accuracy, and the stability of that contribution across repeated training runs, remain insufficiently characterized. Methods: Five preprocessing pipelines, baseline, Contrast Limited Adaptive Histogram Equalization (CLAHE), Region of Interest (ROI) cropping, ROI+CLAHE, and CLAHE with heavy augmentation, were benchmarked under a fixed EfficientUNet++ model with an EfficientNet-B7 encoder on three publicly available fundus datasets (REFUGE, ORIGA, and Drishti-GS). Every configuration was retrained under three independent random seeds (42, 15, and 89) to assess run-to-run variability. Seed-level standard deviations accompany every reported mean and define the confidence limit on each ranking. Results: On REFUGE, CLAHE with augmentation (Config 5) achieved the strongest mean Dice (disc 0.9523±0.0017; cup 0.8348±0.0018). On ORIGA, all five configurations clustered within 0.0067 disc Dice; ROI+CLAHE (Config 4) was marginally ahead on disc (0.9681±0.0002) and augmentation led on the cup (0.8873±0.0024). On Drishti-GS, all five configurations converged successfully once optimizer and loss settings were corrected; the near-total failures seen in earlier single-run experiments reflected a configuration problem, not the small (81-image) training set. Conclusions: CLAHE applied to full-resolution images is the single most consistently beneficial preprocessing choice across all three datasets. ROI+CLAHE showed a small, initialization-stable advantage on ORIGA, but ROI crop centres were derived from ground-truth centroids, an oracle localization setting, and these results should not be interpreted as achievable by a fully automated pipeline. Data augmentation showed a consistent reduction in initialization sensitivity on small datasets and may be beneficial as a default strategy.
Abdullah Alajmi, Youssef Elnahal, Mohamed Othman et al.· Diagnostics· 0 citations
Semi-grant-free non-orthogonal multiple access (SGF-NOMA) schemes group one grant-based (GB) user with multiple grant-free (GF) users into one time/frequency resource block (RB) to enhance spectral efficiency. Due to the sporadic traffic of GF users and the stringent quality of service (QoS) requirement of the GB user, the access collision problem becomes severe in SGF-NOMA. To solve this problem, this paper firstly designs an RB-based power pool (PP), which directs GF users to adjust their transmit power without disrupting the ongoing transmission of the internal GB user. After that, this work proposes an efficient multi-agent deep reinforcement learning (MA-DRL) framework to jointly optimize the PP and access strategy for maximizing the network throughput. In particular, this work exploits the fast-response feature of the traditional competitive MA-DRL and the increased-performance feature of the traditional cooperative MA-DRL to redesign a mixed reward system, which contributes to a hybrid MA-DRL mode for enhancing the learning efficiency of agents, i.e., GF users. We investigate the performance of the proposed algorithm at the network level and the NOMA-cluster level. We show that the proposed hybrid MA-DRL at the cluster level converges faster to an optimal solution than that at the network level but at an extra cost of user clustering. The numerical results show that the proposed scheme increases the successful decoded users by 42.38% when compared to the traditional schemes without learning capability. The proposed hybrid MA-DRL mode performs better than the pure competitive and cooperative MA-DRL modes, especially under a heavy-load network. It is able to achieve a 69% success rate of access in a time-varying environment with high packet arrival rates.
M. Fayaz, Sohail Abbas, Abdullah Alajmi et al.· IEEE Transactions on Cogniti...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.