Metraipolis › archive › dc_5683dfaf6a02

CaliSplat: Sparse Gaussian Fitting and Calibrated Rate Allocation for Image Compression — arXiv:2611.04413

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04413
License (as archived)
CC0-1.0
Archived
2026-11-04T18:34:37.263Z
SHA-256 of the archived text
3c721d23e3200a3a263220deceb223a05cf2636e9a2d9edd85a82bc211ba3ea8
Stable URL of this page
https://metraipolis.com/documento/dc_5683dfaf6a02

How to cite

CaliSplat: Sparse Gaussian Fitting and Calibrated Rate Allocation for Image Compression — arXiv:2611.04413 — arXiv (en), https://arxiv.org/abs/2611.04413 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5683dfaf6a02 (Metraipolis archive dc_5683dfaf6a02, sha256 3c721d23e3200a3a263220deceb223a05cf2636e9a2d9edd85a82bc211ba3ea8)
BibTeX
@misc{dc5683dfaf6a02,
  title = {CaliSplat: Sparse Gaussian Fitting and Calibrated Rate Allocation for Image Compression — arXiv:2611.04413},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04413},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5683dfaf6a02; sha256 3c721d23e3200a3a263220deceb223a05cf2636e9a2d9edd85a82bc211ba3ea8},
  year = {2026}
}

Archived text

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

2D Gaussian representations provide an explicit and lightweight alternative for image representation, enabling fast deterministic decoding without a heavy neural synthesis network. However, existing per-image Gaussian codecs still require costly image-specific optimization to determine how limited Gaussian capacity should be distributed across heterogeneous regions. We introduce CaliSplat, an optimization-efficient Gaussian image codec that selectively explores candidate representations and globally allocates a constrained Gaussian budget. We exploit the closed-form reconstruction error of the single-Gaussian case as an inexpensive measure of local difficulty, fitting higher-capacity candidates only in regions where additional Gaussians are likely to be useful. To reduce selection errors caused by mismatched convergence rates across candidate sizes, a small set of longer-horizon fits is used to calibrate short-horizon distortion estimates before global budget-aware selection. The selected representation is then compressed into a bitstream. Across standard and large image datasets, CaliSplat achieves competitive or superior rate--distortion performance while reducing per-image fitting time by $3.0\times$--$15.7\times$ compared with representative Gaussian codecs. It further maintains high-throughput deterministic decoding at $175.9$--$478.2$~MP/s. These results demonstrate that content-adaptive Gaussian compression can substantially reduce per-image optimization cost while preserving strong reconstruction quality and efficient explicit decoding.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.04413 — 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-11-04T18:32:37.305Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).