Mercurial > hg > smallbox
diff solvers/SMALL_MP.m @ 128:8e660fd14774 ivand_dev
Feature 186
author | Ivan Damnjanovic lnx <ivan.damnjanovic@eecs.qmul.ac.uk> |
---|---|
date | Mon, 13 Jun 2011 14:55:45 +0100 |
parents | 524cc3fff5ac |
children |
line wrap: on
line diff
--- a/solvers/SMALL_MP.m Wed May 25 15:30:34 2011 +0100 +++ b/solvers/SMALL_MP.m Mon Jun 13 14:55:45 2011 +0100 @@ -1,5 +1,17 @@ function [A]=SMALL_MP(Dict,X, m, maxNumCoef, errorGoal, varargin) -%% +%% Implementation of Matching Pursuit algorithm +% 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. +% + % % Centre for Digital Music, Queen Mary, University of London. % This file copyright 2009 Ivan Damnjanovic. @@ -10,18 +22,6 @@ % 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. -% - %% % This Dictionary check is based on Thomas Blumensath work in sparsify 0_4 greedy solvers explicitD=0;