A robust convergence index filter for breast cancer cell segmentation
Bibliographic record
Abstract
COnvergence INdex (COIN) filter, a successful tool for cell localization, evaluates the degree of convergence of the gradient vectors within the neighborhood (region of support) toward a pixel of interest. All previous efforts were to increase the adaptability of the region of support to make the COIN filter robust and accurate. However, improving the quality of the image gradient map was ignored, which results in poor performance of the members of the COIN family in noisy settings. We propose a new Robust Convergence Index (RCI) filter that tailors the COIN filter in a noisy environment by (a) spreading the gradient vectors within non-homogeneous object regions by convolving an Aggregated Edge Probability Map (AEPM) with an edge preserving gradient vector kernel, and (b) increasing the convergence of the gradient vectors through the integration of the sine and cosine distribution as well as the magnitude of the gradient vectors. AEPM is computed through the consensus of the responses of a number of edge detectors over a wide range of scales, which lessens the effects of clutter by enforcing higher weights to the actual edges, and a non-parametric Kernel Density Estimation (KDE) is used to compute the edge probability map. Experimental results demonstrate that it obtains state-of-the-art performance.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.001 |
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".