comp.lang.idl-pvwave archive: archive » Re: Efficient finding of locations where two 'on' pixels are next to one another

Home » Public Forums » archive » Re: Efficient finding of locations where two 'on' pixels are next to one another

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Efficient finding of locations where two 'on' pixels are next to one another [message #74359]

Thu, 13 January 2011 10:21

Marc Buie
Messages: 12
Registered: December 2010

Junior Member

Robin -

I wrote a very similar routine some time ago. The name is collapse.pro and is in my library (www.boulder.swri.edu/~buie/idl). I worked really hard on this to speed it up and it's pretty good though you might not believe this to see the code. My program might be different from yours though. I use two images, one a bit image that is being processed but it is coupled to another "grey-scale" image from which the bit image is derived. I work with astronomical data and my images are of the sky (with stars and such) and the bit image records the positions of the stars.

I use boxm.pro which finds a local max in the image and uses that information to turn off the bits in the bit image that are too close to one another.

You might find some useful tricks in these two programs that could help you solve your problem.

Cheers,
Marc

Report message to a moderator

[Message index]

		Re: Efficient finding of locations where two 'on' pixels are next to one another By: Marc Buie on Thu, 13 January 2011 10:21
		Re: Efficient finding of locations where two 'on' pixels are next to one another By: jeanh on Thu, 13 January 2011 09:56

Previous Topic:	Efficient finding of locations where two 'on' pixels are next to one another
Next Topic:	Colorbar

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sun Nov 30 00:17:49 PST 2025

Total time taken to generate the page: 1.04042 seconds