🚀 go-pugleaf

In article <TEO.93Jan21203514@Xenon.Stanford.EDU> teo@cs.Stanford.EDU writes:
>In article <1993Jan21.192619.10241@pinet.aip.org> scotj@pinet.aip.org (scot_shinderman) writes:
>
>
>>    While reading the standard image processing books I have noticed one
>> algorithm that seems to be glossed over: contour tracing.  In the
>> pictures that I am scanning, a filter is run across the pixels and a
>> threshold is applied to produce either white or black pixels for the
>> grey-scale.  At this point there is usually a rather disconnected set of
>> dots due to noise in the picture but also some strong edges from the
>> filter.  What is the "pratical" method of moveing along the detected
>> pixels to find lines (or curves).  If I try to step from one pixel to
>> the next by looking in a neighborhood, then the path almost always gets
>> caught up in the noise off to one side or another.  Is there a way to
>> "nudge" the search in a particular direction based on previous motions.
>>   Any suggestions (or sample code!) would be greatly appreciated.
>
>Just off the top of my head.  Have you considered trying to use some
>iterative deepening backtracking procedure (algorithms like A*)
>heuristically guided by some bayesian probability of the type of curve
>which you are expecting to see?
>
>-Patrick
>
>-------------------------------------------------------------------------------
>Patrick Cheng-San Teo                                       teo@cs.stanford.edu
>Department of Computer Science                      
>Stanford University                                  Home Phone: (415) 424-0330
>
>"Everything should be made as simple as possible, but not simpler"
>-- Albert Einstein
>-------------------------------------------------------------------------------

Do we really need these kinds of answers wasting net bandwidth?

Stick to the motto in your by-line and offer constructive advise, please.