Astronomical Image Representation by the Curvelet Transform

Total Page:16

File Type:pdf, Size:1020Kb

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. Continuing at this informal level of “Wavelet” in their abstract, and all astrophysical domains were discussion we will rely on an example to illustrate the funda- concerned, from the sun study to the CMB analysis. mental difference between the wavelet and ridgelet approaches This large success of the wavelet transform (WT) is due to –postponing the mathematical description of these new sys- the fact that astronomical data presents generally complex hi- tems. erarchical structures, often described as fractals. Using multi- Consider an image which contains a vertical band embed- scale approaches such as the wavelet transform (WT), an image ded in white noise with relatively large amplitude. Figure 1 (top can be decomposed into components at different scales, and the left) represents such an image. The parameters are as follows: WT is therefore well-adapted to astronomical data study. the pixel width of the band is 20 and the SNRis set to be 0.1. A series of recent papers (Cand`es & Donoho 1999d; Note that it is not possible to distinguish the band by eye. The Cand`es & Donoho 1999c), however, argued that wavelets and wavelet transform (undecimated wavelet transform) is also in- related classical multiresolution ideas are playing with a lim- capable of detecting the presence of this object; roughly speak- ited dictionary made up of roughly isotropic elements occur- ing, wavelet coefficients correspond to averages over approxi- ring at all scales and locations. We view as a limitation the mately isotropic neighborhoods (at different scales) and those facts that those dictionaries do not exhibit highly anisotropic wavelets clearly do not correlate very well with the very elon- elements and that there is only a fixed number of directional el- gated structure (pattern) of the object to be detected. ements, independent of scale. Despite the success of the classi- cal wavelet viewpoint, there are objects, e.g. images that do not We now turn our attention towards procedures of a very exhibit isotropic scaling and thus call for other kinds of multi- different nature which are based on line measurements. To be scale representation. In short, the theme of this line of research more specific, consider an ideal procedure which consists in is to show that classical multiresolution ideas only address a integrating the image intensity over columns; that is, along the portion of the whole range of interesting multiscale phenom- orientation of our object. We use the adjective “ideal” to em- ena and that there is an opportunity to develop a whole new phasize the important fact that this method of integration re- range of multiscale transforms. quires a priori knowledge about the structure of our object. This method of analysis gives of course an improved signal to noise Following on this theme, Cand`es & Donoho introduced ratio for our linear functional better correlate the object in ques- new multiscale systems like curvelets (Cand`es & Donoho tion, see the top right panel of Fig. 1. 1999c) and ridgelets (Cand`es 1999) which are very different This example will make our point. Unlike wavelet Send offprint requests to: J. L. Starck, e-mail: [email protected] transforms, the ridgelet transform processes data by first Article published by EDP Sciences and available at http://www.aanda.org or http://dx.doi.org/10.1051/0004-6361:20021571 786 J. L. Starck et al.: The curvelet transform Fig. 1. Top left, original image containing a vertical band embedded in white noise with relatively large amplitude. Top right, signal obtained by integrating the image intensity over columns. Bottom left, reconstructed image for the undecimated wavelet coefficient, bottom right, reconstructed image from the ridgelet coefficients. computing integrals over lines with all kinds of orientations and tion which is a solution of an optimization problem in this joint locations. We will explain in the next section how the ridgelet representation. transform further processes those line integrals. For now, we apply naive thresholding of the ridgelet coefficients and 2. The curvelet transform “invert” the ridgelet transform; the bottom right panel of Fig. 1 shows the reconstructed image. The qualitative difference with 2.1. The ridgelet transform the wavelet approach is striking. We observe that this method The two-dimensional continuous ridgelet transform in R2 can allows the detection of our object even in situations where the be defined as follows (Cand`es 1999). We pick a smooth uni- noise level (standard deviation of the white noise) is five times variate function ψ: R R with sufficient decay and satisfying superior to the object intensity. the admissibility condition→ The contrasting behavior between the ridgelet and the wavelet transforms will be one of the main themes of this pa- ψˆ(ξ) 2/ ξ 2 dξ< , (1) per which is organized as follows. We first briefly review some Z | | | | ∞ basic ideas about ridgelet and curvelet representations in the which holds if, say, ψ has a vanishing mean ψ(t)dt = continuum. In parallel to a previous article (Starck et al. 2002), 0. We will suppose a special normalizationR about ψ Sect. 2 rapidly outlines a possible implementation strategy. so that ∞ ψˆ(ξ) 2ξ 2dξ = 1. Sections 3 and 4 present respectively how to use the curvelet 0 | | − ForR each a > 0, each b R and each θ [0, 2π), we define transform for image denoising and and image enhancement. ∈ 2 ∈ the bivariate ridgelet ψa,b,θ: R R by We finally develop an approach which combines both the → 1/2 wavelet and curvelet transforms and search for a decomposi- ψa,b,θ(x) = a− ψ((x cos θ + x sin θ b)/a); (2) · 1 2 − J. L. Starck et al.: The curvelet transform 787 1 1 0.5 0.5 Z Z 0 0 -0.5 -0.5 6 4 4 2 4 2 6 0 4 2 0 Y 2 Y -2 0 X -2 0 -2 X -4 -4 -2 -4 -4 -6 -6 1 1 0.5 0.5 Z Z 0 0 -0.5 -0.5 6 6 4 4 2 6 2 6 4 0 0 2 24 Y Y -2 0 -2 0 X X -4 -2 -4 -2 -4 -4 -6 - -6 6 -6 Fig. 2. A few ridgelets. A ridgelet is constant along lines x1 cos θ + x2 sin θ = const. where δ is the Dirac distribution. Then the ridgelet transform Transverse to these ridges it is a wavelet. is precisely the application of a 1-dimensional wavelet trans- Figure 2 graphs a few ridgelets with different parameter val- form to the slices of the Radon transform where the angular ues. The top right, bottom left and right panels are obtained af- variable θ is constant and t is varying. ter simple geometric manipulations of the upper left ridgelet, This viewpoint strongly suggests developing approximate namely rotation, rescaling, and shifting. Radon transforms for digital data. This subject has received a Given an integrable bivariate function f (x), we define its considerable attention over the last decades as the Radon trans- ridgelet coefficients by form naturally appears as a fundamental tool in many fields of scientific investigation. Our implementation follows a widely f (a, b,θ) = ψ (x) f (x)dx. R Z a,b,θ used approach in the literature of medical imaging and is based We have the exact reconstruction formula on discrete fast Fourier transforms. The key component is to obtain approximate digital samples from the Fourier transform 2π da dθ f x ∞ ∞ a, b,θ ψ x b on a polar grid, i.e. along lines going through the origin in the ( ) = f ( ) a,b,θ( ) 3 d (3) Z0 Z Z0 R a 4π −∞ frequency plane. valid a.e. for functions which are both integrable and square integrable. Ridgelet analysis may be constructed as wavelet analysis in 2.2. An approximate digital ridgelet transform the Radon domain. Recall that the Radon transform of an ob- 2.2.1. Radon tranform ject f is the collection of line integrals indexed by (θ, t) ∈ [0, 2π) R given by A fast implementation of the RT can be performed in the × Fourier domain.
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]
  • 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.
    [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]
  • 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]