Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A primal-dual data-driven method for computational optical imaging with a photonic lantern (2306.11679v2)

Published 20 Jun 2023 in eess.IV

Abstract: Optical fibres aim to image in-vivo biological processes. In this context, high spatial resolution and stability to fibre movements are key to enable decision-making processes (e.g., for microendoscopy). Recently, a single-pixel imaging technique based on a multicore fibre photonic lantern has been designed, named computational optical imaging using a lantern (COIL). A proximal algorithm based on a sparsity prior, dubbed SARA-COIL, has been further proposed to solve the associated inverse problem, to enable image reconstructions for high resolution COIL microendoscopy. In this work, we develop a data-driven approach for COIL. We replace the sparsity prior in the proximal algorithm by a learned denoiser, leading to a plug-and-play (PnP) algorithm. The resulting PnP method, based on a proximal primal-dual algorithm, enables to solve the Morozov formulation of the inverse problem. We use recent results in learning theory to train a network with desirable Lipschitz properties, and we show that the resulting primal-dual PnP algorithm converges to a solution to a monotone inclusion problem. Our simulations highlight that the proposed data-driven approach improves the reconstruction quality over variational SARA-COIL method on both simulated and real data.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. “Highresolution air-clad imaging fibers,” Opt. Lett., vol. 43, pp. 5311–5314, 2018.
  2. “In situ identification of gram-negative bacteria in human lungs using a topical fluorescent peptide targeting lipid,” A. Sci. Transl. Med., vol. 10, pp. eaal0033, 2018.
  3. “The photonic lantern,” Adv. Opt. Photon., vol. 7, pp. 107–167, 2015.
  4. “Computational optical imaging with a photonic lantern,” Nat. Commun., vol. 11, no. 1, pp. 5217, 2020.
  5. L. Condat, “A primal–dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms,” J. Optim. Theory Appl., vol. 158, no. 2, pp. 460–479, 2013.
  6. B. C. Vũ, “A splitting algorithm for dual monotone inclusions involving cocoercive operators,” Adv. Comput. Math., vol. 38, no. 3, pp. 667–681, 2013.
  7. E. J. Candès, “Compressive sampling,” in Proceedings of the international congress of mathematicians. Madrid, Spain, 2006, vol. 3, pp. 1433–1452.
  8. J. Adler and O. Öktem, “Learned primal-dual reconstruction,” IEEE Trans. Med. Imag., vol. 37, no. 6, pp. 1322–1332, 2018.
  9. “Image restoration and reconstruction using targeted plug-and-play priors,” IEEE Trans. Comput. Imag., vol. 5, no. 4, pp. 675–686, 2019.
  10. “Plug-and-play methods for magnetic resonance imaging: Using denoisers for image recovery,” IEEE Signal Process. Mag, vol. 37, no. 1, pp. 105–116, 2020.
  11. “Plug-and-play image restoration with deep denoiser prior,” IEEE Trans. Pattern Anal. Mach. Intell., 2021.
  12. “Learning maximally monotone operators for image recovery,” SIAM J. Imaging Sci., vol. 14, no. 3, pp. 1206–1237, 2021.
  13. “Plug-and-play methods for integrating physical and learned models in computational imaging: Theory, algorithms, and applications,” IEEE Signal Process. Mag., vol. 40, no. 1, pp. 85–97, 2023.
  14. “Enhancing sparsity by reweighted ℓ1subscriptℓ1\ell_{1}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT minimization,” J. Fourier Anal. Appl., vol. 14, pp. 877–905, 2007.
  15. “Sparsity averaging for compressive imaging,” IEEE Signal Process. Lett., vol. 20, no. 6, pp. 591–594, 2013.
  16. “Scalable splitting algorithms for big-data interferometric imaging in the ska era,” Mon. Not. R. Astron. Soc., vol. 462, no. 4, pp. 4314–4335, 2016.
  17. J. Geiping and M. Moeller, “Composite optimization by nonconvex majorization-minimization,” SIAM J. Imaging Sci., vol. 11, no. 4, pp. 2494–2598, 2018.
  18. “On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision,” SIAM J. Imaging Sci., vol. 8, no. 1, pp. 331–372, 2015.
  19. “Non-smooth non-convex Bregman minimization: Unification and new algorithms,” J. Optim. Theory. Appl., vol. 181, no. 1, pp. 244–278, 2019.
  20. A. Repetti and Y. Wiaux, “Variable metric forward-backward algorithm for composite minimization problems,” SIAM J. Optim., vol. 31, no. 2, pp. 1215–1241, 2021.
  21. “Deep unfolding of a proximal interior point method for image restoration,” Inverse Problems, vol. 36, no. 3, pp. 034005, 2020.
  22. M. Jiu and N. Pustelnik, “A deep primal-dual proximal network for image restoration,” IEEE J. Sel. Topics Signal Process., vol. 15, no. 2, pp. 190–203, 2021.
  23. “Simultaneous fidelity and regularization learning for image restoration,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 43, no. 1, pp. 284–299, 2019.
  24. “Regularization by denoising via fixed-point projection (RED-PRO),” SIAM J. Imaging Sci., vol. 14, no. 3, pp. 1374–1406, 2021.
  25. “Convolutional proximal neural networks and plug-and-play algorithms,” Linear Algebra Appli., vol. 631, pp. 203–234, 2021.
  26. “Proximal denoiser for convergent plug-and-play optimization with nonconvex regularization,” in International Conference on Machine Learning. PMLR, 2022, pp. 9483–9505.
  27. “On maximum a posteriori estimation with plug & play priors and stochastic gradient descent,” J. Math. Imaging Vision, pp. 1–24, 2023.
  28. “Building firmly nonexpansive convolutional neural networks,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020, pp. 8658–8662.
  29. “Provable convergence of plug-and-play priors with MMSE denoisers,” IEEE Signal Process. Lett., vol. 27, pp. 1280–1284, 2020.
  30. Convex analysis and monotone operator theory in Hilbert spaces, Springer, 2017.
  31. “Proximal splitting methods in signal processing,” in Fixed-point algorithms for inverse problems in science and engineering, pp. 185–212. Springer, 2011.
  32. “Fixed point strategies in data science,” IEEE Trans. Image Process., vol. 69, pp. 3878–3905, 2021.
  33. N. Komodakis and J.-C. Pesquet, “Playing with duality: An overview of recent primal-dual approaches for solving large-scale optimization problems,” IEEE Signal Process. Mag, vol. 32, no. 6, pp. 31–54, 2015.
  34. “Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising,” IEEE Trans. Image Process., vol. 26, no. 7, pp. 3142–3155, 2017.
  35. “Feedback from a data center for education at CentraleSupélec engineering school,” in 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2022, pp. 330–337.
  36. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” Tech. Rep., 2014, 10.48550/arxiv.1412.6980.
  37. “Imagenet large scale visual recognition challenge,” Tech. Rep., 2014, 10.48550/arxiv.1409.0575.
  38. “Supporting data for “computational optical imaging with a photonic lantern” by Choudhury et al,” 2020, DOI:10.17861/a1bebd55-b44f-4b34-82c0-c0fe925762c6.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now