將數據分組到非基於網格的垃圾箱

我已經使用voronoi binning：我有每個垃圾箱的中心座標，我想找到每個垃圾箱中包含的所有像素的平均值。我無法理解如何切分numpy數組來引導它。將數據分組到非基於網格的垃圾箱

這是我現在的代碼：X和Y是1D數組，每個bin的中心有x和y座標; f在二維圖像中：

import numpy as np 
from scipy.spatial import KDTree 

def rebin(f, X, Y): 
    s = f.shape 
    x_grid = np.arange(s[0]) 
    y_grid = np.arange(s[1]) 
    x_grid, y_grid = np.meshgrid(x_grid,y_grid) 
    x_grid, y_grid = x_grid.flatten(), y_grid.flatten() 

    tree = KDTree(zip(X,Y)) 
    _, b = tree.query(zip(x_grid, y_grid)) 
    out = X*np.nan 

    for i in range(max(b)): 
     out[i] = np.nanmean(f[x_grid[b==i], y_grid[b==i]]) 
    return out

for-loop目前是一個巨大的瓶頸。可能有一個非常簡單的答案 - 我目前看不到它！

來源

2017-09-04 J.Warren

out = X*np.nan 
for i in range(max(b)): 
    out[i] = np.nanmean(f[x_grid[b==i], y_grid[b==i]])

可以通過兩個呼叫被替換以np.bincount：

total = np.bincount(b, weights=f[x_grid, y_grid], minlength=len(X)) 
count = np.bincount(b, minlength=len(X)) 
out = total/count

或一個呼叫到stats.binned_statistic：

out, bin_edges, binnumber = stats.binned_statistic(
    x=b, values=f[x_grid, y_grid], statistic='mean', bins=np.arange(len(X)+1))

例如，

import numpy as np 
from scipy.spatial import KDTree 
import scipy.stats as stats 
np.random.seed(2017) 

def rebin(f, X, Y): 
    s = f.shape 
    x_grid = np.arange(s[0]) 
    y_grid = np.arange(s[1]) 
    x_grid, y_grid = np.meshgrid(x_grid,y_grid) 
    x_grid, y_grid = x_grid.flatten(), y_grid.flatten() 

    tree = KDTree(np.column_stack((X,Y))) 
    _, b = tree.query(np.column_stack((x_grid, y_grid))) 

    out, bin_edges, binnumber = stats.binned_statistic(
     x=b, values=f[x_grid, y_grid], statistic='mean', bins=np.arange(len(X)+1)) 
    # total = np.bincount(b, weights=f[x_grid, y_grid], minlength=len(X)) 
    # count = np.bincount(b, minlength=len(X)) 
    # out = total/count 
    return out 

def orig(f, X, Y): 
    s = f.shape 
    x_grid = np.arange(s[0]) 
    y_grid = np.arange(s[1]) 
    x_grid, y_grid = np.meshgrid(x_grid,y_grid) 
    x_grid, y_grid = x_grid.flatten(), y_grid.flatten() 

    tree = KDTree(np.column_stack((X,Y))) 
    _, b = tree.query(np.column_stack((x_grid, y_grid))) 

    out = X*np.nan 
    for i in range(len(X)): 
     out[i] = np.nanmean(f[x_grid[b==i], y_grid[b==i]]) 
    return out 

N = 100 
X, Y = np.random.random((2, N)) 
f = np.random.random((N, N)) 

expected = orig(f, X, Y) 
result = rebin(f, X, Y) 
print(np.allclose(expected, result, equal_nan=True)) 
# True

來源

2017-09-04 20:19:37 unutbu

我剛剛發現有一個名爲cKDTree的KDTree的cython特徵完整版本，速度更快。

來源

2017-09-05 09:08:16

將數據分組到非基於網格的垃圾箱

回答

相關問題