使用for循环进行统计,steps[i]可以抽象为第i层的anchors的密度。...print('iou', self.iou(box1, box2))
def iou(self, box1, box2):
'''Compute the intersection over union...[:,2]-box1[:,0]) * (box1[:,3]-box1[:,1]) # [N,]
area2 = (box2[:,2]-box2[:,0]) * (box2[:,3]-box2[:,...使用for循环进行统计,steps[i]可以抽象为第i层的anchors的密度。...[:,2]-box1[:,0]) * (box1[:,3]-box1[:,1]) # [N,]
area2 = (box2[:,2]-box2[:,0]) * (box2[:,3]-box2[:,