Improved sparse approximation over quasiincoherent dictionaries
نویسندگان
چکیده
This paper discusses a new greedy algorithm for solving the sparse approximation problem over quasi-incoherent dictionaries. These dictionaries consist of waveforms that are uncorrelated “on average,” and they provide a natural generalization of incoherent dictionaries. The algorithm provides strong guarantees on the quality of the approximations it produces, unlike most other methods for sparse approximation. Moreover, very efficient implementations are possible via approximate nearest-neighbor data structures.
منابع مشابه
Local orthogonal greedy pursuits for scalable sparse approximation of large signals with shift-invariant dictionaries
We propose a way to increase the speed of greedy pursuit algorithms for scalable sparse signal approximation. It is designed for dictionaries with localized atoms, such as timefrequency dictionaries. When applied to OMP, our modification leads to an approximation as good as OMP while keeping the computation time close to MP. Numerical experiments with a large audio signal show that, compared to...
متن کاملLearning Sparse Dictionaries for Sparse Signal Approximation
An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The structure is based on a sparsity model of the dictionary atoms over a base dictionary. The sparse dictionary provides efficient forward and adjoint operators, has a compact representation, and can be effectively trained from given example data. In this, the sparse structure bridges the...
متن کاملA New Method for Speech Enhancement Based on Incoherent Model Learning in Wavelet Transform Domain
Quality of speech signal significantly reduces in the presence of environmental noise signals and leads to the imperfect performance of hearing aid devices, automatic speech recognition systems, and mobile phones. In this paper, the single channel speech enhancement of the corrupted signals by the additive noise signals is considered. A dictionary-based algorithm is proposed to train the speech...
متن کاملSparse Approximation by Linear Programming: Measuring the Error with the `1 Norm
In this report we study the problem of sparse signal approximation over redundant dictionaries. We focus our attention on the minimization of a cost function where the error is measured using a `1 norm. We show a constructive equivalence between this minimization and Linear Programming. A recovery condition is then proved and finally we provide an example of the use of such a technique for deno...
متن کاملBases sorting: Generalizing the concept of frequency for over-complete dictionaries
We propose an algorithm, called Bases Sorting, to sort the bases of over-complete dictionaries used in sparse representation according to the magnitudes of coefficients when representing the training samples. Then the bases are considered to be ordered from low to high frequencies, thus generalizing the traditional concept of frequency for over-complete dictionaries. Applications are also shown.
متن کامل