Metraipolis › archive › dc_c642a4ada206

CurveCodec 2: Skeleton-agnostic animation compression with a learned entropy model — arXiv:2610.04211

Source
arXiv
Original
https://arxiv.org/abs/2610.04211
License (as archived)
CC0-1.0
Archived
2026-10-06T05:26:03.574Z
SHA-256 of the archived text
c8a864a4e727e62acde7b512aac97c1385f5182cdb81c7a32a8a43defdd52465
Stable URL of this page
https://metraipolis.com/documento/dc_c642a4ada206

How to cite

CurveCodec 2: Skeleton-agnostic animation compression with a learned entropy model — arXiv:2610.04211 — arXiv, https://arxiv.org/abs/2610.04211 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c642a4ada206 (Metraipolis archive dc_c642a4ada206, sha256 c8a864a4e727e62acde7b512aac97c1385f5182cdb81c7a32a8a43defdd52465)
BibTeX
@misc{dcc642a4ada206,
  title = {CurveCodec 2: Skeleton-agnostic animation compression with a learned entropy model — arXiv:2610.04211},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.04211},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c642a4ada206; sha256 c8a864a4e727e62acde7b512aac97c1385f5182cdb81c7a32a8a43defdd52465},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04211. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Skeletal motion is stored as every joint's transform at every frame, yet most of it is implied by the body rather than by what the motion is about. Compression is one way to ask what a motion must still say once the body is known, and a production codec must answer it for any skeleton with a stated error bound. Our earlier codec, CurveCodec, matched the mean error of ACL, the production library of modern game engines, with a learned prior over sparse anchors, but not ACL's worst case, and it counted its payload as floats rather than bits. Here we ask where the redundancy of skeletal motion lies and which part of a codec a learned model should take over. Measurements give three answers. At production precision the largest saving comes from predicting each quantized curve from its own past, the second from choosing per joint, in closed loop through the hierarchy, which samples not to code. On the gaps such an encoder leaves, a nearest-neighbour oracle over millions of training samples is no better than linear interpolation, and no learned in-betweener we tried paid for itself. What a network does learn is the distribution of the residuals the codec must send. CurveCodec 2 codes every sub-track as a curve in the log map, quantized in closed loop and thinned to rate-distortion-selected keys, with residuals entropy-coded under a small learned model whose integer inference is bit-exact across platforms. Two contracts are verified on every decoded clip: ACL's own worst case per joint within a stated tolerance, or ACL's mean error per clip. On a held-out test side of 4,472 clips from 33 datasets, CurveCodec 2 needs 0.37x ACL's bytes at ACL's default precision of 0.01 cm under the worst-case contract and 0.22x at 0.1 cm under the mean contract, decodes on one CPU core, and transfers without retraining to a species absent from training. Project page: this https URL

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Graphics (cs.GR) ; Artificial Intelligence (cs.AI); Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2610.04211 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:24:05.812Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).