RankNet for accurate object detection with ranking bounding boxes박스 회귀 순위를 통해 정확한 객체 검출을 위한 순위 네트워크

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 353
  • Download : 0
This paper considers an architecture, referred to as RankNet, for improving object detection by addressing limitations in existing object detection methods as follows: (1) reweights the important samples considering the IoU and classification score of each positive and negative bounding box, (2) define a ranking score to measure the similarity between ground truth and predicted bounding box to indicate the ranks of bounding boxes for NMS procedure, and a metric called EIoU was proposed to calculate the ranking score. Extensive experiments on the standard COCO dataset show the effectiveness of the proposed method in multiple evaluation metrics, including multiple threshold AP metric. In particular, the proposed RankNet improves the AP of the bounding box 1.2, 2.3, 0.9 points compared to the Fast/Faster and Cascade R-CNN baseline, respectively.
Advisors
Yoo, Chang Dongresearcher유창동researcher
Description
한국과학기술원 :전기및전자공학부,
Publisher
한국과학기술원
Issue Date
2020
Identifier
325007
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2020.2,[v, 28 p. :]

Keywords

Object Detection▼aBox Ranking▼aNMS▼aDeep Learning; 객체 검출▼a상자 순위▼a상자 억제▼a심층 학습

URI
http://hdl.handle.net/10203/284768
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=911398&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0