| Re: Subscripting help [message #92218 is a reply to message #92212] |
Fri, 30 October 2015 11:54  |
Jeremy Bailin
Messages: 618
Registered: April 2008
|
Senior Member |
|
|
On Thursday, October 29, 2015 at 4:34:12 PM UTC-4, rrya...@gmail.com wrote:
> WOW... Again, Jeremy... I logged on, saw the question and there's my answer already...
>
>
> This does sound an awful lot like a drizzle type thing... I'm currently working on a project like this, and I found that using the array decimation techniques along with Jeremy's ideas of "index compression" (ie. his stuff with value_locate) to be indispensable in making these calculations work on a human timescale (and even that they're still pretty slow). You are using the "mean", so if you use the array decimation stuff that is on Fanning's website that is essentially the numerator of an average... So you'll just need to keep track of the number of points that are indexed to ARR_2D. Stemming from Jeremy's stuff and a number of posts by people on Fanning's webpage, I've written my own version of all sorts of stuff:
>
> n_uniq()
> uniqify()
> decimate_array()
> compress_indices()
> sparse_histogram()
>
> Good luck, this is a tough nut to crack, but when you get it--- it's super cool.
> Russell
>
>
>
> On Thursday, October 29, 2015 at 10:44:28 AM UTC-4, KH wrote:
>> Hello,
>>
>> I need to convert a large 2D array to a smaller 1D array by taking the mean of several pixels in the 2D array before putting them into known locations in the 1D array (or bin). The challenge is that the number of pixels per bin varies so I don't know how to do it without creating a large loop. I was hoping there was a way I could do it with subscripts, but I haven't been able to figure it out yet.
>>
>> Here is an example of what I want to do using a loop. It works fine for this example, but my real 2D array is 8640x4320 and I need to move it to a ~5.6 million 1D array and it would take days to run it in a loop.
>>
>> ARR_2D = FINDGEN(9,10) ; Input 2D array
>> ARR_1D = FLTARR(18) ; Output 1D array (bins)
>>
>> ; MAKE UP SUBSCRIPTS FOR THE ARRAY TO FIT INTO THE BINS (KNOWN BIN LOCATIONS)
>> SUBS = LONG(ARR_2D)
>> S = [REVERSE(INDGEN(9)+1),INDGEN(9)+1]
>> FOR N=0, N_ELEMENTS(S)-1 DO BEGIN
>> IF N EQ 0 THEN FSUB = 0 ELSE FSUB = LSUB
>> IF N EQ 0 THEN LSUB = S(N)-1 ELSE LSUB = FSUB + S(N)
>> SUBS(FSUB:LSUB) = N
>> ENDFOR
>>
>>
>> ; LOOP METHOD
>> FOR N=0, N_ELEMENTS(ARR_1D)-1 DO BEGIN
>> OK = WHERE(SUBS EQ N, COUNT)
>> IF COUNT GE 1 THEN ARR_1D(N) = MEAN(ARR_2D(OK))
>> ENDFOR
>>
>> PRINT, ARR_2D
>> PRINT
>> PRINT, ARR_1D
>>
>> Is there a faster way to get the same results? I was trying to figure out a way to do it with subscripts, but haven't had much success.
>>
>> Thanks for your input.
>> Kim
I blush... :)
If you want to see some really edge-of-your-pants, very efficient, and poorly documented use of the double histogram technique using value_locate to deal with sparse histograms, you can look at MATCH_ND (most of the hard work is in MATCHALL_ND), or if you feel really brave MATCH_SPH/MATCHALL_SPH in JBIU:
http://www.simulated-galaxies.ua.edu/jbiu/
Cheers,
-Jeremy.
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
