LL-Sparse: Low-Latency 6-DoF Field of View Prediction
Bibliographic record
Abstract
Field of view (FoV) prediction is crucial for optimizing 6-DoF dynamic point cloud-based volumetric video (PCV) streaming. By accurately predicting which tiles fall within the viewer's region of interest, FoV prediction enables adaptive bitrate (ABR) algorithms to allocate higher bitrates to likely viewed tiles while assigning lower bitrates to less critical areas. This improves bandwidth efficiency and enhances the quality of experience (QoE) by aligning bitrate allocation with the viewer's focus. However, current 6-DoF salience-aware FoV prediction models face challenges related to high latency, computational costs, and a lack of complex datasets with detailed FoV traces, hindering the development of more effective real-time predictors. To address these challenges, we propose the LL-Sparse family, a suite of three solutions for direct tile salience score prediction: LL-Adapter, an extension of HMD-trajectory-based (HTB) models, such as GRUs, tailored for tile scoring; LL-PointNet, which integrates a GRU with PointNet to enhance salience-aware prediction; and LL-SparseConv, a scalable variant of LL-PointNet that employs sparse convolution in place of PointNet, serving as a proof of concept. These models strike a balance between practical performance and theoretical advancements in tile salience prediction. Furthermore, we introduce the MazeLab dataset, a novel, large-scale dynamic point cloud dataset that mimics real-world PCV scenarios to effectively benchmark FoV prediction models. Experimental results highlight the LL-Sparse family's exceptional scalability, reduced latency, and enhanced accuracy, establishing it as a promising solution for efficient real-time volumetric media 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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| 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.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".