- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies sparse signal support recovery in the problem of jointly sparse blind deconvolution and proposes QuIR, i.e., Quotient-Informed Recovery Network. The framework contains three stages. In the first stage, the paper identifies the shift ambiguity in recovery and hence focuses on the support’s circular autocorrelation, essentially recording the differences between nonzero positions. Further, under several assumptions, the paper shows that this normalized circular autocorrelation can be obtained in the large-channel limit by applying an inverse Fourier transform and zero-offset normalization to a sequence computed from averaged squared magnitudes of normalized inner products between Fourier rows of the original measurements. However, finite-channel effects and noise can make this direct estimate inaccurate. Instead of directly applying this relation, the paper proposes a learning-based method, followed by a non-learned decoder to translate the estimated circular autocorrelation into support candidates, which constitutes Stage II. In Stage III, the relative off-support-energy cost in (3) is written as a generalized Rayleigh quotient and hence solved through a generalized eigenvalue problem. The paper also identifies the sources of error and presents conditional theoretical guarantees concerning their effects on recovery. Finally, evaluations on synthetic and measured data demonstrate the efficacy of the proposed QuIR.
Critical strengths
-
Coherent structure design in QuIR. For each individual stage, its role is clear and the choices are also well motivated both by intuition and derivation. Built upon three separate stages, QuIR is also well connected and the complete roadmap is promising.
-
The analysis in sec. 3 explains conditions for resolving reflection from the original observations and for obtaining an accurate inverse direction from an inexact candidate. These results are insightful and help interpret the method, even though the guarantees are conditional and some proof ingredients are standard.
-
The paper also provides informative experiments and reports not only the success and improvement but also its limitations.
Critical weaknesses
None
Questions for authors
-
I would like to mention Sensor Calibration for Off-the-Grid Spectral Estimation by Eldar, Liao, and Tang. After Fourier transformation, QuIR’s model (1) can be viewed as a fixed-grid instance of their diagonal-calibration model, up to normalization. Their covariance-based methods retain complex phase information and exploit the underlying Toeplitz structure to estimate unknown calibration gains and phases, which correspond to QuIR’s kernel frequency response \hat g. Under their stated conditions, they can also recover the spectral support up to a common shift. QuIR takes a different route. Its squared magnitude eliminate dependence on the kernel phase. The resulting autocorrelation representation consequently retains reflection and possible ambiguities. Stage III then uses the original observations to resolve such ambiguities and estimate an inverse. I would like to know the potential advantages and limitations of QuIR over covariance-based self-calibration. In particular, it would be useful to clarify whether avoiding explicit phase calibration offers benefits in terms of, for example, few channels, noisy observations, or poor kernel conditions.
-
Since the candidate search already considers multiple cardinalities, could the authors discuss how QuIR’s outputs could be used to estimate K for the final top K support extraction when the true cardinality is unavailable?
-
A waveform NMSE of 0.375 is reported. Could the authors discuss the main sources of this remaining waveform error?
5 comments
1. Relation to covariance-based self-calibration
QuIR and covariance-based self-calibration share a diagonal-gain formulation on a fixed Fourier grid, but exploit different structural information. In the noiseless setting, QuIR's observation model is , where is the Fourier-domain observation matrix, is the kernel frequency response, contains the Fourier columns indexed by the common support , and contains the active coefficients across channels. The kernel response therefore plays a role analogous to the diagonal calibration gains in the model of Eldar, Liao, and Tang. Their method retains the complex covariance and exploits the Toeplitz structure of the underlying covariance to estimate the calibration gains and spectral support. QuIR instead forms normalized comparisons of Fourier rows. Under the noiseless independent-coefficient model, these comparisons remove each row's nonzero complex scaling and yield the normalized support autocorrelation in the large-channel limit. QuIR then uses the original complex observations to compare the decoded candidate with its reflection and fit the filter.
Because the support-autocorrelation estimate encodes relative spacings, it is invariant to reflection and may also be shared by homometric supports. QuIR uses the original observations to compare the decoded candidate with its reflection, but other homometric alternatives may not be tested. With few channels, the empirical row comparisons may deviate from their large-channel limit. Under noise, row directions are less reliable at frequencies where the kernel response is weak. QuIR therefore also uses row-power features, which provide information about observed signal strength but remain dependent on the kernel response. Our experiments evaluate QuIR under these conditions; they do not isolate the effect of avoiding explicit phase calibration or establish a performance advantage over covariance-based calibration at matched channel counts, noise levels, and kernel conditioning. Section 1 discusses this relationship.
2. Candidate-based support-size readout
We evaluated the candidate-size readout on 114,200 recorded synthetic scenes across seven sweeps, holding the full reconstruction and row-energy ranking fixed. The true- readout selects the highest-energy rows and serves as a reference for evaluating support localization when the size is known; the reconstruction itself does not use the true . The candidate-size readout selects the highest-energy rows. With the ranking fixed, it recovers the exact support up to circular shift if and only if the candidate size equals and the true- readout succeeds. We used this rule to compute the exact-recovery counts from the recorded true sizes, candidate sizes, and true- outcomes. The archive QuIR_estimated_K_readout.zip, included in QuIR_reviewer_supplement.zip, contains the per-scene records (frozen_readout_records.csv), the summary (summary.json), and the script used to recompute the counts (reproduce_counts.py).
The candidate size matches in 86,608 scenes (75.84%). Exact support recovery up to circular shift is 75.58% (86,307/114,200) with the candidate-size readout and 87.32% (99,715/114,200) with the true- readout. Among scenes with the correct candidate size, 86,307 of 86,608 (99.65%) yield exact recovery. In 13,408 scenes with an incorrect candidate size, selecting the true number of highest-energy rows from the same reconstruction still recovers the exact support. In those scenes, the estimated size causes the readout to fail even though the row-energy ranking is sufficient to localize the support given . The effect is particularly pronounced in the low-channel signal-length sweep, where exact recovery decreases from 87.05% to 43.83%.
Clarifying QuIR’s Support Estimation, Cardinality Readout, and Reconstruction Accuracy
We thank the reviewer for prompting us to clarify three points: QuIR's relationship to covariance-based self-calibration, how the decoded candidate supports readout when the support size is unknown, and why exact support recovery can coexist with waveform error. We address these points in turn.