We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
overfeat的框融合的策略,感觉和r-cnn的基于iou的策略有些相似。
https://www.cnblogs.com/zf-blog/p/6740736.html 对2000×20维矩阵中每列按从大到小进行排序; 从每列最大的得分建议框开始,分别与该列后面的得分建议框进行IoU计算,若IoU>阈值,则剔除得分较小的建议框,否则认为图像中存在多个同一类物体;
match_score(b1 ,b2)使用两个边界框的中心之间的距离和框的交叉区域之和来计算匹配分数,当它大于某个阈值时算法停止;
The text was updated successfully, but these errors were encountered:
No branches or pull requests
overfeat的框融合的策略,感觉和r-cnn的基于iou的策略有些相似。
The text was updated successfully, but these errors were encountered: