| Re: find contoure [message #34035] |
Thu, 13 February 2003 20:40 |
David Fanning
Messages: 11724
Registered: August 2001
|
Senior Member |
|
|
Thomas Gutzler (tgutzler@ee.uwa.edu.au) writes:
> has somebody written (or knows where to find) an algorithm that finds
> contours of a greyscaled image following this rules:
> input: a starting-point (low brightness)
> follow the contour assuming that the image is bright and the contour is
> dark by proceding to the darkest pixel of all pixels having radius r
> (r=5..10 would probably be a nice value).
> I think of multiplying the image with a kernel (size 2*r x 2*r)
> containing a circle of '1's to get the brightnessvalues.
> Furthermore there must be a threshhold that stops the algorithm, if the
> brightnessvalues get to high.
> output: gathered points
This sounds a bit like an "active contour" or "snake",
since the contour will follow an "energy" pathway,
based on local values. You might want to get ahold
of Ronn Kling's book, Application Development in IDL.
He has a chapter on active contours in that book.
Cheers,
David
--
David W. Fanning, Ph.D.
Fanning Software Consulting, Inc.
Phone: 970-221-0438, E-mail: david@dfanning.com
Coyote's Guide to IDL Programming: http://www.dfanning.com/
Toll-Free IDL Book Orders: 1-888-461-0155
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
