我有一个2D numpy
数组,该数组将零散的时间段表示为开始/结束时间。我已经设计出一种方法,可以在近端连接段(小于一些最小间隙长度):
def join_proximal_segments(original_segments, min_gap):
begins = np.array([original_segments.T[0, 0]])
ends = np.array([])
for i in np.arange(len(original_segments)-1):
if((original_segments.T[0, i+1] - original_segments.T[1, i]) > min_gap):
begins = np.append(begins, original_segments.T[1, i])
ends = np.append(ends, original_segments.T[0, i+1])
ends = np.append(ends, original_segments.T[1, -1])
joined_segments = np.array([begins, ends]).T
return joined_segments
似乎很不雅致。是否有使用numpy
解决此问题的更直接方法?
编辑:示例数组
detections = np.array([[2, 60],[62, 78],[97, 105],[255, 340],[343, 347]])
我不确定我是否完全理解您的问题,但是我希望这个例子可以帮助您找出问题的向量化:
import numpy as np
min_gap = 10
original_segments = np.array([[ 2, 60],
[ 62, 78],
[ 97, 105],
[255, 340],
[343, 347]])
def join_proximal_segments(original_segments, min_gap):
diff = original_segments[1:, 0] - original_segments[:-1, 1]
diff_bool = diff > min_gap
joined_segments = np.empty((sum(diff_bool)+1, 2),
dtype=original_segments.dtype)
# beginnings
joined_segments[0, 0] = original_segments[0, 0]
joined_segments[1:, 0] = original_segments[:-1, 1][diff_bool]
# ends
joined_segments[:-1, 1] = original_segments[1:, 0][diff_bool]
joined_segments[-1, 1] = original_segments[-1, 1]
return joined_segments
print(join_proximal_segments(original_segments, min_gap))
# [[ 2 97]
# [ 78 255]
# [105 347]]