sort匈牙利算法iou
时间: 2023-08-26 09:13:35 浏览: 58
SORT算法中的匈牙利算法使用IOU(Intersection over Union)进行目标框和检测框的关联。具体来说,它通过计算目标检测框和追踪器预测框之间的IOU,并生成一个IOU矩阵作为增益矩阵。负的IOU矩阵可以作为代价矩阵,我们的目标是求得代价矩阵最小和,在这种情况下得到的索引就是检测值和预测值之间的粗匹配结果。然后,通过设置IOU阈值过滤掉IOU小于0.3的匹配对,得到最终的匹配结果。求最小和的方法使用了匈牙利算法,而scipy库的linear_sum_assignment函数实现了匈牙利算法,只需要输入代价矩阵即可进行匹配。<em>1</em><em>2</em><em>3</em>
#### 引用[.reference_title]
- *1* [SORT-3 匈牙利算法和SORT类](https://blog.csdn.net/qq_43481884/article/details/127214727)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
- *2* [【二】详解多目标跟踪SORT/DeepSort算法,卡尔曼滤波和匈牙利算法](https://blog.csdn.net/Bismarckczy/article/details/129379268)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
- *3* [目标跟踪中的卡尔曼滤波和匈牙利算法解读。](https://blog.csdn.net/Bismarckczy/article/details/129362127)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
[ .reference_list ]