Block Coordinate Plug-and-Play Methods for Blind Inverse Problems

Plug-and-play (PnP) prior is a well-known class of methods for solving imaging inverse problems by computing fixed-points of operators combining physical measurement models and learned image denoisers. While PnP methods have been extensively used for image recovery with known measurement operators, there is little work on PnP for solving blind inverse problems. We address this gap by presenting a new block-coordinate PnP (BC-PnP) method that efficiently solves this joint estimation problem by introducing learned denoisers as priors on both the unknown image and the unknown measurement operator. We present a new convergence theory for BC-PnP compatible with blind inverse problems by considering nonconvex data-fidelity terms and expansive denoisers. Our theory analyzes the convergence of BC-PnP to a stationary point of an implicit function associated with an approximate minimum mean-squared error (MMSE) denoiser. We numerically validate our method on two blind inverse problems: automatic coil sensitivity estimation in magnetic resonance imaging (MRI) and blind image deblurring. Our results show that BC-PnP provides an efficient and principled framework for using denoisers as PnP priors for jointly estimating measurement operators and images.

Paper

Similar papers

Peer review

Reviewer 8yHJ4/10 · confidence 4/52023-07-02

Summary

The paper proposes a block-coordinate optimization strategy for plug-and-play (PnP) methods to solve blind inverse problems in imaging. Empirical validation is performed with blind deblurring and parallel CS-MRI. Theoretical study on the convergence of the proposed BC-PnP was extended from the theoretical result of PnP with MMSE denoisers.

Strengths

1. To the best of my knowledge, this is one of the first works to extend PnP methods to blind inverse problems 2. Theory is sound and proves proper convergence properties of the proposed method. 3. The method seems to be robust and generally applicable to inverse problems arising in imaging, as validated in the experiments.

Weaknesses

1. I do not find much novelty in the theory of the paper. While the components are all sound, both components of the extension (extending to block coordinate update and extending to denoisers that are optimal only up to a constant error) seems to be quite trivial. I would appreciate it if the authors could elaborate on this point. 2. BC-PnP seems to rely quite heavily on initialization for the imaging operators (i.e. sensitivity maps, blur kernels) that are close to ground truth. Such initialization strategy is not always possible, and for many cases even when it is possible, is often computationally demanding. Does BC-PnP converge properly also for cases when there is no such initialization strategy? Adding on this point, it might not be fair to compare other blind inverse problem solver that do not leverage any initialization strategy. 3. For blind deblurring, it seems that the authors only tested on Gaussian blur kernels, which are known to be relatively easy to fit. Does the method scale to more complex blur kernels, such as in [1,2]? **Referneces** [1] Levin, Anat, et al. "Understanding and evaluating blind deconvolution algorithms." 2009 IEEE conference on computer vision and pattern recognition. IEEE, 2009. [2] Chung, Hyungjin, et al. "Parallel diffusion models of operator and image for blind inverse problems." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2023.

Questions

Please see weaknesses

Rating

4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

Yes.

Reviewer 7kUv6/10 · confidence 4/52023-07-04

Summary

This paper presents a new plug-and-play algorithm for solving blind inverse problems, i.e., where the forward sensing operator is not fully known. The method leverages pretrained denoisers for both the signals and the unknown parameters of the sensing model. A theoretical analysis of the proposed algorithm is presented, showing that under certain conditions on the denoisers and data fidelity functions, the algorithm is guaranteed to converge to a local minimizer.

Strengths

- The paper presents a novel plug-and-play algorithm for blind inverse problems, with some theoretical guarantees under relatively mild assumptions. - The experimental results show a good performance with respect to other competing methods in two different blind inverse problems.

Weaknesses

I find it a bit surprising that the PnP method outperfoms other unrolled algorithms trained for a specific inverse problem. Even the authors express that "While denoisers provide a convenient, principled, and flexible mechanism to specify priors, they are inherently self-supervised and their empirical performance can thus be suboptimal compared to priors trained in a supervised fashion for a specific inverse problem" I wonder if the comparison presented in the paper is fair, do the competing methods use architectures that have a similar expressive power than the DRUNet denoiser used for PnP? Moreover, there exist end-to-end architectures that can estimate both the forward operator parameters and the underlying image (e.g. "Deep algorithm unrolling for blind image deblurring" by Li et al.), which haven't been evaluated here.

Questions

- What is the performance of the proposed method on the blind deblurring problem with non-isotropic kernels? It would be good to show an example in this setting.

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The paper discusses some of the limitations of the proposed method. However, there is no discussion related to the inherent large computational complexity of PnP methods, that require many more iterations than unrolled networks to reach convergence.

Reviewer NG5f7/10 · confidence 3/52023-07-05

Summary

The paper generalizes the plug-and-play framework from single-block to a multi-block case by embedding unknown inverse operators. It provides convergence analysis for the proposed method and conducted various experiments on two imaging applications, i.e., parallel MRI and blind image deblurring. Numerical results are sufficiently convincing to show that the proposed method works better than the other comparable PnP methods in the blind measurement operator case.

Strengths

The paper reads well and is well-organized from theoretical discussions to numerical experiments. The proposed method is original with clear motivation of unknown inverse operators from the realistic setting. Thus, it may also shed some light on other imaging applications.

