Methods for performing fast discrete curvelet transforms of data
First Claim
1. A method for manipulating data in a data processor, comprising performing a discrete curvelet transform on the data.
3 Assignments
0 Petitions
Accused Products
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(n2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.
-
Citations
27 Claims
- 1. A method for manipulating data in a data processor, comprising performing a discrete curvelet transform on the data.
Specification