## Abstract

The Ridgelet Packets library provides a large family of orthonormal bases for functions f(x,y) in L ^{2} (dxdy) which includes orthonormal ridgelets as well as bases deriving from tilings reminiscent from the theory of wavelets and the study of oscillatory Fourier integrals. An intuitively appealing feature: many of these bases have elements whose envelope is strongly aligned along specified 'ridges' while displaying oscillatory components across the main 'ridge'. There are two approaches to constructing ridgelet packets; the most direct is a frequency-domain viewpoint. We take a recursive dyadic partition of the polar Fourier domain into a collection of rectangular tiles of various widths and lengths. Focusing attention on each tile in turn, we take a tensor basis, using windowed sinusoids in θ times windowed sinusoids in r. There is also a Radon-domain approach to constructing ridgelet packets, which involves applying the Radon isometry and then, in the Radon plane, using wavelets in θ times wavelet packets in t, with the scales of the wavelets in the two directions carefully related. We discuss digital implementations of the two continuum approaches, yielding many new frames for representation of digital images (i,j). These rely on two tools: the pseudopolar Fast Fourier Transform, and a pseudo Radon isometry called the normalized Slant Stack; these are described in Averbuch et al. (2001). In the Fourier approach, we mimic the continuum Fourier approach by partitioning the pseudopolar Fourier domain, building an orthonormal basis in the image space subordinate to each tile of the partition. On each rectangle of the partition, we use windowed sinusoids in θ times windowed sinusoids in r. In the Radon approach, we operate on the pseudo-Radon plane, and mimic the construction of orthonormal ridgelets, but with different scaling relationships between angular wavelets and ridge wavelets. Using wavelet packets in the ridge direction would also be possible. Because of the wide range of possible ridgelet packet frames, the question arises: what is the best frame for a given dataset? Because of the Cartesian format of our 2-D pseudopolar domain, it is possible to apply best-basis algorithms for best anisotropic cosine packets bases; this will rapidly search among all such frames for the best possible frame according to a sparsity criterion - compare N. Bennett's 1997 Yale Thesis. This automatically finds the best ridgelet packet frame for a given dataset.

Original language | English |
---|---|

Title of host publication | Studies in Computational Mathematics |

Publisher | Elsevier |

Pages | 31-60 |

Number of pages | 30 |

Edition | C |

DOIs | |

State | Published - 2003 |

### Publication series

Name | Studies in Computational Mathematics |
---|---|

Number | C |

Volume | 10 |

ISSN (Print) | 1570-579X |

### Bibliographical note

Funding Information:This research was supported by National Science Foundation grant DMS 95–05151, DMS 00–7726 and DMS 98–72890 (KDI), by AFOSR MURI 95–P49620–96–1–0028, and by DARPA BAA-99-07. The authors would like to thank Nick Bennett and Yacov Hel-Or for helpful discussions. AGF would like to thank the Statistics Department at UC Berkeley for its hospitality.

## ASJC Scopus subject areas

- Computational Mathematics