Efficient Multi-Organ Multi-Center Cell Nuclei Segmentation Method Based on Deep Learnable Aggregation Network
Bibliographic record
Abstract
Automated cell nuclei delineation in whole-slide imaging (WSI) is a fundamental step for many tasks like cancer cell recognition, cancer grading, and cancer subtype classification. Although numerous computational methods have been proposed for segmenting nuclei in WSI images based on image processing and deep learning, existing approaches face major challenges such as color variation due to the use of different stains, the various structures of cell nuclei, and the overlapping and clumped cell nuclei. To circumvent these challenges in this article, we propose an efficient and accurate cell nuclei segmentation method based on deep learning, in which a set of accurate individual cell nuclei segmentation models are developed to predict rough segmentation masks, and then a learnable aggregation network (LANet) is used to predict the final nuclei masks. Besides, we develop cell nuclei segmentation software (with a graphical user interface—GUI) that includes the proposed method and other deep-learning-based cell nuclei segmentation methods. A challenging WSI dataset collected from different centers and organs is used to demonstrate the efficiency of our method. The experimental results reveal that our method obtains a competitive performance compared to the existing approaches in terms of the aggregated Jaccard index (AJI=89.25%) and F1-score (F1=73.02%). The developed nuclei segmentation software can be downloaded from https://github.com/loaysh2010/Cell-Nuclei-Segmentation-GUI-Application.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".