A deep data‐driven approach for enhanced segmentation of blood vessel for diabetic retinopathy
Bibliographic record
Abstract
Abstract The segmentation step of retinal blood vessel helps to diagnosis the diseases including diabetic retinopathy, glaucoma, etc. The automatic image segmentation process helps experts to speed up the diagnosis of DR, since analytic methods are time consuming and error prone. The neural network (NN) based methods like U‐Net uses leap bonding that extract fine information from the training dataset. However automatic segmentation of image using neural network is a challenging process because of uneven and irregular geometry of organ. In this article, we proposed a U‐Net based approach for segmentation of retinal vessels. Before applying segmentation step, the affected area of image is enhanced with some preprocessing techniques. Then a dual tree discrete Ridgelet transform (DT‐DRT) is apply on the dataset to extract the features from the region of interest. The features accumulation with DT‐DRT ensures better feature representation of vessel for segmentation task. The proposed segmentation is implemented on different publicly available dataset and achieve accuracy of 96.01% in CHASE DB1, 97.65% in DRIVE and 98.61% in STARE dataset. The performance of this algorithm is also compared with some other deep learning models, and results demonstrate that this proposed algorithm performed better than them.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".