从张量提取补丁的更快方法?

时间:2018-10-23 16:44:31

标签: python performance numpy tensor

我正在尝试提取以某个给定位置(x,y,z)为中心的固定大小的补丁。代码如下:

x = np.random.randint(0,99,(150, 80, 50, 3))
patch_size = 32
half = int(patch_size//2)
indices = np.array([[40, 20, 30], [60, 30, 27], [20, 18, 21]])
n_patches = indices.shape[0]
patches = np.empty((n_patches, patch_size, patch_size,patch_size, x.shape[-1]))
for ix,_ in enumerate(indices):
   patches[ix, ...] = x[indices[ix, 0]-half:indices[ix, 0]+half,
                        indices[ix, 1]-half:indices[ix, 1]+half,
                        indices[ix, 2]-half:indices[ix, 2]+half, ...]

谁能告诉我如何使这项工作更快?或任何其他替代方法(如果您可以建议这样做的话)会很有帮助。我看到https://stackoverflow.com/a/37901746/4296850中解决了类似的问题,但仅适用于2D图像。有人可以帮我推广该解决方案吗?

1 个答案:

答案 0 :(得分:1)

我们可以利用基于np.lib.stride_tricks.as_stridedscikit-image's view_as_windows来获取滑动窗口。 More info on use of as_strided based view_as_windows

from skimage.util.shape import view_as_windows

# Get sliding windows
w = view_as_windows(x,(2*half,2*half,2*half,1))[...,0]

# Get starting indices for indexing along the first three three axes
idx = indices-half

# Use advanced-indexing to index into first 3 axes with idx and a
# final permuting of axes to bring the output format as desired
out = np.moveaxis(w[idx[:,0],idx[:,1],idx[:,2]],1,-1)