2021SC@SDUSC
我们接着来分析slidingWindowsEval函数
在上一次分析中,我们提到,作者调用了他自己写的函数searchOptimalCuttingPoint,找到了最佳分割点,这个点是一个列表,因为点不止一个,然后点列表和评价点的分割score组成的总体列表,作为res返回原函数中,接下来,作者用cutting_pts = res[1],将点集取出来存放到cutting_pts里面,这样就可以分割了。以下是分割部分的代码:
for x in range(1,len(cutting_pts)):
if x != len(cutting_pts)-1 and x!=1:
section = image[0:36,cutting_pts[x-1]-2:cutting_pts[x]+2]
elif x==1:
c_head = cutting_pts[x - 1]- 2
if c_head<0:
c_head=0
c_tail = cutting_pts[x] + 2
section = image[0:36, c_head:c_tail]
elif x==len(cutting_pts)-1:
end = cutting_pts[x]
diff = image.shape[1]-end
c_head = cutting_pts[x - 1]
c_tail = cutting_pts[x]
if diff<7 :