The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design of image representations, which trade off between efficiency and complexity, while achieving accurate rendering of smooth regions as well as reproducing faithful contours and textures. The most recent ones, proposed in the past decade, share an hybrid heritage highlighting the multiscale and oriented nature of edges and patterns in images. This paper presents a panorama of the aforementioned literature on decompositions in multiscale, multi-orientation bases or dictionaries. They typically exhibit redundancy to improve sparsity in the transformed domain and sometimes its invariance with respect to simple geometric deformations (translation, rotation). Oriented multiscale dictionaries extend traditional wavelet processing and may offer rotation invariance. Highly redundant dictionaries require specific algorithms to simplify the search for an efficient (sparse) representation. We also discuss the extension of multiscale geometric decompositions to non-Euclidean domains such as the sphere or arbitrary meshed surfaces. The etymology of panorama suggests an overview, based on a choice of partially overlapping “pictures”.

The Easy Path Wavelet Transform (EPWT) [19] has recently been proposed by one of the authors as a tool for sparse representations of bivariate functions from discrete data, in particular from image data. The EPWT is a locally adaptive wavelet transform. It works along pathways through the array of function values and it exploits the local correlations of the given data in a simple appropriate manner. In this paper, we show that the EPWT leads, for a suitable choice of the pathways, to optimal N-term approximations for piecewise Hölder continuous functions with singularities along curves.

Preprint 10The consecutive numbering of the publications is determined by their chronological order. The aim of this preprint series is to make new research rapidly available for scientific discussion. Therefore, the responsibility for the contents is solely due to the authors. The publications will be distributed by the authors. Minimization of non-smooth, non-convex functionals by iterative thresholding

In order to get an efficient image representation we introduce a new adaptive Haar wavelet transform, called Tetrolet Transform. Tetrolets are Haar-type wavelets whose supports are tetrominoes which are shapes made by connecting four equal-sized squares. The corresponding filter bank algorithm is simple but enormously effective. Numerical results show the strong efficiency of the tetrolet transform for image compression. 1.

Preprint 11The consecutive numbering of the publications is determined by their chronological order. The aim of this preprint series is to make new research rapidly available for scientific discussion. Therefore, the responsibility for the contents is solely due to the authors. The publications will be distributed by the authors. Regularization with non-convex separable constraints

The Easy Path Wavelet Transform (EPWT) has recently been proposed by one of the authors as a tool for sparse representations of bivariate functions from discrete data, in particular from image data. The EPWT is a locally adaptive wavelet transform. It works along pathways through the array of function values and exploits the local correlations of the given data in a simple appropriate manner. However, the EPWT suffers from its adaptivity costs that arise from the storage of path vectors. In this paper, we propose a new hybrid method for image compression that exploits the advantages of the usual tensor product wavelet transform for the representation of smooth images and uses the EPWT for an efficient representation of edges and texture. Numerical results show the efficiency of this procedure. Key words. sparse data representation, tensor product wavelet transform, easy path wavelet transform, linear diffusion, smoothing filters, adaptive wavelet bases, N-term approximation AMS Subject classifications. 41A25, 42C40, 68U10, 94A08 1

A new sparse representation of seismic data using adaptive

In this paper we consider the Easy Path Wavelet Transform (EPWT) on spherical triangulations. The EPWT has been introduced in [7] in order to obtain sparse image representations. It is a locally adaptive transform that works along pathways through the array of function values and exploits the local correlations of the data in a simple appropriate manner. In our approach the usual one-dimensional discrete wavelet transform (DWT), orthogonal or biorthogonal, can be applied. 1.

In this paper we introduce a new construction of nonlinear locally adaptive wavelet filter banks by connecting the lifting scheme with the idea of image smoothing by nonlinear diffusion methods. 1.

In order to get an efficient image representation we introduce a new adaptive Haar wavelet transform, called Tetrolet Transform. Tetrolets are Haar-type wavelets whose supports are tetrominoes which are shapes made by connecting four equal-sized squares. The corresponding fast filter bank algorithm is simple but very effective. In every level of the filter bank algorithm we divide the low-pass image into 4 × 4 blocks. Then in each block we determine a local tetrolet basis which is adapted to the image geometry in this block. An analysis of the adaptivity costs leads to modified versions of our method. Numerical results show the strong efficiency of the tetrolet transform for image approximation. Key words: adpative wavelet transform, directional wavelets, Haar-type wavelets, locally orthonormal wavelet basis, tetromino tiling, image approximation, data compression, sparse representation 2000 MSC: 65T60, 42C40, 68U10, 94A08 1.