Steve on Image Processing

Concepts, algorithms & MATLAB

Results for: 2011

Exploring shortest paths – wrapping up

Posted by Steve Eddins,

For the past several weeks I've been writing about shortest-path problems in image processing: finding the shortest path between two points in an image, with and without constraints. ... read more >>

Exploring shortest paths – part 5 5

Posted by Steve Eddins,

In this post in the Exploring shortest paths series, I make things a little more complicated (and interesting) by adding constraints to the shortest path problem. Last time, I showed this example of finding the shortest paths between the "T" and the sideways "s" in... read more >>

Exploring shortest paths – part 4

Posted by Steve Eddins,

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 another in a binary image. To illustrate, here's a recap of the... read more >>

Exploring shortest paths – part 3 2

Posted by Steve Eddins,

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. Specifically, our algorithm resulted in a big, unfilled gap between the two objects. ... read more >>

Exploring shortest paths – part 2

Posted by Steve Eddins,

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: ... read more >>

Five years ago: May, June, and July 2006

Posted by Steve Eddins,

Much of the information I posted in this blog years ago is still useful today. Image processing theory hasn't been completely overturned since then, and I'm still talking about MATLAB after all. For the benefit of readers who have joined the party ... read more >>