comparison solvers/SMALL_MP.m @ 22:524cc3fff5ac

(none)

 function [A]=SMALL_MP(Dict,X, m, maxNumCoef, errorGoal, varargin) 
 %%
-%=============================================
+%
+%   Centre for Digital Music, Queen Mary, University of London.
+%   This file copyright 2009 Ivan Damnjanovic.
+%
+%   This program is free software; you can redistribute it and/or
+%   modify it under the terms of the GNU General Public License as
+%   published by the Free Software Foundation; either version 2 of the
+%   License, or (at your option) any later version.  See the file
+%   COPYING included with this distribution for more information.
+%   
 % Sparse coding of a group of signals based on a given 
 % dictionary and specified number of atoms to use. 
 %  input arguments: Dict - the dictionary
 %                   X - the signals to represent
 %                   m - number of atoms in Dictionary

 %                   each signal.
 %
 % optional:         if Dict is function handle then Transpose Dictionary
 %                   handle needs to be specified.
 %
-% based on KSVD toolbox solver found on Miki Elad webpage (finding inverse
-% with pinv() is changed with matching pursuit)
-% Ivan Damnjanovic 2009
-%=============================================
-%%
+
 %%
 % This Dictionary check is based on Thomas Blumensath work in sparsify 0_4 greedy solvers 
 explicitD=0;
 if     isa(Dict,'float')      
             D =@(z) Dict*z;