comparison solvers/SMALL_cgp.m @ 3:01cad25206d6

(none)

-function [A]=SMALL_cgp(Dict,X, m,  maxNumCoef, errorGoal, varargin) 
+function [A, resF]=SMALL_cgp(Dict,X, m,  maxNumCoef, errorGoal, varargin) 
 %=============================================
 % 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

 	indx =[];
 	j=0;
    
 	
     currResNorm = residual'*residual/n;
-    errorGoal=errorGoal*currResNorm;
+    errGoal=errorGoal*currResNorm;
     a = zeros(m,1);
     p = zeros(m,1);
     
     while  j < maxNumCoef,
         

         p(indx)=dir(indx)+beta*p(indx);
         
         residual=residual-alfa*Dp;
     
 		currResNorm = residual'*residual/n;
-        if currResNorm<errorGoal
+        if currResNorm<errGoal
             fprintf('\nFound exact representation! \n');
             break;
         end
    end;
    if (~isempty(indx))
+       resF(k)=currResNorm;
        A(indx,k)=a(indx);
    end
 end;
 return;