I have a binary 3D image that consists of a 3D object with "1"-valued pixels and background with "0"-valued pixels. I want to compute the euclidean distance of "some" background pixels to the object.
I found that the MATLAB function bwdist() can compute the distance of "all" of the background pixels to the nearest object pixel for each point.
Is there any MATLAB function or other way to compute the distance of an small subset of background pixels to the nearest non-zero pixel efficiently?
Your help is greatly appreciated.
You all have seen Steve's blog post, so you know the answer. But, for anyone who comes to this post with a similar question, we added two new functions to the Image Processing Toolbox for calculating constrained distance problems in R2011b.
These functions solve the geodesic distance and gray-weighted distance transforms.
How about just using Pythagorean theorem? If you know the coordinates of all the pixels in your 3D binary object (which you can find out), then just calculate it. If you have one reference point, and say a million other points, it's just a million calculations - shouldn't take too long though I'm not sure whether it will be faster or slower than bwdist.