K-means对anchor大小进行聚类操作

尝试过对yolov-4进行改进，但在自己的样本上最后的精度和速度都不如yolov5，yolov5为什么能在如此小的模型下能有这么好的精度呢？我的想法是将yolov5相对于4的算法一步步的剖析，首先就是yolov5将K-means算法嵌入到了训练过程之中。

import glob
import xml.etree.ElementTree as ET

import numpy as np

def cas_iou(box,cluster):
    x = np.minimum(cluster[:,0],box[0])
    y = np.minimum(cluster[:,1],box[1])

    intersection = x * y
    area1 = box[0] * box[1]

    area2 = cluster[:,0] * cluster[:,1]
    iou = intersection / (area1 + area2 -intersection)

    return iou

def avg_iou(box,cluster):
    return np.mean([np.max(cas_iou(box[i],cluster)) for i in range(box.shape[0])])
def kmeans(box,k):

    row = box.shape[0]
    distance = np.empty((row,k))
    last_clu = np.zeros((row,))
    np.random.seed()
    cluster = box[np.random.choice(row,k,replace = False)]
    while True:
        for i in range(row):
            distance[i] = 1 - cas_iou(box[i],cluster)
        near = np.argmin(distance,axis=1)

        if (last_clu == near).all():
            break
 
        for j in range(k):
            cluster[j] = np.median(
                box[near == j],axis=0)

        last_clu = near

    return cluster

def load_data(path):
    data = []

    for xml_file in glob.glob('{}/*xml'.format(path)):
        tree = ET.parse(xml_file)
        height = int(tree.findtext('./size/height'))
        width = int(tree.findtext('./size/width'))
        if height<=0 or width<=0:
            continue
        
  
        for obj in tree.iter('object'):
            xmin = int(float(obj.findtext('bndbox/xmin'))) / width
            ymin = int(float(obj.findtext('bndbox/ymin'))) / height
            xmax = int(float(obj.findtext('bndbox/xmax'))) / width
            ymax = int(float(obj.findtext('bndbox/ymax'))) / height

            xmin = np.float64(xmin)
            ymin = np.float64(ymin)
            xmax = np.float64(xmax)
            ymax = np.float64(ymax)
      
            data.append([xmax-xmin,ymax-ymin])
    return np.array(data)


if __name__ == '__main__':
    SIZE        = 416
    anchors_num = 9
    path        = r'./VOCdevkit/VOC2007/Annotations'
    data = load_data(path)
    out = kmeans(data,anchors_num)
    out = out[np.argsort(out[:,0])]
    print('acc:{:.2f}%'.format(avg_iou(data,out) * 100))
    print(out*SIZE)
    data = out*SIZE
    f = open("yolo_anchors.txt", 'w')
    row = np.shape(data)[0]
    for i in range(row):
        if i == 0:
            x_y = "%d,%d" % (data[i][0], data[i][1])
        else:
            x_y = ", %d,%d" % (data[i][0], data[i][1])
        f.write(x_y)
    f.close()

把yolov5中的算法提出出来放入到yolov4中手动算出anchor的大小代替默认的大小，能有效增加精度和map