以下代码段的有效实现 [英] Efficient implementation of the following code snippet

查看:57
本文介绍了以下代码段的有效实现的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我有一个计算3-D体积平均深度的函数.有没有一种方法可以使代码在执行时间上更高效.体积具有以下形状.

I have a function which calculates the mean depth of a 3-D volume. Is there a way to make the code more efficient in terms of execution time. The volume is of the following shape.

volume = np.zeros((100, 240, 180))

该体积可以包含不同体素上的数字1,目标是使用体积中所有占用单元格的加权平均值来找到平均深度(平均Z坐标).

The volume can contain the number 1 at different voxels and the objective is to find the mean depth (mean Z co-ord) using weighted average of all occupied cells in the volume.

def calc_mean_depth(volume):
        '''

        Calculate the mean depth of the volume. Only voxels which contain a value are considered for the mean depth

        Parameters:
        -----------
        volume: (100x240x180) numpy array
         Input 3-D volume which may contain value of 1 in its voxels
        Return: 
        -------
        mean_depth :<float>
        mean depth calculated
        '''
        depth_weight = 0
        tot = 0
        for z in range(volume.shape[0]):
            vol_slice = volume[z, :, :] # take one x-y plane
            weight = vol_slice[vol_slice>0].size  # get number of values greater than zero
            tot += weight   #  This counter is used to serve as the denominator
            depth_weight += weight * z   # the depth plane into number of cells in it greater than 0.
        if tot==0:
            return 0
        else:
            mean_depth = depth_weight/tot
            return mean_depth

推荐答案

这应该有效.使用count_nonzero进行求和并在最后进行平均.

This should work. Use count_nonzero to do the summing and do the averaging at the end.

def calc_mean_depth(volume):
    w = np.count_nonzero(volume, axis = (1,2))
    if w.sum() == 0:
        return 0
    else
        return (np.arange(w.size) * w).sum() / w.sum()

这篇关于以下代码段的有效实现的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