- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposed the bounded competitive fitting for the task of large image representation with primitives. It fit primitives to image tiles as opposed to pixels to keep the complexity (storage size) bounded. It also implemented decoded-state coding and rate allocation to compress the fitted primitives and to split an image-wide byte budget across tiles. To further increase the hardware efficiency, it then proposed persistent contributor mapping to remove the per-render contributor search. On FGF2, CORD’s High setting outperforms the SGI baseline by 4.60 dB with 19% smaller payloads and an 18.9x optimization speedup.
Critical strengths
- The method looks well-crafted and well-balanced between the complexity and the efficiency it can bring.
- The methods are paired with a native GPU implementation that boosts the hardware efficiency.
- The experimental numbers are supported by clear ablations to know the rough contribution of each proposed component from both quality and efficiency perspective.
Critical weaknesses
- One of the major motivations of this paper is storage compression. However, I don't see a comparison with modern codecs, which can also bring a lot of savings in storage. Then the question is: why go for this instead of just referring to traditional codecs?
- For the contribution on mitigating repeated rendering, what's the edge agains simply keeping the decoded image in memory?
- 9 images, and the 3 used for tuning are also in the test set ... which can be limited for evaluation
Questions for authors
Please address my concerns in the witness.