Feature extraction on 3-D TexMesh using scale-space analysis and perceptual evaluation
Bibliographic record
Abstract
Efficient online visualization of three-dimensional (3-D) textured models is essential for a variety of applications including not only games and e-commerce, but also heritage and medicine. To visualize 3-D objects online, it is necessary to quickly adapt both mesh and texture to the available computational or network resources. Earlier research showed that after reaching a minimum required mesh density, high-resolution texture has more impact on human perception than a denser mesh. Given limited bandwidth, an important issue is how to extract features that best represent the original object, and how to allocate resources between mesh and texture data to achieve optimal perceptual quality. In this paper, we propose a textured mesh (TexMesh) model, which applies scale-space analysis and perceptual evaluation to extract 3-D features for textured mesh simplification and transmission. Texture data is divided into fragments to facilitate quality and bandwidth adaptation. Texture quality assignment is based on feature point distribution. Online transmission is based on statistics gathered during preprocessing, which are stored in a priority queue and lookup tables. Quality of service requested by a client site can be met by applying an efficient adaptive algorithm to ensure optimal use of the specified time and available bandwidth, and at the same time preserving satisfactory quality. Our TexMesh framework integrates feature extraction, mesh simplification, texture reduction, bandwidth adaptation, and perceptual evaluation into a multiscale visualization framework.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".