当前位置:网站首页>Understand yolov1 Part II non maximum suppression (NMS) in prediction stage
Understand yolov1 Part II non maximum suppression (NMS) in prediction stage
2022-07-06 19:36:00 【code bean】
introduction
1 Prediction stage , After the model has been trained , Start the prediction stage
2 NMS Non maximum suppression , My understanding of the role in this is , When the category is the same , Any box can be selected
More than one instance .
Occurring simultaneously than (iou)
Then cross and compare is :
Non maximum suppression (NMS)
In the last article 《 understand YOLOV1 Chapter one Prediction stage _code bean The blog of -CSDN Blog 》 We predicted 98 Candidate box , So what we need to do now is to screen out the most accurate ones .
NMS The first 1 round
First of all, we will introduce one of them ( Like dogs ) The candidate boxes of are sorted in descending order by full probability , Then compare all candidate boxes with the first one , If the intersection union ratio of candidate boxes is greater than a certain threshold , Just clear the probability corresponding to this candidate box ( It is equivalent to excluding the candidate box , Because the intersection ratio is too large, it means that it is a repeated choice , The probability is smaller than the maximum , So you can kill )
As shown in the figure above , The intersection ratio of yellow box and green box is greater than 0.5 result , The green frame was killed .
NMS The first 2 round
After the first round , Those who cross the first box and are too big have been killed , So we started the second round , At this time of the second round Start with the candidate box with the second largest probability , That is, the blue frame in the figure , At this time, the red frame behind the blue frame is too large , So the red frame was killed .
There may be a third N round , And then to the end .
But so far , The yellow and blue boxes are the selection boxes that are ultimately retained .
NMS Non maximum suppression , My understanding of the role in this is , When the category is the same , Any box can be selected
More than one instance .
Reference resources :
Tongji Zihao brother's personal space _ Bili, Bili _bilibili
边栏推荐
- USB host driver - UVC swap
- 全套教学资料,阿里快手拼多多等7家大厂Android面试真题
- 蓝桥杯 微生物增殖 C语言
- C # - realize serialization with Marshall class
- DaGAN论文解读
- 快速幂模板求逆元,逆元的作用以及例题【第20届上海大学程序设计联赛夏季赛】排列计数
- MRO industrial products enterprise procurement system: how to refine procurement collaborative management? Industrial products enterprises that want to upgrade must see!
- LeetCode_ Double pointer_ Medium_ 61. rotating linked list
- Black Horse - - Redis Chapter
- 手把手教你学会js的原型与原型链,猴子都能看懂的教程
猜你喜欢
MySQL information schema learning (I) -- general table
A popular explanation will help you get started
MySQL information schema learning (II) -- InnoDB table
在解决了 2961 个用户反馈后,我做出了这样的改变...
【基础架构】Flink/Flink-CDC的部署和配置(MySQL / ES)
Dark horse -- redis
Php+redis realizes the function of canceling orders over time
CPU负载很低,loadavg很高处理方法
Interface test tool - postman
力扣101题:对称二叉树
随机推荐
The list of people who passed the fifth phase of personal ability certification assessment was published
Documents to be used in IC design process
short i =1; I=i+1 and short i=1; Difference of i+=1
GCC【7】- 编译检查的是函数的声明,链接检查的是函数的定义bug
short i =1; i=i+1与short i=1; i+=1的区别
终于可以一行代码也不用改了!ShardingSphere 原生驱动问世
Dark horse -- redis
About image reading and processing, etc
面试突击63:MySQL 中如何去重?
Tensorflow and torch code verify whether CUDA is successfully installed
DaGAN论文解读
数学知识——高斯消元(初等行变换解方程组)代码实现
Zero foundation entry polardb-x: build a highly available system and link the big data screen
黑马--Redis篇
冒烟测试怎么做
Low CPU load and high loadavg processing method
Use of map (the data of the list is assigned to the form, and the JSON comma separated display assignment)
350. 两个数组的交集 II
How to type multiple spaces when editing CSDN articles
Sanmian ant financial successfully got the offer, and has experience in Android development agency recruitment and interview