矩阵运算：求giou

矩阵运算：求giou import numpy as np a = np.array([[0, 0, 3, 3], [1, 1, 4, 3], [1, 1, 3, 3] ]) b = np.array([[1, 1, 4, 3], [3, 0, 4, 3] ]) 先求出最大面积， x中的最大值和最小值 y中的最大值和最小值 x_a_min = a[:,0].reshape((-1, 1)) x_m

>>阅读原文<<