- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper addresses how to entropy-code the attributes in 2D Gaussian image representation compression. Specifically, for each attribute (scale, rotation, opacity, and color), it decides between (i) dividing the image into 16 fixed cells and using a separate probability model for each cell (per-cell), or (ii) using a single probability model for the whole image (global). This decision is made on 20 images and then fixed, so it does not change with the input image. Based on the decision, for scale and color attributes, per-cell models are chosen, and global models for rotation and opacity. This approach saves 0.526 bits/G of attribute bits compared with using global models for all attributes, and 0.190 bits/G compared with using per-cell models for all attributes (Table 4).
Critical strengths
None
Critical weaknesses
W1: The study in this paper is confined to one specific setting in which many design choices are fixed arbitrarily. Positions are coded by a quadtree, the image is divided into a fixed 4×4 cell grid, and only two attribute models (global or per-cell) are considered. Within this setting, the method only decides which of the two models to use for each attribute. Such a binary decision rule for each attribute is difficult to recognize as a research contribution.
W2: The paper claims three contributions in the Introduction:
-
a controlled study,
-
a predict-before-encoding protocol, and
-
validation.
However, none of them offers a new perspective or a technical advance over existing work. The predict-before-encoding decision rule is classical MDL accounting, as the authors acknowledge (Section 4), and validating a decision on held-out data is standard practice in machine learning. Rather, an improvement in rate efficiency of entropy coding could be a clear contribution, but the proposed method is reported to perform worse than even the general-purpose compressor xz (Section 6.3). The authors state that “absolute rate is not the claim” (line 426). However, the value of this work beyond coding efficiency is unclear.
Questions for authors
There are no questions that I expect to change my assessment. However, if my understanding of the paper’s core contribution is substantially mistaken, active discussion during the rebuttal is strongly encouraged.
6 comments
Response to Authors
Thank you for the detailed response. I understand that the revision modifies the method, corrects the error in the rate evaluation, and extends the experiments.
However, the core research value claimed by this paper remains unclear to me. In the original submission, the authors stated that "absolute rate is not the claim," and this sentence has now been removed. If the contribution is now the coding efficiency itself, it should be supported by comparisons with learned or specialized entropy coders for Gaussian attributes. Outperforming general-purpose compressors such as xz and zstd by 5–10% is not sufficient to establish this.
Therefore, I maintain my rating.
Thank you for the follow-up. The claim has not changed. The contribution is the decision made before encoding: how much spatial context each attribute should use, and which estimate selects it correctly. The held-out estimate gets the sign wrong for rotation; the sequential codelength under the coder's own update rule selects the same route as exhaustive encoding of all 125 routes on all 305 sets. This is measured against the coder's own exhaustive search, not against other coders.
We removed "absolute rate is not the claim" because it was written to explain a loss to xz caused by container framing, which the revision fixed; the claim did not move to absolute rate. The xz/zstd comparison only shows that the decision is studied on a reasonable coder, and the paper states that we compare only with general-purpose compressors.
Learned entropy models such as HAC, ContextGS and LG-HCC also fix their context structure in advance. A rate comparison with them would mainly compare model families, which we keep fixed on purpose so that the effect of the context choice can be measured exactly.
Response to Reviewer 3xED
Thank you for the review. Both points led to concrete changes in the revision, which we summarize below.
W1: one fixed setting and a binary choice. The revised method selects, per image, one of five quadtree context depths (from one global model to 256 cells) for each of scale, rotation and color, so the fixed 4×4 grid and the binary choice are gone. The selection is made before encoding, from symbol counts. On all 305 encoded sets in 11 cohorts from three Gaussian producers and three datasets, it reaches the same size as encoding all 125 depth combinations and keeping the smallest. The quadtree position coder is still fixed; the paper is about attribute context selection, and we state that scope in the introduction.
W2a: MDL and held-out validation are standard. We agree that the accounting is MDL. The point of the paper is which codelength to use. Standard held-out validation (in our case: fit on four fifths of each image, score the rest) predicts the wrong sign of the gain for rotation, because it leaves out the cost of learning from empty counts that the coder pays within each image. The sequential codelength under the coder's own update rule predicts the mean measured change to within 0.003 bits/G. So in this setting, the standard practice gives the wrong decision and the sequential one gives the right one. The revised paper puts this comparison in the main text.
W2b: worse than xz. Following up on this point, we found that the submitted container, not the probability model, caused the gap. It closed a separate rANS stream every 256 symbols and wrote a header and directory entry for each tile and attribute group. On small Gaussian sets this framing dominated the file: over 100 bits per Gaussian on Kodak images with about 1,000 Gaussians. The probability model itself already used fewer bits than xz on the attribute columns in every cohort. We changed only the container (a header of 49–51 bytes, one rANS stream for positions, one for attributes, a CRC); the models and the selection rule are unchanged, and every file was decoded in a separate process and matched the input byte for byte. Complete files, bits per Gaussian, compared with the smaller of xz and zstd for each image (95% bootstrap CI over images):
N is the mean number of Gaussians per image. The file is smaller than both general-purpose compressors on 299 of 305 sets. On the six remaining sets, all AIR images with 52k–94k Gaussians, our file is 0.02% to 11.0% larger than xz; the revised appendix lists them with the size of each segment. We do not claim that this beats learned or specialized coders; xz and zstd are the only baselines here, and we state this as a limitation. The sentence "absolute rate is not the claim" is removed, and the old container results are kept in the appendix.