Finding the best K-sparse approximation of a signal in redundant dictionary is an NP-hard problem. Suboptimal greedy matching pursuit (MP) algorithms are generally used for this task. In work, we present acceleration technique and implementation algorithm acting on multi-Gabor dictionary, i.e., concatenation several Gabor-type time-frequency dictionaries, each which consisting translations modu...

It is shown that Theorem 10 (Non-Nestedness of ERC) in [Plumbley, IEEE Trans. Info. Theory, vol. 53, pp. 3188, Sep. 2007] neglects the derivations of the exact recovery conditions (ERCs) of constrained �1-minimization (BP) and orthogonal matching pursuit (OMP). This means that it does not reflect the recovery properties of these algorithms. Furthermore, an ERC of BP more general than that in [T...

In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit algorithms such as subspace pursuit (SP), the proposed algorithm has a convex formulation and guarantees that the objective value can be monotonically decreased. Moreover, theoretical analysis and experimental results sho...