A support call came in this week from a customer trying to use watershed to segment this image: The complaint was that calling watershed did not produce a good segmentation.Today I want to show how... 더 읽어보기 >>

In my previous posts on Exploring shortest paths (November 1, November 26, and December 3), I have noted several times that there isn't a unique shortest path (in general) between one object and... 더 읽어보기 >>

In part 2 of Exploring shortest paths, I noted a problem with using the 'quasi-euclidean' distance transform to find the shortest paths between two objects in a binary image.... 더 읽어보기 >>

Earlier this month I started exploring the question of computing the shortest path from one object in a binary image to another. I described the following basic algorithm: ... 더 읽어보기 >>

Blog reader Bogdan asked this question last week: I am trying to find the length and location of the shortest path between objects. It seems like some application of bwdist ... 더 읽어보기 >>

In a recent post I demonstrated the use of bwdist (binary image Euclidean distance transform) to perform isotropic dilation. This was inspired by something that Brett asked me about. ... 더 읽어보기 >>

Brett recently asked me about an image processing problem. One step in the problem involved finding out which pixels are within a certain distance of the foreground in a binary image. We... 더 읽어보기 >>

Today I want to know if you've heard of an operation sometimes called the feature transform, and whether you've had a particular application for it. But first, greetings to those who... 더 읽어보기 >>

Have you ever used the distance transform? For a binary image, the distance transform is the distance from every pixel to the nearest foreground (nonzero) pixel. (Sometimes you'll see... 더 읽어보기 >>