Primal and Dual Bregman Methods with Application to Optical Nanoscopy

被引:54
|
作者
Brune, Christoph [1 ]
Sawatzky, Alex [1 ]
Burger, Martin [1 ]
机构
[1] Univ Munster, Inst Numer & Angew Math, D-48149 Munster, Germany
关键词
Imaging; Poisson noise; Bregman distance; Inverse scale space; Duality; Error estimation; Image processing; SCALE-SPACE METHODS; CONVERGENCE-RATES; TIKHONOV REGULARIZATION; VARIATIONAL APPROACH; NOISE; MINIMIZATION; ALGORITHM; MICROSCOPY; LIKELIHOOD; PARAMETER;
D O I
10.1007/s11263-010-0339-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Measurements in nanoscopic imaging suffer from blurring effects modeled with different point spread functions (PSF). Some apparatus even have PSFs that are locally dependent on phase shifts. Additionally, raw data are affected by Poisson noise resulting from laser sampling and "photon counts" in fluorescence microscopy. In these applications standard reconstruction methods (EM, filtered backprojection) deliver unsatisfactory and noisy results. Starting from a statistical modeling in terms of a MAP likelihood estimation we combine the iterative EM algorithm with total variation (TV) regularization techniques to make an efficient use of a-priori information. Typically, TV-based methods deliver reconstructed cartoon images suffering from contrast reduction. We propose extensions to EM-TV, based on Bregman iterations and primal and dual inverse scale space methods, in order to obtain improved imaging results by simultaneous contrast enhancement. Besides further generalizations of the primal and dual scale space methods in terms of general, convex variational regularization methods, we provide error estimates and convergence rates for exact and noisy data. We illustrate the performance of our techniques on synthetic and experimental biological data.
引用
收藏
页码:211 / 229
页数:19
相关论文
共 50 条
  • [41] Primal—Dual Constraint Aggregation with Application to Stochastic Programming
    M. Davidson
    Annals of Operations Research, 2000, 99 : 41 - 58
  • [42] Primal-dual methods for sustainable harvest scheduling problems
    Liu, CM
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (08) : 733 - 749
  • [43] Exploiting special structure in primal dual interior point methods
    Hurd, James K.
    Murphy, Frederic H.
    ORSA journal on computing, 1992, 4 (01): : 38 - 44
  • [44] Improved lattice enumeration algorithms by primal and dual reordering methods
    Yamamura, Kazuki
    Wang, Yuntao
    Fujisaki, Eiichiro
    IET INFORMATION SECURITY, 2023, 17 (01) : 35 - 45
  • [45] PCBDDC: A CLASS OF ROBUST DUAL-PRIMAL METHODS IN PETSc
    Zampini, Stefano
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (05): : S282 - S306
  • [46] Learning Safe Policies via Primal-Dual Methods
    Paternain, Santiago
    Calvo-Fullana, Miguel
    Chamon, Luiz F. O.
    Ribeiro, Alejandro
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 6491 - 6497
  • [47] COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION
    BERTSEKAS, DP
    SIAM JOURNAL ON CONTROL, 1975, 13 (03): : 521 - 544
  • [48] Primal convergence from dual subgradient methods for convex optimization
    Emil Gustavsson
    Michael Patriksson
    Ann-Brith Strömberg
    Mathematical Programming, 2015, 150 : 365 - 390
  • [49] Block Decomposition Methods for Total Variation by Primal–Dual Stitching
    Chang-Ock Lee
    Jong Ho Lee
    Hyenkyun Woo
    Sangwoon Yun
    Journal of Scientific Computing, 2016, 68 : 273 - 302
  • [50] Improved Lattice Enumeration Algorithms by Primal and Dual Reordering Methods
    Yamamura, Kazuki
    Wang, Yuntao
    Fujisaki, Eiichiro
    INFORMATION SECURITY AND CRYPTOLOGY, ICISC 2021, 2022, 13218 : 159 - 174