Greedy refinement of object proposals via boundary-aligned minimum bounding box search

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 104
  • Download : 0
Recently developed object detectors rely on automatically generated object proposals, instead of using a dense sliding window search scheme; generating good object proposals has therefore become crucial for improving the computational cost and accuracy of object detection performance. In particular, the shape and location errors of object proposals can be directly propagated to object detection unless some additional processes are adopted to refine the shape and location of bounding boxes. In this study, the authors demonstrate an object proposal refinement algorithm that improves the localisation accuracy and refines the shape of object proposals by searching a boundary-aligned minimum bounding box. They assume that an object consists of several image regions, and that the optimal object proposal is well aligned with image region boundaries. Based on this assumption, they design novel boundary-region alignment measures and then propose a greedy refinement method based on the proposed measures. Experiments on the PASCAL VOC 2007 dataset show that the proposed method produces highly well-localised object proposals and truly improves the quality of object proposals.
Publisher
INST ENGINEERING TECHNOLOGY-IET
Issue Date
2018-04
Language
English
Article Type
Article
Citation

IET Computer Vision, v.12, no.3, pp.357 - 363

ISSN
1751-9632
DOI
10.1049/iet-cvi.2017.0208
URI
http://hdl.handle.net/10203/241201
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0