# HG changeset patch
# User idamnjanovic
# Date 1277809531 0
# Node ID dc6aaa2558360d570840ad925b1ea465787fe37b
# Parent  a07585dff65c201d5e07459a218e17ebae76472d


diff -r a07585dff65c -r dc6aaa255836 examples/Pierre Villars/Pierre_Villars_Example.m
--- a/examples/Pierre Villars/Pierre_Villars_Example.m	Tue May 11 12:02:16 2010 +0000
+++ b/examples/Pierre Villars/Pierre_Villars_Example.m	Tue Jun 29 11:05:31 2010 +0000
@@ -11,10 +11,10 @@
 %   
 %   This example is based on the experiment suggested by Professor Pierre
 %   Vandergheynst on the SMALL meeting in Villars.
-%   The idea behind is to use patches from source image as a dictonary in
+%   The idea behind is to use patches from source image as a dictionary in
 %   which we represent target image using matching pursuit algorithm.
 %   Calling Pierre_Problem function to get src image to be used as dictionary
-%   and target image to be represented using MP with 3 paches from source image
+%   and target image to be represented using MP with 3 patches from source image
 %
 %%
 
@@ -49,15 +49,15 @@
     
     SMALL.Problem.reconstruct=@(x) Pierre_reconstruct(x, SMALL.Problem);
     
-    SMALL.solver(i)=SMALL_init_solver;
+   
     
     %   Defining the parameters sparse representation
-    
+    SMALL.solver(i)=SMALL_init_solver;
     SMALL.solver(i).toolbox='SMALL';
     SMALL.solver(i).name='SMALL_MP';
     
     %   Parameters needed for matching pursuit (max number of atoms is 3
-    %   and residual error goal is 1e14
+    %   and residual error goal is 1e-14
     
     SMALL.solver(i).param=sprintf('%d, 1e-14',3);