- 博客(10)
- 收藏
- 关注
原创 leetcode第十一周解题总结(155,150,20)--栈
知识点:Stack 栈155. Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Removes the
2017-06-09 17:08:04 215
原创 A-Fast-RCNN: Hard positive generation via adversary for object detection
https://github.com/xiaolonw/adversarial-frcnnObject detection requires the ability to be robust to illumination, deformation, occlusion and intra-class variations.data-driven strategy – collect large
2017-06-07 10:25:49 618
原创 Deep Matching Prior Network: Toward Tighter Multi-oriented Text Detection
Retrospective research has only focused on using rectangular bounding box or horizontal sliding window to localize text, which may result in redundant background noise, unnecessary overlap or even info
2017-06-02 18:03:29 481
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人