A novel variational approach for multiphoton microscopy image restoration: from PSF estimation to 3D deconvolution

被引:1
作者
Ajdenbaum, Julien [1 ]
Chouzenoux, Emilie [1 ]
Lefort, Claire [2 ]
Martin, Segolene [1 ]
Pesquet, Jean-Christophe [1 ]
机构
[1] Univ Paris Saclay, Ctr Vis Numer, Inria, Cent Supelec, Gif Sur Yvette, France
[2] Univ Limoges, XLIM Res Inst, CNRS, UMR 7252, Limoges, France
基金
欧洲研究理事会;
关键词
non-convex optimisation; multiphoton microscopy; 3D deconvolution; PSF calibration; proximal algorithm; POINT-SPREAD FUNCTION; 2-PHOTON FLUORESCENCE MICROSCOPY; CONFOCAL MICROSCOPE; FUNCTION MODEL; ALGORITHM; LOCALIZATION; OPTIMIZATION; RESOLUTION; SECTIONS;
D O I
10.1088/1361-6420/ad3c67
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In multi-photon microscopy (MPM), a recent in-vivo fluorescence microscopy system, the task of image restoration can be decomposed into two interlinked inverse problems: firstly, the characterization of the point spread function (PSF) and subsequently, the deconvolution (i.e. deblurring) to remove the PSF effect, and reduce noise. The acquired MPM image quality is critically affected by PSF blurring and intense noise. The PSF in MPM is highly spread in 3D and is not well characterized, presenting high variability with respect to the observed objects. This makes the restoration of MPM images challenging. Common PSF estimation methods in fluorescence microscopy, including MPM, involve capturing images of sub-resolution beads, followed by quantifying the resulting ellipsoidal 3D spot. In this work, we revisit this approach, coping with its inherent limitations in terms of accuracy and practicality. We estimate the PSF from the observation of relatively large beads (approximately 1 mu m in diameter). This goes through the formulation and resolution of an original non-convex minimization problem, for which we propose a proximal alternating method along with convergence guarantees. Following the PSF estimation step, we then introduce an innovative strategy to deal with the high level multiplicative noise degrading the acquisitions. We rely on a heteroscedastic noise model for which we estimate the parameters. We then solve a constrained optimization problem to restore the image, accounting for the estimated PSF and noise, while allowing a minimal hyper-parameter tuning. Theoretical guarantees are given for the restoration algorithm. These algorithmic contributions lead to an end-to-end pipeline for 3D image restoration in MPM, that we share as a publicly available Python software. We demonstrate its effectiveness through several experiments on both simulated and real data.
引用
收藏
页数:32
相关论文
共 82 条
[1]  
Afef C, 2016, 2016 INTERNATIONAL SYMPOSIUM ON SIGNAL, IMAGE, VIDEO AND COMMUNICATIONS (ISIVC), P120, DOI 10.1109/ISIVC.2016.7893973
[2]   An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems [J].
Afonso, Manya V. ;
Bioucas-Dias, Jose M. ;
Figueiredo, Mario A. T. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (03) :681-695
[3]   A Bayesian interpretation of the L-curve [J].
Antoni, Jerome ;
Idier, Jerome ;
Bourguignon, Sebastien .
INVERSE PROBLEMS, 2023, 39 (06)
[4]  
Bauschke H. H., 2019, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, V2nd
[5]   ON THE CONVERGENCE OF BLOCK COORDINATE DESCENT TYPE METHODS [J].
Beck, Amir ;
Tetruashvili, Luba .
SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (04) :2037-2060
[6]  
Bertsekas D. P., 1997, Journal of the Operational Research Society, V48, P334, DOI DOI 10.1057/PALGRAVE.JORS.2600425
[7]   Variance-stabilization-based compressive inversion under Poisson or Poisson-Gaussian noise with analytical bounds [J].
Bohra, Pakshal ;
Garg, Deepak ;
Gurumoorthy, Karthik S. ;
Rajwade, Ajit .
INVERSE PROBLEMS, 2019, 35 (10)
[8]   THE LOJASIEWICZ INEQUALITY FOR NONSMOOTH SUBANALYTIC FUNCTIONS WITH APPLICATIONS TO SUBGRADIENT DYNAMICAL SYSTEMS [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Lewis, Adrian .
SIAM JOURNAL ON OPTIMIZATION, 2007, 17 (04) :1205-1223
[9]   A block coordinate variable metric linesearch based proximal gradient method [J].
Bonettini, S. ;
Prato, M. ;
Rebegoldi, S. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 71 (01) :5-52
[10]   Sparse Poisson Noisy Image Deblurring [J].
Carlavan, Mikael ;
Blanc-Feraud, Laure .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (04) :1834-1846