performance - 将 3D numpy 数组拆分为 3D block

标签 performance python-2.7 numpy memory-efficient

我想以“pythonic”方式将 3D numpy 数组拆分为 3D 块。我正在处理有点大的数组 (1000X1200X1600) 的图像序列,所以我需要将它们分成几部分来进行处理。

我已经编写了函数来做到这一点,但我想知道是否有一种原生的 numpy 方法来实现这一点 - numpy.split 似乎没有做我想要的 3D 数组(但也许我不了解它的功能)

需要明确的是:下面的代码完成了我的任务,但我正在寻找一种更快的方法来完成它。

def make_blocks(x,t):
#x should be a yXmXn matrix, and t should even divides m,n
#returns a list of 3D blocks of size yXtXt 
    down =  range(0,x.shape[1],t)
    across = range(0,x.shape[2],t)
    reshaped = []
    for d in down:
        for a in across:
            reshaped.append(x[:,d:d+t,a:a+t])
    return reshaped

def unmake_blocks(x,d,m,n):
#this takes a list of matrix blocks of size dXd that is m*n/d^2 long 
#returns a 2D array of size mXn
    rows = []
    for i in range(0,int(m/d)):
        rows.append(np.hstack(x[i*int(n/d):(i+1)*int(n/d)]))
    return np.vstack(rows)

最佳答案

以下是这些循环实现的矢量化版本,它们使用了置换暗淡与 np.transpose 的组合。和 reshaping ——

def make_blocks_vectorized(x,d):
    p,m,n = x.shape
    return x.reshape(-1,m//d,d,n//d,d).transpose(1,3,0,2,4).reshape(-1,p,d,d)

def unmake_blocks_vectorized(x,d,m,n):    
    return np.concatenate(x).reshape(m//d,n//d,d,d).transpose(0,2,1,3).reshape(m,n)
make_blocks 的示例运行——
In [120]: x = np.random.randint(0,9,(2,4,4))

In [121]: make_blocks(x,2)
Out[121]: 
[array([[[4, 7],
         [8, 3]],

        [[0, 5],
         [3, 2]]]), array([[[5, 7],
         [4, 0]],

        [[7, 3],
         [5, 7]]]), ... and so on.

In [122]: make_blocks_vectorized(x,2)
Out[122]: 
array([[[[4, 7],
         [8, 3]],

        [[0, 5],
         [3, 2]]],


       [[[5, 7],
         [4, 0]],

        [[7, 3],
         [5, 7]]],  ... and so on.
unmake_blocks 的示例运行——
In [135]: A = [np.random.randint(0,9,(3,3)) for i in range(6)]

In [136]: d = 3

In [137]: m,n = 6,9

In [138]: unmake_blocks(A,d,m,n)
Out[138]: 
array([[6, 6, 7, 8, 6, 4, 5, 4, 8],
       [8, 8, 3, 2, 7, 6, 8, 5, 1],
       [5, 2, 2, 7, 1, 2, 3, 1, 5],
       [6, 7, 8, 2, 2, 1, 6, 8, 4],
       [8, 3, 0, 4, 4, 8, 8, 6, 3],
       [5, 5, 4, 8, 5, 2, 2, 2, 3]])

In [139]: unmake_blocks_vectorized(A,d,m,n)
Out[139]: 
array([[6, 6, 7, 8, 6, 4, 5, 4, 8],
       [8, 8, 3, 2, 7, 6, 8, 5, 1],
       [5, 2, 2, 7, 1, 2, 3, 1, 5],
       [6, 7, 8, 2, 2, 1, 6, 8, 4],
       [8, 3, 0, 4, 4, 8, 8, 6, 3],
       [5, 5, 4, 8, 5, 2, 2, 2, 3]])

替代 make_blocks view_as_blocks ——
from skimage.util.shape import view_as_blocks

def make_blocks_vectorized_v2(x,d):
    return view_as_blocks(x,(x.shape[0],d,d))

运行时测试

1) make_blocks与原始和 view_as_blocks基于方法 -
In [213]: x = np.random.randint(0,9,(100,160,120)) # scaled down by 10

In [214]: %timeit make_blocks(x,10)
1000 loops, best of 3: 198 µs per loop

In [215]: %timeit view_as_blocks(x,(x.shape[0],10,10))
10000 loops, best of 3: 85.4 µs per loop

2) unmake_blocks与原始和 transpose+reshape基于方法 -
In [237]: A = [np.random.randint(0,9,(10,10)) for i in range(600)]

In [238]: d = 10

In [239]: m,n = 10*20,10*30

In [240]: %timeit unmake_blocks(A,d,m,n)
100 loops, best of 3: 2.03 ms per loop

In [241]: %timeit unmake_blocks_vectorized(A,d,m,n)
1000 loops, best of 3: 511 µs per loop

关于performance - 将 3D numpy 数组拆分为 3D block ,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/39429900/

相关文章:

performance - JavaFX runlater 规范和性能

algorithm - 纯函数式编程的效率

c++ - 带 -std=c++11 的 GCC 看不到 C++ 头文件(通过 PyDSTool)

python - 更改后重新加载模块

python - Tensorflow 阅读 CSV - 什么是最好的方法

java - 类(class)阅读领域费用

node.js - 独立的 REST API 和应用服务器

Python - 循环遍历 csv 文件行值

python - 将数据帧转换为 numpy 矩阵

python - 高效的numpy数组创建