Poisson Noise Reduction with Non-Local PCA

Total Page:16

File Type:pdf, Size:1020Kb

Poisson Noise Reduction with Non-Local PCA Noname manuscript No. (will be inserted by the editor) Poisson noise reduction with non-local PCA Joseph Salmon · Zachary Harmany · Charles-Alban Deledalle · Rebecca Willett Received: date / Accepted: date Abstract Photon-limited imaging arises when the ing methods. The results reveal that, despite its concep- number of photons collected by a sensor array is small tual simplicity, Poisson PCA-based denoising appears relative to the number of detector elements. Photon to be highly competitive in very low light regimes. limitations are an important concern for many appli- Keywords Image denoising · PCA · Gradient cations such as spectral imaging, night vision, nuclear methods · Newton's method · Signal representations medicine, and astronomy. Typically a Poisson distri- bution is used to model these observations, and the inherent heteroscedasticity of the data combined with 1 Introduction, model, and notation standard noise removal methods yields significant arti- facts. This paper introduces a novel denoising algorithm In a broad range of imaging applications, observations for photon-limited images which combines elements of correspond to counts of photons hitting a detector ar- dictionary learning and sparse patch-based representa- ray, and these counts can be very small. For instance, in tions of images. The method employs both an adapta- night vision, infrared, and certain astronomical imaging tion of Principal Component Analysis (PCA) for Pois- systems, there is a limited amount of available light. son noise and recently developed sparsity-regularized Photon limitations can even arise in well-lit environ- convex optimization algorithms for photon-limited im- ments when using a spectral imager which character- ages. A comprehensive empirical evaluation of the pro- izes the wavelength of each received photon. The spec- posed method helps characterize the performance of tral imager produces a three-dimensional data cube, this approach relative to other state-of-the-art denois- where each voxel in this cube represents the light in- tensity at a corresponding spatial location and wave- Joseph Salmon length. As the spectral resolution of these systems Department LTCI, CNRS UMR 5141, Telecom Paristech increases, the number of available photons for each Paris, France E-mail: [email protected] spectral band decreases. Photon-limited imaging algo- arXiv:1206.0338v4 [cs.CV] 28 Apr 2014 rithms are designed to estimate the underlying spa- Zachary Harmany Department of Electrical and Computer Engineering tial or spatio-spectral intensity underlying the observed University of Wisconsin-Madison photon counts. Madison, Wisconsin, USA There exists a rich literature on image estimation E-mail: [email protected] or denoising methods, and a wide variety of effective Rebecca Willett tools. The photon-limited image estimation problem is Department of Electrical and Computer Engineering particularly challenging because the limited number of Duke University Durham, NC, USA. available photons introduces intensity-dependent Pois- E-mail: [email protected] son statistics which require specialized algorithms and Charles-Alban Deledalle analysis for optimal performance. Challenges associated IMB, CNRS-Universit´eBordeaux 1 with low photon count data are often circumvented Talence, France in hardware by designing systems which aggregate E-mail: [email protected] photons into fixed bins across space and wavelength 2 Joseph Salmon et al. (i.e., creating low-resolution cameras). If the bins are of the exponential family, and propose an optimiza- large enough, the resulting low spatial and spectral tion formulation for matrix factorization. Section 3 pro- resolution cannot be overcome. High-resolution obser- vides an algorithm to iteratively compute the solution vations, in contrast, exhibit significant non-Gaussian of our minimization problem. In Section 5, an impor- noise since each pixel is generally either one or zero tant clustering step is introduced both to improve the (corresponding to whether or not a photon is counted performance and the computational complexity of our by the detector), and conventional algorithms which ne- algorithm. Algorithmic details and experiments are re- glect the effects of photon noise will fail. Simply trans- ported in Section 6 and 7, and we conclude in Section forming Poisson data to produce data with approximate 8. Gaussian noise (via, for instance, the variance stabiliz- ing Anscombe transform [2,31] or Fisz transform [17, 18]) can be effective when the number photon counts 1.2 Problem formulation are uniformly high [5,46]. However, when photon counts are very low these approaches may suffer, as shown later For an integer M > 0, the set f1; : : :; Mg is denoted in this paper. 1;M . For i 2 1;M , let yi be the observed pixel val- J K J K This paper demonstrates how advances in low- ues obtained through an image acquisition device. We dimensional modeling and sparse Poisson intensity re- consider each yi to be an independent random Poisson construction algorithms can lead to significant gains in variable whose mean fi ≥ 0 is the underlying intensity photon-limited (spectral) image accuracy at the reso- value to be estimated. Explicitly, the discrete Poisson lution limit. The proposed method combines Poisson probability of each yi is Principal Component Analysis (Poisson-PCA { a spe- f yi cial case of the Exponential-PCA [10,40]) and sparse (y jf ) = i e−fi ; (1) P i i y ! Poisson intensity estimation methods [20] in a non-local i estimation framework. We detail the targeted opti- where 0! is understood to be 1 and 00 to be 1. mization problem which incorporates the heteroscedas- A crucial property of natural images is their ability tic nature of the observations and present results im- to be accurately represented using a concatenation of proving upon state-of-the-art methods when the noise patches, each of which is a simple linear combination of level is particularly high. We coin our method Pois- a small number of representative atoms. One interpre- son Non-Local Principal Component Analysis (Poisson tation of this property is that the patch representation NLPCA). exploits self-similarity present in many images, as de- Since the introduction of non-local methods for im- scribed in AWGN settings [11,30,12].p Let Ypdenote the age denoising [8], these methods have proved to out- M × N matrix of all the vectorized N × N overlap- perform previously considered approaches [1,11,30,12] ping patches (neglecting border issues) extracted from (extensive comparisons of recent denoising method can the noisy image, and let F be defined similarly for the be found for Gaussian noise in [21,26]). Our work is in- true underlying intensity. Thus Yi;j is the jth pixel in spired by recent methods combining PCA with patch- the ith patch. based approaches [33,47,15] for the Additive White Many methods have been proposed to represent the Gaussian Noise (AWGN) model, with natural exten- collection of patches in a low dimensional space in the sions to spectral imaging [13]. A major difference be- same spirit as PCA. We use the framework considered tween these approaches and our method is that we di- in [10,40], that deals with data well-approximated by rectly handle the Poisson structure of the noise, without random variables drawn from exponential family distri- any \Gaussianization" of the data. Since our method butions. In particular, we use Poisson-PCA, which we does not use a quadratic data fidelity term, the singu- briefly introduce here before giving more details in the lar value decomposition (SVD) cannot be used to solve next section. With Poisson-PCA, one aims to approxi- the minimization. Our direct approach is particularly mate F by: relevant when the image suffers from a high noise level (i.e., low photon emissions). Fi;j ≈ exp([UV ]i;j) 8(i; j) 2 1;M × 1;N ; (2) J K J K where 1.1 Organization of the paper { U is the M × ` matrix of coefficients; { V is the ` × N matrix representing the dictionary In Section 1.2, we describe the mathematical frame- components or axis. The rows of V represents the work. In Section 2, we recall relevant basic properties dictionary elements; and Poisson noise reduction with non-local PCA 3 { exp(UV ) is the element-wise exponentiation of UV : The parameter θ 2 Θ is called the natural parameter exp [UV ]i;j := exp(UV ) i;j. of P(φ), and the set Θ is called the natural parameter space. The function Φ is called the log partition func- The approximation in (2) is different than the approxi- tion. We denote by [·] the expectation w.r.t. p : mation model used in similar methods based on AWGN, Eθ θ where typically one assumes Fi;j ≈ [UV ]i;j (that is, Z Eθ[g(X)] = g(y) (exp(hθjφ(y)i) − Φ(θ)) dν(y): without exponentiation). Our exponential model allows X us to circumvent challenging issues related to the non- negativity of F and thus facilitates significantly faster Example 1 Assume the data are independent (not nec- algorithms. essarily identically distributed) Gaussian random vari- 2 The goal is to compute an estimate of the form (2) ables with means µi and (known) variances σ . Then n from the noisy patches Y . We assume that this approx- the parameters are: 8y 2 R ; φ(y) = y, Φ(θ) = Pn 2 2 2 2 imation is accurate for ` M, whereby restricting the i=1 θi =2σ and rΦ(θ) = (θ1/σ ; ··· ; θn/σ ) and ν is n rank ` acts to regularize the solution. In the following the Lebesgue measure on R (cf. [34] for more details on section we elaborate on this low-dimensional represen- the Gaussian distribution, possibly with non-diagonal tation. covariance matrix). Example 2 For Poisson distributed data (not necessar- 2 Exponential family and matrix factorization ily identically distributed), the parameters are the fol- n lowing: 8y 2 R ; φ(y) = y, and Φ(θ) = hexp(θ)j1ni = Pn θi We present here the general case of matrix factorization i=1 e , where exp is the component-wise exponential for an exponential family, though in practice we only function: use this framework for the Poisson and Gaussian cases.
Recommended publications
  • Handbook of Astronomical Data Analysis
    Jean-Luc Starck and Fionn Murtagh Handbook of Astronomical Data Analysis Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo Hong Kong Barcelona Budapest Table of Contents Contents................................................... i Preface ................................................... .... vii 1. Introduction to Applications and Methods ................ 1 1.1 Introduction ....................................... .... 1 1.2 Transformation and Data Representation . 4 1.2.1 Fourier Analysis.................................. 5 1.2.2 Time-Frequency Representation . 6 1.2.3 Time-Scale Representation: The Wavelet Transform . 8 1.2.4 TheRadonTransform ............................ 12 1.3 Mathematical Morphology . 12 1.4 EdgeDetection....................................... 15 1.4.1 First Order Derivative Edge Detection . 16 1.4.2 Second Order Derivative Edge Detection . 19 1.5 Segmentation ....................................... 20 1.6 PatternRecognition .................................. 21 1.7 Chapter Summary . 25 2. Filtering .................................................. 27 2.1 Introduction ....................................... 27 2.2 Multiscale Transforms............................... 29 2.2.1 The A Trous Isotropic Wavelet Transform . 29 2.2.2 Multiscale Transforms Compared to Other Data Trans- forms ........................................... 30 2.2.3 Choice of Multiscale Transform . 33 2.2.4 The Multiresolution Support . 34 2.3 Significant Wavelet Coefficients . 36 2.3.1 Definition ......................................
    [Show full text]
  • Likelihood Ratio Haar Variance Stabilization and Normalization for Poisson and Other Non-Gaussian Noise Removal
    Likelihood ratio Haar variance stabilization and normalization for Poisson and other non-Gaussian noise removal Piotr Fryzlewicz∗ November 5, 2018 Abstract We propose a new methodology for denoising, variance-stabilizing and normalizing signals whose both mean and variance are parameterized by a single unknown varying parameter, such as Poisson or scaled chi-squared. Key to our methodology is the ob- servation that the signed and square-rooted generalized log-likelihood ratio test for the equality of the local means is approximately and asymptotically distributed as standard normal under the null. We use these test statistics within the Haar wavelet transform at each scale and location, referring to them as the likelihood ratio Haar (LRH) co- efficients of the data. In the denoising algorithm, the LRH coefficients are used as thresholding decision statistics, which enables the use of thresholds suitable for i.i.d. Gaussian noise, despite the standard Haar coefficients of the signal being heteroscedas- tic. In the variance-stabilizing and normalizing algorithm, the LRH coefficients replace the standard Haar coefficients in the Haar basis expansion. To the best of our knowl- edge, the variance-stabilizing and normalizing properties of the generalized likelihood ratio test have not been interpreted or exploited in this manner before. We prove the consistency of our LRH smoother for Poisson counts with a near-parametric rate, and various numerical experiments demonstrate the good practical performance of our methodology. Key words: variance-stabilizing
    [Show full text]
  • Variance Stabilizing Transformations in the Reduction of Poisson Noise in 3D Nuclear Medicine Images
    Variance Stabilizing Transformations in the Reduction of Poisson Noise in 3D Nuclear Medicine Images Edward Flórez Pacheco, Sergio Shiguemi Furuie School of Engineering, University of São Paulo, Brazil Abstract anatomical alterations [1; 2]. Thus, the role of the Nuclear Medicine is currently Nuclear medicine (NM) is a modality of medical diagnostic, prognostic and control, with a very significant imaging that uses radioactive materials to provide potential for therapeutic aspects in an attempt to cure information about the functioning of a person's specific diseases and some forms of cancer by radiotherapy [3]. organs. However, the NM images are characterized by Due to the lack of computational tools and techniques presenting poor signal to noise ratio, related to low to assess and study the dynamics of processes from counts and to Poisson noise because of the stochastic images of Nuclear Medicine is intended to contribute nature of the attenuation processes (absorption and with new perspectives, new approaches and tools to scattering). These kinds of images depict regions with assist, facilitate and improve the work of specialists. high counting photons that are created by a group of cells that have a faster metabolism indicating physiological 2. Methods changes. This phenomenon could suggest the presence of a malignant neoplasia (tumor). Hence, before applying Our work is constituted by a sequence of interrelated any technique for determining metabolic rates, first it is modules and steps which were implemented as part of the necessary to define the region of interest (ROI). For this study. The steps will be detailed below: purpose, segmentation techniques were used based on the Fuzzy Connectedness theory.
    [Show full text]
  • Patch-Based Non-Local Functional for Denoising Fluorescence Microscopy
    1 Patch-based non-local functional for denoising fluorescence microscopy image sequences Jérôme Boulanger, Charles Kervrann, Patrick Bouthemy, Peter Elbau, Jean-Baptiste Sibarita, Jean Salamero Abstract—We present a non-parametric regression quence denoising, patch-based approach, Poisson noise, method for denoising 3D image sequences acquired via variance stabilization, adaptive estimation, energy mini- fluorescence microscopy. The proposed method exploits mization. the redundancy of the 3D+time information to improve the signal-to-noise ratio of images corrupted by Poisson- Gaussian noise. A variance stabilization transform is first I. INTRODUCTION applied to the image-data to remove the dependence be- tween the mean and variance of intensity values. This pre- LUORESCENCE video-microscopy is an investiga- processing requires the knowledge of parameters related F tion tool used in biology for dynamics analysis at to the acquisition system, also estimated in our approach. sub-cellular levels. Combined with fluorescent tags such In a second step, we propose an original statistical patch- as genetically engineered fluorescent chimeric proteins based framework for noise reduction and preservation of (e.g. Green Fluorescence Protein GFP), both confocal space-time discontinuities. In our study, discontinuities are microscopy and wide-field microscopy allow 3D live related to small moving spots with high velocity observed protein imaging. Mainly used to analyze isolated cells, in fluorescence video-microscopy. The idea is to minimize confocal microscopy can also be used in vivo if com- an objective non-local energy functional involving spatio- bined with endomicroscopy. Unfortunately, when cell temporal image patches. The minimizer has a simple form and is defined as the weighted average of input data viability needs to be preserved and photo-bleaching taken in spatially-varying neighborhoods.
    [Show full text]
  • A REWEIGHTED L2 METHOD for IMAGE RESTORATION WITH
    Inverse Problems and Imaging doi:10.3934/ipi.xx.xx.xx Volume X, No. 0X, 20xx, X{XX A REWEIGHTED `2 METHOD FOR IMAGE RESTORATION WITH POISSON AND MIXED POISSON-GAUSSIAN NOISE JIA LI AND ZUOWEI SHEN AND RUJIE YIN AND XIAOQUN ZHANG Jia Li Department of mathematics, National University of Singapore Block S17, 10 Lower Kent Ridge Road Singapore 119076 Zuowei Shen Department of mathematics, National University of Singapore Block S17, 10 Lower Kent Ridge Road Singapore, 119076 Rujie Yin Zhiyuan College, Shanghai Jiao Tong University 800, Dongchuan Road Shanghai, China, 200240 Xiaoqun Zhang Department of Mathematics, MOE-LSC and Institute of Natural Sciences Shanghai Jiao Tong University 800, Dongchuan Road Shanghai, China, 200240 (Communicated by the associate editor name) Abstract. We study weighted `2 fidelity in variational models for Poisson noise related image restoration problems. Gaussian approximation to Poisson noise statistic is adopted to deduce weighted `2 fidelity. Different from the tra- ditional weighted `2 approximation, we propose a reweighted `2 fidelity with sparse regularization by wavelet frame. Based on the split Bregman algorithm introduced in [22], the proposed numerical scheme is composed of three easy subproblems that involve quadratic minimization, soft shrinkage and matrix vector multiplications. Unlike usual least square approximation of Poisson noise, we dynamically update the underlying noise variance from previous es- timate. The solution of the proposed algorithm is shown to be the same as the one obtained by minimizing Kullback-Leibler divergence fidelity with the same regularization. This reweighted `2 formulation can be easily extended to mixed Poisson-Gaussian noise case. Finally, the efficiency and quality of the proposed algorithm compared to other Poisson noise removal methods are demonstrated through denoising and deblurring examples.
    [Show full text]
  • Astronomical Image Representation by the Curvelet Transform
    A&A 398, 785–800 (2003) Astronomy DOI: 10.1051/0004-6361:20021571 & c ESO 2003 Astrophysics Astronomical image representation by the curvelet transform J. L. Starck1, D. L. Donoho2, and E. J. Cand`es3 1 DAPNIA/SEDI-SAP, Service d’Astrophysique, CEA-Saclay, 91191 Gif-sur-Yvette Cedex, France 2 Department of Statistics, Stanford University, Sequoia Hall, Stanford, CA 94305, USA 3 Department of Applied Mathematics, Mail Code 217-50, California Institute of Technology, Pasadena, CA 91125, USA Received 12 April 2002 / Accepted 29 October 2002 Abstract. We outline digital implementations of two newly developed multiscale representation systems, namely, the ridgelet and curvelet transforms. We apply these digital transforms to the problem of restoring an image from noisy data and com- pare our results with those obtained via well established methods based on the thresholding of wavelet coefficients. We show that the curvelet transform allows us also to well enhance elongated features contained in the data. Finally, we describe the Morphological Component Analysis, which consists in separating features in an image which do not present the same morpho- logical characteristics. A range of examples illustrates the results. Key words. methods: data analysis – techniques: image processing 1. Introduction from wavelet-like systems. Curvelets and ridgelets take the the form of basis elements which exhibit very high directional The wavelet transform has been extensively used in astronom- sensitivity and are highly anisotropic. In two-dimensions, for ical data analysis during the last ten years. A quick search instance, curvelets are localized along curves, in three dimen- with ADS shows that around 600 papers contain the keyword sions along sheets, etc.
    [Show full text]
  • Stabilizing Heteroscedastic Noise with the Generalized Anscombe Transform
    STABILIZING HETEROSCEDASTIC NOISE WITH THE GENERALIZED ANSCOMBE TRANSFORM. APPLICATION TO ACCURATE PREDICTION OF THE RESOLUTION IN DISPLACEMENT AND STRAIN MAPS OBTAINED WITH THE GRID METHOD M. Grédiac1, F. Sur2 1Clermont Université, Université Blaise Pascal, Institut Pascal, UMR CNRS 6602 BP 10448, 63000 Clermont-Ferrand, France 2Laboratoire Lorrain de Recherche en Informatique et ses Applications, UMR CNRS 7503 Université de Lorraine, CNRS, INRIA projet Magrit, Campus Scientifique, BP 239 54506 Vandoeuvre-lès-Nancy Cedex, France ABSTRACT The objective of this paper is to show that it is possible to predict the noise level in displacement and strain maps obtained with the grid method, but that actual noise of camera sensors being heteroscedastic, it is necessary to stabilize this noise in grid images prior to employing the predicting formulas. The procedure used for this purpose relies on the Generalized Anscombe Transform. This transform is first described. It is then shown that experimental and theoretical resolutions in strain maps obtained with the grid method are in good agreement when this transform is employed. Keywords: displacement, Generalized Anscombe Transform, grid method, noise, strain measurement, metrological performance INTRODUCTION Assessing the metrological performance of full-field measurement techniques is a key-issue in experimental mechanics. In this context, this paper deals with the a priori determination of the resolution in displacement and strain maps obtained with the grid method, the spatial resolution being fixed by the grid image processing procedure. Two points are addressed more specifically: 1- closed-form formulas which provide the link between resolution, spatial resolution and standard deviation of sensor noise in grid images taken by a camera are given and discussed.
    [Show full text]
  • Likelihood Ratio Haar Variance Stabilization and Normalization for Poisson and Other Non-Gaussian Noise Removal
    Likelihood ratio Haar variance stabilization and normalization for Poisson and other non-Gaussian noise removal Piotr Fryzlewicz∗ January 19, 2017 Abstract We propose a new methodology for denoising, variance-stabilizing and normalizing signals whose both mean and variance are parameterized by a single unknown varying parameter, such as Poisson or scaled chi-squared. Key to our methodology is the ob- servation that the signed and square-rooted generalized log-likelihood ratio test for the equality of the local means is approximately and asymptotically distributed as standard normal under the null. We use these test statistics within the Haar wavelet transform at each scale and location, referring to them as the likelihood ratio Haar (LRH) co- efficients of the data. In the denoising algorithm, the LRH coefficients are used as thresholding decision statistics, which enables the use of thresholds suitable for i.i.d. Gaussian noise, despite the standard Haar coefficients of the signal being heteroscedas- tic. In the variance-stabilizing and normalizing algorithm, the LRH coefficients replace the standard Haar coefficients in the Haar basis expansion. To the best of our knowl- edge, the variance-stabilizing and normalizing properties of the generalized likelihood ratio test have not been interpreted or exploited in this manner before. We prove the consistency of our LRH smoother for Poisson counts with a near-parametric rate, and various numerical experiments demonstrate the good practical performance of our methodology. Key words: variance-stabilizing transform, Haar-Fisz, Anscombe transform, log trans- form, Box-Cox transform, Gaussianization. 1 Introduction Wavelets have become an established tool in data science and were recently used in tasks as diverse as seizure detection and epilepsy diagnosis (Faust et al., 2015), reconstruction of compressively sensed magnetic resonance images (Zhang et al., 2015), identification of protein-protein binding sites (Jia et al., 2016), wind power forecast (Chitsaz et al., 2015), and digital image watermarking (Agoyi et al., 2015).
    [Show full text]
  • Image Denoising in Mixed Poisson–Gaussian Noise Florian Luisier, Member, IEEE, Thierry Blu, Senior Member, IEEE, and Michael Unser, Fellow, IEEE
    696 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 3, MARCH 2011 Image Denoising in Mixed Poisson–Gaussian Noise Florian Luisier, Member, IEEE, Thierry Blu, Senior Member, IEEE, and Michael Unser, Fellow, IEEE Abstract—We propose a general methodology (PURE-LET) to reasonable to model the output of the detectors as a Poisson-dis- design and optimize a wide class of transform-domain thresh- tributed random vector. The problem is then to estimate the olding algorithms for denoising images corrupted by mixed underlying intensities of Poisson random variables, potentially Poisson–Gaussian noise. We express the denoising process as a linear expansion of thresholds (LET) that we optimize by relying further degraded by independent AWGN. In this paper, we pro- on a purely data-adaptive unbiased estimate of the mean-squared pose fast and high-quality nonlinear algorithms for denoising error (MSE), derived in a non-Bayesian framework (PURE: digital images corrupted by mixed Poisson-Gaussian noise. Poisson–Gaussian unbiased risk estimate). We provide a practical Among various image-denoising strategies, the trans- approximation of this theoretical MSE estimate for the tractable form-domain approaches in general, and in particular the optimization of arbitrary transform-domain thresholding. We then propose a pointwise estimator for undecimated filterbank multiscale ones, are very efficient for AWGN reduction (e.g., transforms, which consists of subband-adaptive thresholding [1]–[3]). As many natural images can be represented by few functions with signal-dependent thresholds that are globally opti- significant coefficients in a suitable basis/frame, the associated mized in the image domain. We finally demonstrate the potential transform-domain processing amounts to a (possibly multi- of the proposed approach through extensive comparisons with variate) thresholding of the transformed coefficients, which state-of-the-art techniques that are specifically tailored to the estimation of Poisson intensities.
    [Show full text]