Research reports

Tree approximation and optimal image coding with shearlets

by P. Grohs

(Report number 2010-45)

Abstract
It is by now classical that various anisotropic frame decompositions such as curvelets or shearlets guarantee (almost) optimal >i>N -term approximation rates for functions which are C^2 apart from a C 2 discontinuity curve. However, if no structure is present in the set of retained indices, the cost of transmitting the location of the indices might dominate the cost of transmitting the actual coefficients. Therefore, as far as bit rate coding is concerned, simply storing the N largest (curvelet- or shearlet-) coefficients possibly leads to non-optimal codes. In the wavelet case this issue can be resolved by requiring that the set of indices which are kept possesses a tree structure which can be encoded more efficiently. In the present work we show how an analogous procedure can be carried out for curvelets or shearlets. The main result is that the N -term approximation rate can be essentially retained while imposing the additional constraint that the set of indices is a tree.

Keywords: Shearlets, Curvelets, Tree Approximation, Optimal Encoding, Kolmogorov Entropy

BibTeX
@Techreport{G10_443,
  author = {P. Grohs},
  title = {Tree approximation and optimal image coding with shearlets },
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2010-45},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2010/2010-45.pdf },
  year = {2010}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser