DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Methods for performing fast discrete curvelet transforms of data

Abstract

Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n.sup.2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n.sup.3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.

Inventors:
 [1];  [2];  [3]
  1. Los Angeles, CA
  2. Setauket, NY
  3. Pasadena, CA
Issue Date:
Research Org.:
California Institute of Technology (CalTech), Pasadena, CA (United States); Stanford University (Palo Alto, CA)
Sponsoring Org.:
USDOE
OSTI Identifier:
1014730
Patent Number(s):
7840625
Application Number:
US Patent Application 11/400,048
Assignee:
California Institute of Technology (Pasadena, CA); Stanford University (Palo Alto, CA)
Patent Classifications (CPCs):
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
DOE Contract Number:  
FG02-02ER25529
Resource Type:
Patent
Country of Publication:
United States
Language:
English

Citation Formats

Candes, Emmanuel, Donoho, David, and Demanet, Laurent. Methods for performing fast discrete curvelet transforms of data. United States: N. p., 2010. Web.
Candes, Emmanuel, Donoho, David, & Demanet, Laurent. Methods for performing fast discrete curvelet transforms of data. United States.
Candes, Emmanuel, Donoho, David, and Demanet, Laurent. Tue . "Methods for performing fast discrete curvelet transforms of data". United States. https://www.osti.gov/servlets/purl/1014730.
@article{osti_1014730,
title = {Methods for performing fast discrete curvelet transforms of data},
author = {Candes, Emmanuel and Donoho, David and Demanet, Laurent},
abstractNote = {Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n.sup.2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n.sup.3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2010},
month = {11}
}

Works referenced in this record:

Contourlets
book, January 2003


Wavelets with composite dilations
journal, August 2004


The contourlet transform: an efficient directional multiresolution image representation
journal, December 2005


A Proposal for Toeplitz Matrix Calculations
journal, April 1986


A parametrix construction for wave equations with $C^{1,1}$ coefficients
journal, January 1998


Redundant Multiscale Transforms and Their Application for Morphological Component Separation
book, January 2004


Fast wavelet transforms and numerical algorithms I
journal, March 1991


Wave‐character preserving pre‐stack map migration using curvelets
conference, March 2012


Digital Implementation of Ridgelet Packets
book, January 2003


Directional dyadic wavelet transforms: design and algorithms
journal, April 2002


Shiftable multiscale transforms
journal, March 1992


Fast Fourier Transforms for Nonequispaced Data
journal, November 1993


On the Fast Fourier Transform of Functions with Singularities
journal, October 1995


Fast Fourier Transforms for Nonequispaced Data, II
journal, January 1995


Recovering edges in ill-posed inverse problems: optimality of curvelet frames
journal, June 2002


Conjugate Gradient Methods for Toeplitz Systems
journal, September 1996


Ridgelets: a key to higher-dimensional intermittency?
journal, September 1999

  • Candès, Emmanuel J.; Donoho, David L.
  • Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, Vol. 357, Issue 1760
  • https://doi.org/10.1098/rsta.1999.0444

New tight frames of curvelets and optimal representations of objects with piecewise C 2 singularities : Curvelets and Edges
journal, November 2003


Seismic denoising with nonuniformly sampled curvelets
journal, May 2006


Rapid Computation of the Discrete Fourier Transform
journal, July 1996


Wedgelets: nearly minimax estimation of edges
journal, June 1999


Beamlets and Multiscale Image Analysis
book, January 2002


Sparsity- and continuity-promoting seismic image recovery with curvelet frames
journal, March 2008


The curvelet representation of wave propagators is optimally sparse
journal, January 2005


Separation of primaries and multiples by non-linear estimation in the curvelet domain
text, January 2004


Wavelets with composite dilations and their MRA properties
journal, March 2006


Sparse geometric image representations with bandelets
journal, April 2005


Nonuniform fast Fourier transform
journal, March 1999


Harmonic Analysis of Neural Networks
journal, March 1999


Digital curvelet transform: strategy, implementation, and experiments
conference, April 2000


Contourlets: a directional multiresolution image representation
conference, January 2002


Sparse multidimensional representation using shearlets
conference, August 2005


Detection and discrimination of cosmological non-Gaussian signatures by multi-scale methods
journal, February 2004


The steerable pyramid: a flexible architecture for multi-scale derivative computation
conference, January 1995