Metraipolis › archive › dc_2ed9fa59d50d

Inter-Frame Predictive Contour Coding for Semantic Map Compression — arXiv:2610.40887

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40887
License (as archived)
CC0-1.0
Archived
2026-11-03T05:46:37.138Z
SHA-256 of the archived text
ad27e574724abe2b8134972d81c96dc0dd75911f80fa8ff3f6ea4d69f11e3fd8
Stable URL of this page
https://metraipolis.com/documento/dc_2ed9fa59d50d

How to cite

Inter-Frame Predictive Contour Coding for Semantic Map Compression — arXiv:2610.40887 — arXiv (en), https://arxiv.org/abs/2610.40887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ed9fa59d50d (Metraipolis archive dc_2ed9fa59d50d, sha256 ad27e574724abe2b8134972d81c96dc0dd75911f80fa8ff3f6ea4d69f11e3fd8)
BibTeX
@misc{dc2ed9fa59d50d,
  title = {Inter-Frame Predictive Contour Coding for Semantic Map Compression — arXiv:2610.40887},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40887},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ed9fa59d50d; sha256 ad27e574724abe2b8134972d81c96dc0dd75911f80fa8ff3f6ea4d69f11e3fd8},
  year = {2026}
}

Archived text

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

Dynamic semantic maps have become an important intermediate representation for many computer vision applications. Efficient lossless compression of such maps is essential for reducing storage and transmission costs. Existing contour-based semantic map compression methods mainly exploit spatial redundancy within individual frames while largely ignoring the strong temporal correlation between adjacent semantic maps. In this paper, we propose an inter-frame predictive contour coding framework for lossless semantic map compression. The proposed framework first predicts blob positions and label indexes from the reference frame and then performs contour prediction using corresponding chain-code units in the reference contours. A mode selection mechanism is further employed to choose between intra and inter coding according to the estimated coding cost. By exploiting temporal contour redundancy while preserving the advantages of contour-based representation, the proposed framework significantly improves coding efficiency. Experimental results on the VSPW dynamic semantic segmentation dataset demonstrate that the proposed method consistently outperforms state-of-the-art lossless semantic map compression methods. Compared with the recent context-adaptive extended chain coding framework, the proposed inter-frame coding achieves an average bitrate reduction of 3.0\% without significant increase in the average encoding time, demonstrating an effective trade-off between compression performance and computational complexity. The source code is made publicly available at this https URL .

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.CV, nuovi lavori del giorno).
Categorie arXiv: Image and Video Processing (eess.IV) ; Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2610.40887 — 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-03T05:33:32.328Z dalla pagina https://arxiv.org/list/cs.CV/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).