diff solvers/SMALL_cgp.m @ 128:8e660fd14774 ivand_dev

Feature 186

--- a/solvers/SMALL_cgp.m	Wed May 25 15:30:34 2011 +0100
+++ b/solvers/SMALL_cgp.m	Mon Jun 13 14:55:45 2011 +0100
@@ -1,5 +1,19 @@
 function [A, resF]=SMALL_cgp(Dict,X, m,  maxNumCoef, errorGoal, varargin) 
-%%% Conjugate Gradient Pursuit Multiple vectors sparse representation
+%%  Partial Conjugate Gradient Pursuit Multiple vectors sparse representation
+%   
+%   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
+%                  errorGoal - the maximal allowed representation error for
+%                  each signal.
+%
+%   optional:        if Dict is function handle then Transpose Dictionary
+%                  handle needs to be specified.
+%
+%   output arguments: A - sparse coefficient matrix.
+
 %
 %   Centre for Digital Music, Queen Mary, University of London.
 %   This file copyright 2009 Ivan Damnjanovic.
@@ -9,19 +23,6 @@
 %   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
-%                  errorGoal - the maximal allowed representation error for
-%                  each signal.
-%
-% optional:        if Dict is function handle then Transpose Dictionary
-%                  handle needs to be specified.
-%
-% output arguments: A - sparse coefficient matrix.
 %
 %%