MétaCan
Menu
Back to cohort
Record W2084958771 · doi:10.1109/ccece.2014.6901002

Depth map compression based on platelet coding and quadratic curve fitting

2014· article· en· W2084958771 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsQuadtreeData compressionAlgorithmQuadratic functionCoding (social sciences)Curve fittingQuadratic equationComputer scienceLossless compressionCompression (physics)MathematicsCompression ratioArtificial intelligenceGeometry

Abstract

fetched live from OpenAlex

In this paper, we propose an efficient depth data compression scheme for depth images. Our proposed scheme is a platelet based coding method using quadtree decomposition, Lagrangian optimization function, and quadratic curve fitting algorithm. In this scheme, quadtree decomposition is used to divide a depth map into blocks with one or two homogeneous regions; Lagrangian optimization is employed to minimize the distortion as well as to keep relative high compression ratio within each sub-block; Four quadratic curve fitting models are designed for the objects' contours in order to keep the edges' position more precisely after compression. The experimental results show that our proposed method can achieve compression ratio comparable to the other known platelet based method. Besides, the objects' contours are kept better compared to the other method.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.958
Threshold uncertainty score0.441

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.021
GPT teacher head0.248
Teacher spread0.227 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it