- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper studies hidden-screen reconstruction from wall-mediated RGB observations in fixed physical scenes. The proposed TCCRL framework contains two parts: a scene-sahred transport coupling network that learns the correspondence between screen and wall features, and a verification module that tests local reconstruction changes against complementary measurements before write-backs. The method is evaluated on five screen-content benchmarks, compared to a broad set of prior NLOS and generic image restoration baselines.
Critical strengths
-
The proposed route-then-verify formulation is well-motivated and coherent.
-
The evaluation is broad and informative.
Critical weaknesses
- The practical value and cost of the task settings is unclear.
The papers states that a new physical geometry requires a new coupling and needs to be separately trained. It is not clear how much such adaption costs in practice (e.g, time/computation power), which will affects the practical value of the method.
Moreover, while the paper clearly frames its contribution as establishing initial feasibility in fixed physical scenes, there is still limited discussion of why this particular setting is practically meaningful. A clearer discussion of the significance and intended use cases of this settings would help establish its broader relevance.
2.The baseline comparison is broad, but coverage of the closest passive transport-aware methods is surprisingly limited.
The evaluation includes prior hidden-scene methods, but several of them originate from largely different sensing settings. Generic restoration methods, on the other hand, are a reasonable category to compare with, but add little to isolating the value of TCCRL's particular formulation compared to closest passive-NLOS prior methods.
In particular, a closer method Zhang et al. (2025) is already mentioned in the related work section, but is surprisingly not included in the evaluation.
Questions for authors
-
Can author include discussion of why such task settings is meaningful, and the practical cost of doing per-scene adaption?
-
Can author include more closer passive transport-aware baselines?
3 comments
W1 + Q1 (first part). What per-scene adaptation actually costs
Per-scene adaptation recovers roughly half of the loss with two minutes of registration and comes within half a dB of a full retrain with half an hour of capture plus about ten minutes of GPU time, whereas the full retrain takes 6.5 to 9 hours. We measured this on two non-reference geometric conditions, both lying on the Appendix C.6 sweeps, namely char in Scene A with a camera tilt of +5° on the angle axis, and software in Scene B with a camera-to-wall distance of 0.925·d0 on the distance axis. All values are PSNR on each condition's own test set. The reference for each condition is its own full-data retrain, since the Table 2 numbers belong to a different geometry.
| Adaptation | pairs | char | software |
|---|---|---|---|
| Zero-shot | 0 | 14.20 | 19.64 |
| Homography registration only | 0 | 17.35 | 23.90 |
| Refit coupling only | 200 | 19.28 | 26.85 |
| Refit coupling only | 500 | 19.66 | 27.38 |
The target level is each condition's own full-data retrain, measured on that condition's test set so that it shares the split with every adaptation row: 19.80 on char and 27.60 on software. The curves of Appendix C.6 are on the archived validation split of that study, where software stays within 27.77–27.84 dB across the whole distance sweep, so they show the same stability on a different split rather than supplying these two cells. The revision states the split of each. Against the test-set references, coupling-only refitting with 500 pairs falls short by 0.14 and 0.22 dB.
| Cost item | char | software |
|---|---|---|
| Homography registration (no pairs needed) | ~2 min | ~2 min |
| Capture 500 pairs | ~25 min | ~25 min |
| Coupling refit, GPU | ~8 min | ~11 min |
| Full retrain, GPU (reference) | ~6.5 h | ~9 h |
| Trainable parameters / full network | ~4k / ~3.2M | ~4k / ~3.2M |
The mechanism follows from the planarity of the wall, under which a small camera translation or tilt acts approximately as a homography on the wall image. This homography can be estimated from the static scene without any paired captures, and this step alone recovers about half of the loss in two minutes. Most of the remainder is closed by refitting only the coupling, about 4k parameters, at a cost of roughly half an hour of capture and ten minutes of GPU time, compared with 6.5–9 hours for a full retrain.
A new geometry therefore does require a new coupling, and the revision states this while showing that obtaining one is a calibration step measured in minutes of GPU time. The scope of the result is limited in two respects. It is per-geometry adaptation, in which each condition keeps its own coupling and the planar-homography argument holds for small changes. It also covers only camera tilt and camera-to-wall distance. Occluder repositioning alters the visibility structure itself, which no warp of the wall image can represent, so it belongs to a different geometric family that this result does not cover.
W1 + Q1 (second part). Why this setting is practically meaningful
The intended setting is defensive, and in that setting the fixed geometry follows from the application itself and imposes no additional restriction.
The use case is optical leakage auditing, that is, assessing how much a given room or display installation leaks through indirect reflection. The auditor has physical access to the room, can display known content on the screen being audited, and can calibrate once for a fixed installation. These are exactly the conditions our method requires, namely cooperative capture, a fixed geometry and one-time calibration, so the same requirements that limit adversarial use are met by construction in an audit.
The same requirements exclude covert use, and the revision now states the threat model on this basis. Applying the method requires thousands of known-content captures on the target screen, a fixed geometry with re-adaptation whenever it changes, capture and adaptation under the target illumination, and a screen-to-occluder distance of about 0.5 m. Together these conditions demand physical access and cooperative data collection, which places covert reading of arbitrary private screens beyond the reach of the method. An audit on these terms therefore gives a defender two kinds of actionable information. The primary one is the set of capture requirements above, since each is a condition the defender controls and denying any one of them defeats the method. The second is a measured quantity, namely the decline in recoverability as ambient illuminance rises, which the revision quantifies at three illumination levels.
On isolating the value of the formulation
The margin is attributable to the two proposed modules. Your remark that generic restoration baselines add little to isolating the value of our particular formulation is addressed most directly by the passive-NLOS comparison above. The remark also admits a second reading, namely whether the gains come from the formulation or from the backbone. Table 3 contained no row with both modules disabled, so we ran that check directly.
| Dataset | Full | weakest single-module ablation | backbone-only | strongest baseline |
|---|---|---|---|---|
| SmM | 26.19 | 24.65 | 23.52 | LEAP 24.06 |
| software | 27.84 | 26.00 | 22.96 | Flatland 23.25 |
The backbone and training recipe alone remain below the strongest baseline, so they cannot be the source of the margin. The backbone-only variant keeps the encoder, decoder and local-contrast branch, replaces the routed skips with ordinary same-scale connections, removes the verification stage together with its losses, and is trained from scratch under the protocol of the Full row. It scores below every single-module ablation, so performance decreases monotonically across the table as modules are removed, and it falls below the strongest baseline on both datasets, by 0.54 dB on SmM and 0.29 dB on software.
Grafting the two modules onto Restormer, an independently strong backbone of different design, improves on Restormer's own results by 1.57 dB on SmM and 3.39 dB on software. The gain therefore transfers with the modules to a different architecture, and this transferability is the only claim we draw from the experiment. We make no claim about relative backbone quality, and the grafted model still trails the full TCCRL.
We thank Reviewer 6rWj. Both of your requests admit an experimental answer, and we address them in that form, beginning with the comparison against the closest passive transport-aware methods and then turning to the cost of per-scene adaptation.
W2 + Q2. The closest passive transport-aware methods
We added the two closest passive transport-aware methods, and TCCRL outperforms both on all five datasets, under both splits and on all three metrics. The revision includes Zhang et al. (2025, TIP, light-transport modulation for passive NLOS) and Chen et al. (2025, lightweight multi-scale fusion for passive NLOS), both cited in Section 2.2. Your point motivated this choice directly, since our related-work section describes building on Zhang et al., and NLOS-OT, already in Table 2, shares four authors with that work.
Both methods take passive projection images as input, the same modality as ours, so adaptation was minimal. We ran the official code with the epoch count, crop size and learning-rate search budget matched to the other baselines. We report both splits, using the original split to check that the comparison holds under the submitted protocol and the content-disjoint split to check whether content correlation could account for the margin. The main text of the revision now states that the submitted split is defined at the sample level (8:1:1, fixed seed) and reports the content-disjoint results alongside it.
The table reports PSNR. The revision also reports SSIM and LPIPS for both methods, using the same LPIPS implementation and evaluation region as Table 2, and TCCRL leads on all three metrics in every one of the 20 comparisons (2 methods × 5 datasets × 2 splits).
Zhang et al. derive their advantage from modulation across differing transport conditions, whereas each of our datasets is captured under one fixed geometry, so the condition on which that modulation depends barely varies. Section 2.1 of our paper describes the method as inferring and quantizing a transport-condition code from the projection image and using that code to modulate jointly trained reconstruction and reprojection networks. Because the geometry is held fixed throughout each dataset (a single fixed geometry per dataset), the condition code is nearly constant within a dataset, and reconstruction rests mainly on the backbone.
The new rows are compared on equal footing, and the same protocol applies to the entire baseline table. The revision retrains the full submitted baseline set on the content-disjoint split under the matched protocol, so every row above is evaluated on the same split as TCCRL, and the strongest baseline for each dataset is the best result any method reaches within its own tuning budget.
This fixed-geometry regime is precisely the setting our formulation is designed for. TCCRL learns an explicit sparse correspondence within one fixed geometry and then verifies local edits against held-out parts of the same measurement. We therefore draw a deliberately narrow conclusion from the comparison, namely that for passive single-frame recovery under one fixed geometry, routing followed by verification is the better-matched design, and we do not extend it to a general statement about that line of work. Under multi-geometry joint training the comparison could come out differently, and the revision identifies that setting as the one in which Zhang et al. should be evaluated again.
Neither method becomes the strongest baseline on any dataset, so every reference to the strongest baseline elsewhere in the paper remains unchanged. We read your request as concerning both whether the comparison exists and whether its protocol is fair, and the revision therefore states the protocol explicitly, covering official code, a matched budget for epochs, crop size and learning-rate search, and results on both splits.