Bottom-up Object Detection by Grouping Extreme and Center Points

Xingyi Zhou, Jiacheng Zhuo, Philipp Krähenbühl
1/23/2019
cs.CV

Official code: xingyizhou/ExtremeNet (1,029 stars, BSD-3-Clause, last commit 2019-04-19).

Abstract

With the advent of deep learning, object detection drifted from a bottom-up to a top-down recognition problem. State of the art algorithms enumerate a near-exhaustive list of object locations and classify each into: object or not. In this paper, we show that bottom-up approaches still perform competitively. We detect four extreme points (top-most, left-most, bottom-most, right-most) and one center point of objects using a standard keypoint estimation network. We group the five keypoints into a bounding box if they are geometrically aligned. Object detection is then a purely appearance-based keypoint estimation problem, without region classification or implicit feature learning. The proposed method performs on-par with the state-of-the-art region based detection methods, with a bounding box AP of 43.2% on COCO test-dev. In addition, our estimated extreme points directly span a coarse octagonal mask, with a COCO Mask AP of 18.9%, much better than the Mask AP of vanilla bounding boxes. Extreme point guided segmentation further improves this to 34.6% Mask AP.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause

Bottom-up Object Detection by Grouping Extreme and Center Points

1,029172C++, PythonJan 7, 20197 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{zhou2019bottomup,
  title  = {Bottom-up Object Detection by Grouping Extreme and Center Points},
  author = {Xingyi Zhou and Jiacheng Zhuo and Philipp Krähenbühl},
  year   = {2019},
  eprint = {1901.08043},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1901.08043}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1901.08043.svg)](https://codeofpaper.com/paper/1901.08043)

Discussion