comparison examples/Automatic Music Transcription/SMALL_AMT_SPAMS_test.m @ 161:f42aa8bcb82f ivand_dev

debug and clean the SMALLbox Problems code
author Ivan Damnjanovic lnx <ivan.damnjanovic@eecs.qmul.ac.uk>
date Wed, 31 Aug 2011 12:02:19 +0100
parents 8e660fd14774
children 9c418bea7f6a
comparison
equal deleted inserted replaced
155:b14209313ba4 161:f42aa8bcb82f
31 31
32 32
33 % Defining Automatic Transcription of Piano tune as Dictionary Learning 33 % Defining Automatic Transcription of Piano tune as Dictionary Learning
34 % Problem 34 % Problem
35 35
36 SMALL.Problem = generateAMT_Learning_Problem(); 36 SMALL.Problem = generateAMTProblem();
37 TPmax=0; 37 TPmax=0;
38 %% 38 %%
39 for i=1:10 39 for i=1:10
40 %% 40 %%
41 % Solving AMT problem using non-negative sparse coding with 41 % Solving AMT problem using non-negative sparse coding with
75 % (backward compatiblity with SPARCO: solver structure communicate 75 % (backward compatiblity with SPARCO: solver structure communicate
76 % only with Problem structure, ie no direct communication between DL and 76 % only with Problem structure, ie no direct communication between DL and
77 % solver structures) 77 % solver structures)
78 78
79 SMALL.Problem.A = SMALL.DL(i).D; 79 SMALL.Problem.A = SMALL.DL(i).D;
80 SMALL.Problem.reconstruct=@(x) SMALL_midiGenerate(x, SMALL.Problem); 80 SMALL.Problem.reconstruct=@(x) AMT_reconstruct(x, SMALL.Problem);
81 81
82 82
83 %% 83 %%
84 % Initialising solver structure 84 % Initialising solver structure
85 % Setting solver structure fields (toolbox, name, param, solution, 85 % Setting solver structure fields (toolbox, name, param, solution,