【计算机视觉】Object Proposal之BING++
本文是对 BING 算法的升级,主要是在快的同时保持定位精度
两个 + 分别对应: edge-based recursive boxes as one “+”, and MTSE-based superpixel merging as the other “+”
Object Detection Recall (DR):which is the ratio of the number of correctly detected objects and the total number of objects in the dataset
Proposal Localization Quality measured in terms of average best overlap (ABO)
mean average best overlap (MABO)
Key insight: 我们注意到好的候选区域框是刚刚包含物体,edge 特征可以用于检测物体边缘
2 Problems in BING
poor proposal localization quality
3 Our Solution: BING++
(1) We take proposals from BING as input.
(2) We then recursively update current bounding boxes based on their current locations and surrounding edge points to form new bounding boxes. This process is recursed until we find
(3) We finally apply fast super-pixel merging techniques to further refine the output bounding boxes of (2) and output final object proposals
算法流程:
结果对比:
相关文章
- 计算机等级考试二级C语言程序设计专项训练题——数组元素的移动
- 计算机等级考试二级C语言上机题集(第56~60套)
- 解决 “无法安装 Visual Studio 2010 Service Pack 1,因为此计算机的状态不支持”
- 计算机体系结构的一些总结
- 《计算机操作系统》重点知识笔记整理(一)
- 《计算机视觉:模型、学习和推理》——3.8 正态逆维希特分布
- 计算机基础知识
- 【Verilog基础】【计算机体系架构】CPU发生中断要做哪些事?什么是中断向量表?(面试常问)
- 【Computer Vision学习】计算机视觉入门概述
- 【历史上的今天】4 月 10 日:GitHub 十五周年;人类第一张黑洞照片;计算机延误航天飞机