计算一个框和其他所有框的IOU

import os
import json
import numpy as np
def culculate_iou(box,checked_boxes):
    '''

    :param box: [x1,y1,x2,y2]
    :param checked_boxes: [N,x1,y1,x2,y2]
    :return:
    '''
    b1=np.array(box)
    b2=np.array(checked_boxes)
    xx=np.maximum(b1[0],b2[:,0])
    yy=np.maximum(b1[1],b2[:,1])
    XX=np.minimum(b1[2],b2[:,2])
    YY=np.minimum(b1[3],b2[:,3])
    intersect = np.maximum(0,XX-xx)*np.maximum(0,YY-yy)
    s_b1 = np.maximum(0, b1[2] - b1[0]) * np.maximum(0, b1[3] - b1[1])
    s_b2 = np.maximum(0, b2[:,2] - b2[:,0]) * np.maximum(0, b2[:,3] - b2[:,1])
    sum_area=s_b1+s_b2
    iou=intersect/(sum_area-intersect)*1.0
    list_iou=list(iou)
    return max(iou),list_iou.index(max(list_iou))