A novel way of lossless compression of digital mammograms using grammar codes
Bibliographic record
Abstract
Breast cancer is the most common cancer among women in Canada. Despite slight declines in mortality rates over the past decade for women with breast cancer, one in nine Canadian women will develop breast cancer in her lifetime; one in 25 Canadian women will die from this disease. Digital mammograms (X-rays of the breast) may allow better cancer diagnosis and has the ability to be transmitted electronically around the world. The problem is mammograms are large size images and have less correlation details. Therefore, for a physician to diagnose diseases correctly even through the communication networks, gaining higher compression to save bandwidth without any data loss becomes a challenging issue. Among the traditional lossless compression algorithms such as Huffman, Lempel-Ziv and arithmetic, Lempel-Ziv and arithmetic source coding techniques have better performance than Huffman on digital mammograms. In order to achieve better compression ratios we investigate the newly developed grammar-based source code for medical image compression such as mammograms. In this grammar-based code, the original data (image) is first transformed into a context free grammar, from which the original data sequence can be fully reconstructed by performing parallel and recursive substitutions, and then using an arithmetic coding algorithm to compress the context free grammar or the corresponding sequence of parsed phrases. We tested the grammar-based coding technique on digital mammograms obtained from the Mammographic Image Analysis Society (MIAS). The result shows the newly developed grammar code performs better than the traditional lossless coding schemes. In general, the grammar-based lossless compression algorithm seems to be a promising technique for teleradiology applications.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".