comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: checking for connectedness of a given set of pixels
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: checking for connectedness of a given set of pixels [message #73332 is a reply to message #73312] Tue, 02 November 2010 15:14 Go to previous messageGo to previous message
David Fanning is currently offline  David Fanning
Messages: 11724
Registered: August 2001
Senior Member
Guillermo writes:

> Libreme Dios! Both functions are great, but I just need to know
> whether or not the pixels are connected. That is, as soon as I find
> one of the little guys who doesn't go hand in hand with the rest,
> that's good enough for me. So I thought there should be a way of
> getting this info without having to call the big shots ...

Bueno! You might try some variation of the chain-code algorithm
then. If you get to the end of a chain and there are no roads
leading anywhere but back the way you came, you are probably
at the end of the road.

This is not the easiest of algorithms to code, but you
can find one version (written for my purposes) in
find_boundary.pro. I think I found the algorithm in the
Russ image processing book.

Cheers,

David


--
David Fanning, Ph.D.
Fanning Software Consulting, Inc.
Coyote's Guide to IDL Programming: http://www.dfanning.com/
Sepore ma de ni thui. ("Perhaps thou speakest truth.")
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Random NetCDF I/O error
Next Topic: Re: Random NetCDF I/O error

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 07:05:18 PDT 2025

Total time taken to generate the page: 0.00698 seconds