4.7 Article

Primal and Dual Bregman Methods with Application to Optical Nanoscopy

Journal

INTERNATIONAL JOURNAL OF COMPUTER VISION
Volume 92, Issue 2, Pages 211-229

Publisher

SPRINGER
DOI: 10.1007/s11263-010-0339-5

Keywords

Imaging; Poisson noise; Bregman distance; Inverse scale space; Duality; Error estimation; Image processing

Funding

  1. German Federal Ministry of Education and Research
  2. Deutsche Telekom Foundation
  3. German Science Foundation DFG

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available