Fast maximum intensity projection with 3D nonlinear wavelets
Bibliographic record
Abstract
Despite the increasing interest in three-dimensional (3D) visualization, rendering algorithms still suffer from high numerical complexity and large memory requirements. With the continuously increasing volume of medial imaging data, fast visualization algorithms become crucial. Powerful mathematical techniques based on the wavelet transform promise to provide efficient multi-resolution visualization algorithms, optimizing hence 3D rendering. Maximum Intensity Projection (MIP) is a 3D rendering algorithm that is used to visualize high-intensity structures within volumetric data. At each pixel the highest data value, which is encountered along a corresponding viewing ray, is depicted. In this paper, we propose a fast MIP 3D rendering that is based on a new hierarchical data representation. The proposed approach uses on a new morphological wavelet decomposition that allows for fast initial rendering and progressive subsequent refinements. Our method includes a pre-processing step that is based on a non-linear wavelet representation in order to achieve efficient data compression and storage. It results in a very fast visualization algorithm. The rendering speed-up results from removing cells that do not contribute to any MIP projection and from an innovative storage scheme of the volume cells. The proposed algorithm gives very promising results. Very good MIP projections can be obtained with less than 20% of the volumetric data. This makes our algorithm very competitive with the best MIP methods proposed so far in the literature.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".