Computer Science Department

Computer Science Colloquium
bar

Sparse Geometrical Representations with Bandelets

Stephane Mallatt
Erwan Le Pennec

Monday, February 3, 2003
11:00 a.m.
Room 1302 WWH
251 Mercer Street
New York, NY 10012-1185

Host: Davi Geiger, geiger@cs.nyu.edu, 212-998-3235
Directions: http://cs.nyu.edu/csweb/Location/directions.html
Colloquium Information: http://cs.nyu.edu/csweb/Calendar/colloquium/index.html

Abstract

Finding sparse representations is at the core of signal processing for applications such as compression, estimation and inverse problems. For images, representations in wavelet bases are sub-optimal because they do not take advantage of existing geometrical regularities. Integrating geometry in harmonic analysis representations can potentially improve most image processing algorithms. After reviewing existing approaches, we introduce bandelet orthogonal bases whose vectors are adapted to follow the geometrical regularity of images. It is shown that the approximation error of piece-wise regular images in a bandelet basis has an optimal decay rate. This result is illustrated by applications to noise removal with thresholding estimators and to image compression.

bar
e-mail: webmaster@cs.nyu.edu