Skip to Main content Skip to Navigation
Conference papers

A Greedy Algorithm for a Sparse Scalet Decomposition

Abstract : Sparse decompositions were mainly developed to optimize the signal or the image compression. The sparsity was first obtained by a coefficient thresholding. The matching pursuit (MP) algorithms were implemented to extract the optimal patterns from a given dictionary. They carried out a new insight on the sparse representations. In this communication, this way is followed. It takes into account the goal to obtain a sparse multiscale decomposition with the different constraints: i/ to get a sparse representation with patterns looking like to Gaussian functions, ii/ to be able to decompose into patterns with only positive amplitudes, iii/ to get a representation from a translated and dilated pattern, iv/ to constrain the representation by a threshold, v/ to separate the sparse signal from a smooth baseline. Different greedy algorithms were built from the use of redundant wavelet transforms (pyramidal and `a trous ones), for 1D signals and 2D images. Experimentations on astronomical images allow one a gain of about two in sparsity compared to a classical DWT thresholding. A fine denoising is obtained. The results do not display any wavy artifacts. This decomposition is an efficient tool for astronomical image analysis.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Thursday, March 19, 2009 - 2:03:29 PM
Last modification on : Thursday, August 4, 2022 - 5:06:47 PM
Long-term archiving on: : Friday, October 12, 2012 - 1:50:08 PM


Files produced by the author(s)


  • HAL Id : inria-00369345, version 1



Albert Bijaoui. A Greedy Algorithm for a Sparse Scalet Decomposition. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369345⟩



Record views


Files downloads