python中判断有三个值以上_python – 检查数组中是否有3个连续值超过某个阈值

方法#1

在比较后获得的布尔数组的掩码上使用卷积 –

In [40]: a # input array

Out[40]: array([ 1, 3, 4, 5, 60, 43, 53, 4, 46, 54, 56, 78])

In [42]: N = 3 # compare N consecutive numbers

In [44]: T = 40 # threshold for comparison

In [45]: np.flatnonzero(np.convolve(a>T, np.ones(N, dtype=int),'valid')>=N)

Out[45]: array([4, 8, 9])

方法#2

使用binary_erosion –

In [77]: from scipy.ndimage.morphology import binary_erosion

In [31]: np.flatnonzero(binary_erosion(a>T,np.ones(N, dtype=int), origin=-(N//2)))

Out[31]: array([4, 8, 9])

方法#3(特定情况)：少量连续数字检查

为了检查这么少的连续数字(在这种情况下是三个),我们还可以对比较的掩码进行切片以获得更好的性能 –

m = a>T

out = np.flatnonzero(m[:-2] & m[1:-1] & m[2:])

标杆

来自给定样本的100000重复/平铺阵列的计时 –

In [78]: a

Out[78]: array([ 1, 3, 4, 5, 60, 43, 53, 4, 46, 54, 56, 78])

In [79]: a = np.tile(a,100000)

In [80]: N = 3

In [81]: T = 40

# Approach #3

In [82]: %%timeit

...: m = a>T

...: out = np.flatnonzero(m[:-2] & m[1:-1] & m[2:])

1000 loops, best of 3: 1.83 ms per loop

# Approach #1

In [83]: %timeit np.flatnonzero(np.convolve(a>T, np.ones(N, dtype=int),'valid')>=N)

100 loops, best of 3: 10.9 ms per loop

# Approach #2

In [84]: %timeit np.flatnonzero(binary_erosion(a>T,np.ones(N, dtype=int), origin=-(N//2)))

100 loops, best of 3: 11.7 ms per loop