Re: Re : Re: convex hull of a 2D binary image
So, there are a couple of ways you could do that. One is by using structuring elements as indicated in G & W. Another way would be to take a 3D method like described here in the surface approximation section (shameless plug): http://confactsdatas.inrialpes.fr/IEEE_RSJ_-_IROS_2010_International_Confere... and adapt it for 2D. There is nothing in scikits.image that will do this automatically, but it would be a useful feature so I'll add it to my TODO list. Chris On Wed, Apr 20, 2011 at 12:00 PM, jip <jeanpatrick.pommier@gmail.com> wrote:
no, just the convex hull of a a 2D image. I found the definition in "Gonzalez & Woods, p545", but I am not sure to implement the stuff.
jean-patrick
thank you anyway, I'll try to understand the algorithm
I have written an buggy implementation<http://dip4fish.blogspot.com/2011/04/hit-and-miss-skeleton-and-convex-hull.html>. The idea is: 1. find the corners of the contour 2. add them to the particle 3. do it again 4. up to idempotence but it fails ... An issue for me is how to handle the "don't care" points (pixels) with ndimage hit or miss operator. Regards Jean-Patrick
participants (2)
-
Chris Colbert
-
jip