Noise and bias in square-root compression schemes
Gary M. Bernstein, Chris Bebek, Jason Rhodes, Chris Stoughton, R. Ali, Vanderveld, Penshu Yeh

TL;DR
This paper evaluates a lossy square-root data compression method for sky surveys, showing it effectively reduces data size with minimal bias and noise penalty, suitable for dark energy research.
Contribution
It introduces an analytic correction for flux biases in square-root compression and demonstrates its minimal impact on galaxy measurements in sky surveys.
Findings
Compression to 2.5-4 bits per pixel is achievable with <10% noise penalty.
Galaxy fluxes and shapes are biased by less than 10^{-4} due to compression.
Square-root compression is advantageous over linear methods in complex, high-background fields.
Abstract
We investigate data compression schemes for proposed all-sky diffraction-limited visible/NIR sky surveys aimed at the dark energy problem. We show that lossy square-root compression to 1 bit of noise per pixel, followed by standard lossless compression algorithms, reduces the images to 2.5-4 bits per pixel, depending primarily upon the level of cosmic-ray contamination of the images. Compression to this level adds noise equivalent to <10% penalty in observing time. We derive an analytic correction to flux biases inherent to the square-root compression scheme. Numerical tests on simple galaxy models confirm that galaxy fluxes and shapes are measured with systematic biases <~10^{-4} induced by the compression scheme, well below the requirements of supernova and weak gravitational lensing dark-energy experiments. An accompanying paper (Vanderveld 2009) bounds the shape biases using…
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.
