Remove my for loop using meshgrid?

4 views (last 30 days)
Manne Plok
Manne Plok on 4 Sep 2018
Commented: Walter Roberson on 5 Sep 2018
[rows, ~, ~] = size(file)
for i = 1:rows
value = min(abs(file(i,:,1) - shadow(:,:,1)).^2);
storage(i,:) = value;
end
How do i avoid the for loop in this scenario?
  9 Comments
Manne Plok
Manne Plok on 5 Sep 2018
Yes that is exactly right.

Sign in to comment.

Answers (1)

Greg
Greg on 5 Sep 2018
Edited: Greg on 5 Sep 2018
Given the following code, why are file and shadow 3D? Have we left off an outer loop over dim 3?
[rows, ~, ~] = size(file)
%%%I really don't like "i" as loop index
for irow = 1:rows
value = min(abs(file(irow,:,1) - shadow(:,:,1)).^2);
storage(irow,:) = value;
end
To take advantage of any tricks to avoid the loop, you need another dimension in your data. Note, this requires potentially excessive memory for any speedup you might gain. Assuming you want to do the same thing across the third dimension, try:
shadow = permute(shadow,[4,2,3,1]);
%%%Implicit expansion *will do* multiple singleton dimensions
delta = file - shadow; % R2016b+
% delta = bsxfun(@minus,file,shadow); % R2016a-
storage = min(abs(delta),[],4).^2;
If the third dimension is handled differently, you can use:
shadow_temp = permute(shadow(:,:,1),[2,3,1]);
delta = file - shadow_temp; % R2016b+
% delta = bsxfun(@minus,file,shadow_temp); % R2016a-
storage = min(abs(delta),[],3).^2;
I leave you with 2 thoughts:
  1. Other MVPs encourage the use of bsxfun even in R2016b+. I've never benchmarked it but I trust them when they say it is faster. I personally use implicit expansion for readability. I aim for fast enough code that is easier to read and write versus fastest possible code that coworkers may struggle with.
  2. Depending on your data, you may not need both the abs and .^2. Likely, the squaring accomplishes what you want the abs for, so kill the abs and suck the square inside the min call.
  1 Comment
Walter Roberson
Walter Roberson on 5 Sep 2018
More recent tests are not as clear about the relative speeds of bsxfun and implicit expansion. Implicit expansion might possibly be a hair faster in some cases, but the margin of error in the measurements far exceeded the difference in timings.

Sign in to comment.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by