Greedy refinement of object proposals via boundary‐aligned minimum bounding box search
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,...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-04-01
|
| Series: | IET Computer Vision |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/iet-cvi.2017.0208 |
| _version_ | 1797684982623240192 |
|---|---|
| author | Han‐Mu Park Dae‐Yong Cho Kuk‐Jin Yoon |
| author_facet | Han‐Mu Park Dae‐Yong Cho Kuk‐Jin Yoon |
| author_sort | Han‐Mu Park |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T00:37:46Z |
| format | Article |
| id | doaj.art-f5e7fc34111e4312957a8da6a809c378 |
| institution | Directory Open Access Journal |
| issn | 1751-9632 1751-9640 |
| language | English |
| last_indexed | 2024-03-12T00:37:46Z |
| publishDate | 2018-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Computer Vision |
| spelling | doaj.art-f5e7fc34111e4312957a8da6a809c3782023-09-15T09:32:18ZengWileyIET Computer Vision1751-96321751-96402018-04-0112335736310.1049/iet-cvi.2017.0208Greedy refinement of object proposals via boundary‐aligned minimum bounding box searchHan‐Mu Park0Dae‐Yong Cho1Kuk‐Jin Yoon2Computer Vision LabGwangju Institute of Science and TechnologyGwangjuKoreaComputer Vision LabGwangju Institute of Science and TechnologyGwangjuKoreaComputer Vision LabGwangju Institute of Science and TechnologyGwangjuKoreaRecently 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.https://doi.org/10.1049/iet-cvi.2017.0208boundary-aligned minimum bounding box searchobject detectorsdense sliding window search schemeobject proposal refinement algorithmimage region boundariesgreedy refinement method |
| spellingShingle | Han‐Mu Park Dae‐Yong Cho Kuk‐Jin Yoon Greedy refinement of object proposals via boundary‐aligned minimum bounding box search IET Computer Vision boundary-aligned minimum bounding box search object detectors dense sliding window search scheme object proposal refinement algorithm image region boundaries greedy refinement method |
| title | Greedy refinement of object proposals via boundary‐aligned minimum bounding box search |
| title_full | Greedy refinement of object proposals via boundary‐aligned minimum bounding box search |
| title_fullStr | Greedy refinement of object proposals via boundary‐aligned minimum bounding box search |
| title_full_unstemmed | Greedy refinement of object proposals via boundary‐aligned minimum bounding box search |
| title_short | Greedy refinement of object proposals via boundary‐aligned minimum bounding box search |
| title_sort | greedy refinement of object proposals via boundary aligned minimum bounding box search |
| topic | boundary-aligned minimum bounding box search object detectors dense sliding window search scheme object proposal refinement algorithm image region boundaries greedy refinement method |
| url | https://doi.org/10.1049/iet-cvi.2017.0208 |
| work_keys_str_mv | AT hanmupark greedyrefinementofobjectproposalsviaboundaryalignedminimumboundingboxsearch AT daeyongcho greedyrefinementofobjectproposalsviaboundaryalignedminimumboundingboxsearch AT kukjinyoon greedyrefinementofobjectproposalsviaboundaryalignedminimumboundingboxsearch |