ovr = 0.4; % desired overlap of neighboring regions
steps = [2 3 4 5 6 7]; % possible regions for the long dimension
W = size(X, 2);
H = size(X, 1);
w = min([W H]);
w2 = floor(w/2 -1);
b = (max(H, W)-w)./(steps-1);
[~, idx] = min(abs(((w.^2 - w.*b)./w.^2)-ovr)); % steps(idx) regions for long dimension
First of all, thank the author for sharing this code and article。Excuse me, why does the above code count like this? I donundefinedt understand.
ovr = 0.4; % desired overlap of neighboring regions
steps = [2 3 4 5 6 7]; % possible regions for the long dimension
W = size(X, 2);
H = size(X, 1);
w = min([W H]);
w2 = floor(w/2 -1);
b = (max(H, W)-w)./(steps-1);
[~, idx] = min(abs(((w.^2 - w.*b)./w.^2)-ovr)); % steps(idx) regions for long dimension
First of all, thank the author for sharing this code and article。Excuse me, why does the above code count like this? I donundefinedt understand.