comp.lang.idl-pvwave archive: archive » efficient kernel or masking algorithm ?

Home » Public Forums » archive » efficient kernel or masking algorithm ?

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

efficient kernel or masking algorithm ? [message #22645]

Wed, 29 November 2000 00:00

Richard Tyc
Messages: 69
Registered: June 1999

Member

I need to apply a smoothing type kernel across an image, and calculate the
standard deviation of the pixels masked by this kernel.

ie. lets say I have a 128x128 image. I apply a 3x3 kernel (or simply a
mask) starting at [0:2,0:2] and use these pixels to find the standard
deviation for the center pixel [1,1] based on its surrounding pixels, then
advance the kernel etc deriving a std deviation image essentially.
I can see myself doing this 'C' like with for loops but does something exist
for IDL to do it better or more efficiently ?

Rich

Report message to a moderator

[Message index]

		efficient kernel or masking algorithm ? By: Richard Tyc on Wed, 29 November 2000 00:00
		Re: efficient kernel or masking algorithm ? By: Craig Markwardt on Fri, 01 December 2000 00:00
		Re: efficient kernel or masking algorithm ? By: John-David T. Smith on Thu, 30 November 2000 00:00
		Re: efficient kernel or masking algorithm ? By: Craig Markwardt on Thu, 30 November 2000 00:00

Previous Topic:	How Computers Represent Floats
Next Topic:	Re: Object Graphics+Win2k+nVidia Lockups

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 19:57:22 PDT 2025

Total time taken to generate the page: 0.64088 seconds