comp.lang.idl-pvwave archive: archive

Home » Public Forums » archive » Re: 2d min

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

Re: 2d min [message #74379 is a reply to message #74378]

Wed, 12 January 2011 15:06

Gray
Messages: 253
Registered: February 2010

Senior Member

On Jan 12, 5:45 pm, "Kenneth P. Bowman" <k-bow...@null.edu> wrote:
> In article
> < e707ce03-19e9-4ee5-9976-aa4c2d6f3...@f35g2000vbl.googlegroup s.com >,
>
> Gray <grayliketheco...@gmail.com> wrote:
>> I have a 3d array, NxNxM. What I would like is to find the minimum of
>> each NxN slice, and note the index of the minimum in the slice. I can
>> find my minimum by doing min(min(array,ind1,dim=1),dim=1,ind2), but
>> I'm not sure how to turn those two index arrays into the indices that
>> I need. Help...?
>
> You could just loop over the M index and process each 2-D slice.
> ARRAY_INDICES will get you the index within each slice.
>
> Ken Bowman
Yes, but that will be slow compared to a vectorized solution, is my
guess.

Report message to a moderator

[Message index]

		Re: 2d min By: Gray on Thu, 13 January 2011 09:07
		Re: 2d min By: rogass on Thu, 13 January 2011 05:57
		Re: 2d min By: Gray on Thu, 13 January 2011 05:11
		Re: 2d min By: Gray on Thu, 13 January 2011 04:26
		Re: 2d min By: rogass on Wed, 12 January 2011 23:18
		Re: 2d min By: David Fanning on Wed, 12 January 2011 15:44
		Re: 2d min By: Gray on Wed, 12 January 2011 15:06
		Re: 2d min By: Kenneth P. Bowman on Wed, 12 January 2011 14:45

Previous Topic:	r_correlate; get "loop limit expression too large" error with /Kendall
Next Topic:	Efficient finding of locations where two 'on' pixels are next to one another

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 10:46:41 PDT 2025

Total time taken to generate the page: 1.20041 seconds