A Stochastic Model for Block Segmentation of Images Based on the Quadtree and the Bayes Code for It
Yuta Nakahara, Toshiyasu Matsushima

TL;DR
This paper introduces a new stochastic model for image segmentation using quadtrees and develops an efficient Bayes coding algorithm, demonstrating its effectiveness and computational efficiency in lossless image compression.
Contribution
The paper redefines an implicit stochastic model for images, proposes a quadtree-based generative model, and introduces a polynomial-time algorithm for Bayes coding without losing optimality.
Findings
The model effectively captures variable block size segmentation.
The algorithm computes posterior distributions in polynomial time.
Experiments confirm the model's flexibility and the algorithm's efficiency.
Abstract
In information theory, lossless compression of general data is based on an explicit assumption of a stochastic generative model on target data. However, in lossless image compression, the researchers have mainly focused on the coding procedure that outputs the coded sequence from the input image, and the assumption of the stochastic generative model is implicit. In these studies, there is a difficulty in confirming the information-theoretical optimality of the coding procedure to the stochastic generative model. Hence, in this paper, we propose a novel stochastic generative model of images by redefining the implicit stochastic generative model in a previous coding procedure. That is based on the quadtree so that our model effectively represents the variable block size segmentation of images. Then, we construct the Bayes code optimal for the proposed stochastic generative model. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
