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. ... 더 읽어보기 >>

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... 더 읽어보기 >>

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 ... 더 읽어보기 >>

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... 더 읽어보기 >>

Today I want to tell a little image processing algorithm story related to my post last week about the new bwconvhull function in the Image Processing Toolbox. The developer (Brendan)... 더 읽어보기 >>

I've been intending to mention a new function bwconvhull that was introduced in the Image Processing Toolbox last spring in the R2011a release. Now that R2011b is out, I figure I better... 더 읽어보기 >>

Today's post is part of an ongoing tutorial series on digital image processing using MATLAB. I'm covering topics in roughly the order used in the book Digital Image Processing Using... 더 읽어보기 >>