CenterNet: Keypoint Triplets for Object Detection
Kaiwen Duan, Song Bai, Lingxi Xie, Honggang Qi, Qingming Huang, Qi Tian
TL;DR
CenterNet tackles the high rate of incorrect boxes in one-stage keypoint detectors by introducing a center keypoint triplet (center plus two corners) and two lightweight pooling modules that enrich internal object information. The model verifies corner pairs by the presence of a center keypoint within a scale-aware central region and optimizes both precision and recall with center pooling and cascade corner pooling. On MS-COCO, CenterNet achieves 47.0% AP on test-dev, outperforming all prior one-stage detectors and approaching two-stage detector performance, while maintaining efficient inference. The work offers a practical, plug-in enhancement to existing one-stage, anchor-free detectors to reduce false positives with minimal cost.
Abstract
In object detection, keypoint-based approaches often suffer a large number of incorrect object bounding boxes, arguably due to the lack of an additional look into the cropped regions. This paper presents an efficient solution which explores the visual patterns within each cropped region with minimal costs. We build our framework upon a representative one-stage keypoint-based detector named CornerNet. Our approach, named CenterNet, detects each object as a triplet, rather than a pair, of keypoints, which improves both precision and recall. Accordingly, we design two customized modules named cascade corner pooling and center pooling, which play the roles of enriching information collected by both top-left and bottom-right corners and providing more recognizable information at the central regions, respectively. On the MS-COCO dataset, CenterNet achieves an AP of 47.0%, which outperforms all existing one-stage detectors by at least 4.9%. Meanwhile, with a faster inference speed, CenterNet demonstrates quite comparable performance to the top-ranked two-stage detectors. Code is available at https://github.com/Duankaiwen/CenterNet.
