Bidimensional ensemble entropy: Concepts and application to emphysema lung computerized tomography scans
Bibliographic record
Abstract
BACKGROUND AND OBJECTIVE: Bidimensional entropy algorithms provide meaningful quantitative information on image textures. These algorithms have the advantage of relying on well-known one-dimensional entropy measures dedicated to the analysis of time series. However, uni- and bidimensional algorithms require the adjustment of some parameters that influence the obtained results or even findings. To address this, ensemble entropy techniques have recently emerged as a solution for signal analysis, offering greater stability and reduced bias in data patterns during entropy estimation. However, such algorithms have not yet been extended to their two-dimensional forms. METHODS: We therefore propose six bidimensional algorithms, namely ensemble sample entropy, ensemble permutation entropy, ensemble dispersion entropy, ensemble distribution entropy, and two versions of ensemble fuzzy entropy based on different models or parameters initialization of an entropy algorithm. These new measures are first tested on synthetic images and further applied to a biomedical dataset. RESULTS: The results suggest that ensemble techniques are able to detect different levels of image dynamics and their degrees of randomness. These methods lead to more stable entropy values (lower coefficients of variations) for the synthetic data. The results also show that these new measures can obtain up to 92.7% accuracy and 88.4% sensitivity when classifying patients with pulmonary emphysema through a k-nearest neighbors algorithm. CONCLUSIONS: This is a further step towards the potential clinical deployment of bidimensional ensemble approaches to detect different levels of image dynamics and their successful performance on emphysema lung computerized tomography scans. These bidimensional ensemble entropy algorithms have potential to be used in various imaging applications thanks to their ability to distinguish more stable and less biased image patterns compared to their original counterparts.
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.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 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".