-
Notifications
You must be signed in to change notification settings - Fork 8
/
getK_backprop.m
141 lines (119 loc) · 4.47 KB
/
getK_backprop.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
% Copyright ©2013. The Regents of the University of California (Regents).
% All Rights Reserved. Permission to use, copy, modify, and distribute
% this software and its documentation for educational, research, and
% not-for-profit purposes, without fee and without a signed licensing
% agreement, is hereby granted, provided that the above copyright notice,
% this paragraph and the following two paragraphs appear in all copies,
% modifications, and distributions. Contact The Office of Technology
% Licensing, UC Berkeley, 2150 Shattuck Avenue, Suite 510, Berkeley, CA
% 94720-1620, (510) 643-7201, for commercial licensing opportunities.
%
% Created by Jonathan T Barron and Jitendra Malik, Electrical Engineering
% and Computer Science, University of California, Berkeley.
%
% IN NO EVENT SHALL REGENTS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT,
% SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS,
% ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF
% REGENTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
%
% REGENTS SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT
% LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
% PARTICULAR PURPOSE. THE SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY,
% PROVIDED HEREUNDER IS PROVIDED "AS IS". REGENTS HAS NO OBLIGATION TO
% PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
function d_loss_Z = getK_backprop(d_loss_K, dKZ, tap)
getK_filters;
% d_loss_K = d_loss_K(2:end-1, 2:end-1);
d_loss_K = d_loss_K ./ dKZ.denom;
% d_loss_Z = ...
% conv3d(d_loss_K .* dKZ.f1, f1m) + ...
% conv3d(d_loss_K .* dKZ.f2, f2m) + ...
% conv3d(d_loss_K .* dKZ.f11, f11m) + ...
% conv3d(d_loss_K .* dKZ.f22, f22m) + ...
% conv3d(d_loss_K .* dKZ.f12, f12m);
d_loss_Z = unpad1( ...
conv2(d_loss_K .* dKZ.f1, f1m, 'full') + ...
conv2(d_loss_K .* dKZ.f2, f2m, 'full') + ...
conv2(d_loss_K .* dKZ.f11, f11m, 'full') + ...
conv2(d_loss_K .* dKZ.f22, f22m, 'full') + ...
conv2(d_loss_K .* dKZ.f12, f12m, 'full') );
%
% M = conv2(d_loss_K .* dKZ.f1, f1m, 'full');
% M = M + conv2(d_loss_K .* dKZ.f2, f2m, 'full');
% M = M + conv2(d_loss_K .* dKZ.f11, f11m, 'full');
% M = M + conv2(d_loss_K .* dKZ.f22, f22m, 'full');
% M = M + conv2(d_loss_K .* dKZ.f12, f12m, 'full');
% d_loss_Z = unpad1(M);
if nargin < 3
tap = GETK_TAP;
end
assert( (tap == 3) || (tap == 4) || (tap == 5) )
if tap == 4
assert(1==0);
d_loss_Z = conv2(d_loss_Z, ones(2,2)/4, 'full');
d_loss_Z = d_loss_Z(1:end-1,1:end-1);
elseif tap == 5
% d_loss_Z = unpad1(conv2(d_loss_Z, ([1;2;1] * [1,2,1])/12, 'full'));
% d_loss_Z = conv3d(d_loss_Z, ([1;2;1] * [1,2,1])/16);
d_loss_Z = conv3d(d_loss_Z, ([1;2;1] * [1,2,1])/12);
end
% function d_loss_Z = getK_backprop(d_loss_K, dKZ, tap)
%
% getK_filters;
%
% % d_loss_K = d_loss_K(2:end-1, 2:end-1);
%
% d_loss_K = d_loss_K ./ dKZ.denom;
%
% d_loss_Z = ...
% conv2(d_loss_K .* dKZ.f1, f1m, 'same') + ...
% conv2(d_loss_K .* dKZ.f2, f2m, 'same') + ...
% conv2(d_loss_K .* dKZ.f11, f11m, 'same') + ...
% conv2(d_loss_K .* dKZ.f22, f22m, 'same') + ...
% conv2(d_loss_K .* dKZ.f12, f12m, 'same');
%
% if nargin < 3
% tap = GETK_TAP;
% end
%
% assert( (tap == 3) || (tap == 4) || (tap == 5) )
% if tap == 4
% d_loss_Z = conv2(d_loss_Z, ones(2,2)/4, 'full');
% d_loss_Z = d_loss_Z(1:end-1,1:end-1);
% elseif tap == 5
% d_loss_Z = conv2([1,2,1]/4, [1,2,1]'/4, d_loss_Z, 'same');
% end
% function d_loss_Z = getK_backprop(d_loss_K, dKZ, tap)
%
% getK_filters;
%
% d_loss_K = d_loss_K(2:end-1, 2:end-1);
%
% d_loss_K = d_loss_K ./ dKZ.denom;
%
% d_loss_Z = ...
% conv2(d_loss_K .* dKZ.f1, f1m, 'full') + ...
% conv2(d_loss_K .* dKZ.f2, f2m, 'full') + ...
% conv2(d_loss_K .* dKZ.f11, f11m, 'full') + ...
% conv2(d_loss_K .* dKZ.f22, f22m, 'full') + ...
% conv2(d_loss_K .* dKZ.f12, f12m, 'full');
%
% if nargin < 3
% tap = GETK_TAP;
% end
%
% assert( (tap == 3) || (tap == 4) || (tap == 5) )
% if tap == 4
% d_loss_Z = conv2(d_loss_Z, ones(2,2)/4, 'full');
% d_loss_Z = d_loss_Z(1:end-1,1:end-1);
% elseif tap == 5
% d_loss_Z = conv2([1,2,1]/4, [1,2,1]'/4, d_loss_Z, 'same');
% end
% d_loss_Z = d_loss_numer;
% d_loss_Z = d_loss_denom;
% d_loss_K_sub = 0.5 * d_loss_K;
% d_loss_N1 = conv2_rep( d_loss_K_sub, dKZ.f1);
% d_loss_N2 = conv2_rep( d_loss_K_sub, dKZ.f2);
%
% d_loss_Z = conv2( dKZ.F1_1 .* d_loss_N1 - dKZ.F1_2 .* d_loss_N2, dKZ.f1, 'valid') ...
% + conv2( dKZ.F2_2 .* d_loss_N2 - dKZ.F1_2 .* d_loss_N1, dKZ.f2, 'valid');