- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The manuscript presents a channel-level skipping method for learned image compression. The proposed method sCBH is trained without any downstream-task objective. The claimed contributions include: a single scalar continuously controls the detail-exposure strength, quality, and bitrate; specially designed loss function and the Blockhead, a CNN net for task-agnostic generalization; and a lightweight blockhead decoder attached to the frozen backbone. Experiments are conducted to show continuous control over bitrate and details.
Critical strengths
The paper is well presented. The contributions are well explained. Experiments are clearly presented. The source code is publicly available on anonymous repository (The reviewer has not checked it throughly).
Critical weaknesses
My major concern is on the motivation of this work, i.e., controlling how much visual detail is exposed at decoding time. The intended practical application remains unclear, and the datasets used in the experiments do not align with the assumption underlying the proposed setting.
Questions for authors
What is the intended practical application? Why we need to control the exposed details for decoding? How to decide how much details should be exposed? Who is responsible to control it?
3 comments
I listed the following simple questions: What is the intended practical application? Why we need to control the exposed details for decoding? How to decide how much details should be exposed? Who is responsible to control it?
The authors did not answer them directly, or manually.
But based on the authors' response to other reviewers' questions, I will raise my rating temporarily.
Thank you for restating the four questions. Our earlier reply was organized by weakness rather than by your questions, so we answer them directly here.
Q1 What is the intended practical application? An image repository, for example, cloud storage that stores one image and releases it at different levels of detail under data minimization. The owner keeps the full-quality copy, while a low-trust viewer, such as an insurance adjuster, a moderation queue, or a non-specialist clinician, receives a view sufficient for coarse content but not for fine detail. Cross-institution medical exchange (organ shape for triage, not skin texture) and document preview (layout, not text) follow the same pattern.
Q2 Why control the exposed detail at decoding time? Access control decides who receives a copy, not what the copy contains once it is released. A display-time filter acts on a full-fidelity artifact and is reversible. As reported in Table 12, Gaussian blur at matched bitrate still leaves 98.5% of faces detectable. sCBH removes the detail from the bitstream itself, so the receiver cannot de-blur or upgrade it.
Q3 How is the amount of detail decided? The sender can set the knob to control the amount of detail before the official bitstream is released. The deployer sets a utility floor for the legitimate task (DSC, AUC, OCR) and selects the smallest that meets it. The -sweep is the calibration instrument and the four probes show what each floor costs in detail.
Q4 Who is responsible for control? The sender or the ingestion service fixes before arithmetic coding, so the receiver has no upgrade path to get more details. This is a policy decision at the data controller, implemented by the codec knob. The add-on is 57K parameters and bit-exact at , so the deployment cost is negligible.
We hope this addresses each question directly. We are happy to clarify any one of them.
We thank the reviewer for the direct assessment. We respectfully disagree with the conclusion that the setting is impractical, and we would like to make the case on three grounds: the deployment exists, the alternatives are worse, and the adoption cost is negligible.
The deployment. The governing principle is data minimization. A receiver should get the minimum detail its purpose requires. An image repository stores one bitstream per image and serves a prefix of it at different levels of detail. The owner keeps the full-quality copy. A viewer whose task is structure-level receives a view sufficient for that task but not for fine detail, which is the part the task does not use and the owner does not wish to release. sCBH is progressive at the channel level. The view at any s is a prefix of the same channel-coded representation, and the suffix is never entropy-coded. The sender or ingestion service fixes s before arithmetic coding, so the receiver has no upgrade path. The value follows from a utility floor (DSC, AUC, OCR) for the task and the smallest exposure that meets it. Today the artifact is all-or-nothing, which means the full image, or a degraded copy that cannot be upgraded. sCBH makes the middle ground a property of the artifact itself.
The alternatives do not bound the artifact. Access control decides who receives a copy, not what the copy contains once it is released. The latter is what sCBH controls. Display-time filtering acts on a full-fidelity artifact and is reversible: at matched bitrate Gaussian blur still leaves 98.5% of faces detectable, and post-decoding K-means needs 0.85 bpp / 19.12 dB to reach the zero-detection point that sCBH reaches at 0.154 bpp / 22.17 dB. Pre-processing degrades the stored image permanently and forfeits the full-quality mode. sCBH keeps a single bitstream bit-exact at s=1 while making the released view's detail absent rather than filtered.
The cost. sCBH provides a plug-in, not a new codec architecture. It adds a 57K-parameter decoder (vs. 12M for the ELIC decoder) to a frozen backbone, requires no codec retraining, and attaches to ELIC, Hyperprior, CCM, and HPCM with the same recipe. At s=0 it is 2.3× faster than ELIC on GPU and at parity on CPU, because only 32 of 320 channels are entropy-coded. A service can add the knob without touching its codec and leave it at s=1 until a policy requires otherwise. Even if one does not adopt the privacy framing, this is a low-risk codec feature: 57K parameters, bit-exact at s=1, continuous control, validated on four codecs.
The datasets. The four probes instantiate the assumption. Face detection and OCR depend on fine detail, ISIC and CheXpert on coarse structure. The same s drives face detection from 99.5% to 0% and OCR retention from 86.8% to 8.7%, while ISIC DSC and CheXpert AUC degrade only to 0.539 and 0.733. CelebA is the easiest case, so we add WIDER FACE (3,226 images, 39,123 faces; unaligned, multi-scale, single-scale 640). The same pipeline reduces APeasy from 0.919 to 0.658 and APhard from 0.588 to 0.191, with large-face recall at 0.95; the direction holds at λ=0.5 and λ=0.006 (Appendix E). Suppression is scale-selective and follows the block size.
What changed. Section 1 states the threat model (decoded view only, fixed non-adaptive models) and points to the residual-identity bound in Appendix C. Sections 4.2 and Appendix E report the WIDER evaluation. We also removed "complete face identity protection", restating the claim as detail/detectability suppression.
We thank the reviewer again for the direct feedback and are happy to clarify any number.