Bidimensional Increment Entropy for Texture Analysis: Theoretical Validation and Application to Colon Cancer Images
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Entropy algorithms are widely applied in signal analysis to quantify the irregularity of data. In the realm of two-dimensional data, their two-dimensional forms play a crucial role in analyzing images. Previous works have demonstrated the effectiveness of one-dimensional increment entropy in detecting abrupt changes in signals. Leveraging these advantages, we introduce a novel concept, two-dimensional increment entropy (IncrEn2D), tailored for analyzing image textures. In our proposed method, increments are translated into two-letter words, encoding both the size (magnitude) and direction (sign) of the increments calculated from an image. We validate the effectiveness of this new entropy measure by applying it to MIX2D(p) processes and synthetic textures. Experimental validation spans diverse datasets, including the Kylberg dataset for real textures and medical images featuring colon cancer characteristics. To further validate our results, we employ a support vector machine model, utilizing multiscale entropy values as feature inputs. A comparative analysis with well-known bidimensional sample entropy (SampEn2D) and bidimensional dispersion entropy (DispEn2D) reveals that IncrEn2D achieves an average classification accuracy surpassing that of other methods. In summary, IncrEn2D emerges as an innovative and potent tool for image analysis and texture characterization, offering superior performance compared to existing bidimensional entropy measures.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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 it