Weaknesses

1. The computational cost of this framework is not analyzed or even mentioned. Likewise, the running times for all the experimental results could be listed and compared. Some other end-to-end methods may also be tested. 2. Some minor notational confusion exists, e.g., lines 198-199. 3. Theorems 1-2 require square-summable condition for the error sequences to ensure the convergence of gradients. Further discussions may be added about how this condition can be satisfied or checked in practice.

Questions

In all the numerical experiments, are the assumptions 1-5 and conditions in Theorems 1-2 verified or checked? If yes, the details could be included in the supplement.

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The authors have listed the limitations and provided some potential solutions in future works.

Reviewer tTXT7/10 · confidence 5/52023-07-08

Summary

Develops a plug-and-play technique for blind (unknown forward model) imaging inverse problems. Key idea is to use two denoising algorithms: One as a prior on the image and one as a prior model on the measurement operator (e.g., blur kernel). Also analyzes the convergence of the algorithm. Successfully applies (in simulation) the proposed algorithm to MRI with unknown coil sensitive maps and deblurring with unknown blur kernel.

Strengths

Investigates important and understudied problem Proposed technique is well-justified and seemingly effective I like the paper's approach to framing the blind image reconstruction problem (equation (10)). Easy to read Proposed method seems generally applicable to lots of problems and opens up and opportunity for lots of follow-up work Code will be shared publicly

Weaknesses

Lacks comparisons with closest competitors. Particulary [60]. Missing related work: There's a line of work on PnP for holography with unknown phase errors (e.g., [A]) that may be worth mentioning. [A] Pellizzari, Casey J., Mark F. Spencer, and Charles A. Bouman. "Coherent plug-and-play: digital holographic imaging through atmospheric turbulence using model-based iterative reconstruction and convolutional neural networks." IEEE Transactions on Computational Imaging 6 (2020): 1607-1621.

Questions

Diffusion models are essentially denoisers by a different name, therefore a comparison with [60] seems obligatory. They are essentially solving the same problem (though the current method has more theory). How do they compare?

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

5: You are absolutely certain about your assessment. You are very familiar with the related work and checked the math/other details carefully.

Soundness

4 excellent

Presentation

4 excellent

Contribution

4 excellent

Limitations

Adequately discussed

Reviewer 8yHJ2023-08-10

Thank you for your response. Overall, I am satisfied with the rebuttal. 1. After reading the response and going through other reviewers' comments, I believe that my concerns with the shortcomings of the theory may have been due to my lack of understanding. 2. The experiment on the initialization for CS-MRI indeed shows that BC-PnP will work under other less-close-to-the-ground-truth initializations. I am still curious if this will scale to motion deblur problems even when the kernel is initialized from e.g. Gaussian. That said, I do understand that a week is a short period of time to conduct all the experiments. 3. I am still a bit skeptical about the performance of motion blind deblurring, as the metrics seem quite similar to Pan-DCP, and there is no figure to compare the results.

Authorsrebuttal2023-08-14

We thank the reviewer for acknowledging our rebuttal and for sharing additional thoughts. We hope that the reviewer will consider updating their ratings to reflect the rebuttal. 1. We appreciate the reviewer’s re-evaluation of their views on our theory. We are indeed very pleased to share our theoretical results with the community. 2. Our current empirical results show that BC-PnP can achieve excellent performance given realistic initialization strategies for MRI and Gaussian deblur. It would indeed be interesting to look deeper into the matter of initialization in the context of motion deblur, which we will have to leave for future work. However, our preliminary results indicate that the current method already provides an excellent starting point for this direction. 3. While our numerical results on motion deblur are very preliminary, they already indicate that BC-PnP can do well, even with very limited time for fine-tuning. We did not include visual illustrations for motion deblur purely due to space limitations in the rebuttal document. However, we can say that visually BC-PnP is competitive with other methods.

Reviewer 7kUv2023-08-14

Thanks for answering my comments, I am satisfied by the rebuttal and I will raise my score accordingly. I just have a concern regarding the comparison with DUBLID: the comparison seems to use an isotropic kernel, how would the algorithms compare for non-isotropic ones (e.g., the one in Table 6)?

Authorsrebuttal2023-08-17

We thank the reviewer for raising the score and for sharing additional thoughts. Prompted by the additional comment, we tested DUBLID on the same motion kernel depicted in Figure 6 of the attached pdf, and compared its performance with BC-PnP. The results are as follows: | Method | NRMSE | SSIM | |-- |-- |-- | | DUBLID | 0.183 | 0.606 | | BC-PnP | 0.123 | 0.741 | Note how BC-PnP outperforms DUBLID quantitatively. While it is not possible for us to show visual results in the discussion section, we can say that visually BC-PnP is better than DUBLID.

Authorsrebuttal2023-08-19

Discussion Period Response to All Reviewers and Area Chairs

Thank you all again for reviewing our work! An additional thanks to the reviewers who have already taken our rebuttal into consideration and the area chairs for managing the review of our paper. As we near the end of the discussion period, let us know if there is anything else we can do to improve your evaluation of our work.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC