REVIEW 1 cited by
Learning non-maximum suppression
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Object detectors have hugely profited from moving towards an end-to-end learning paradigm: proposals, features, and the classifier becoming one neural network improved results two-fold on general object detection. One indispensable component is non-maximum suppression (NMS), a post-processing algorithm responsible for merging all detections that belong to the same object. The de facto standard NMS algorithm is still fully hand-crafted, suspiciously simple, and -- being based on greedy clustering with a fixed distance threshold -- forces a trade-off between recall and precision. We propose a new network architecture designed to perform NMS, using only boxes and their score. We report experiments for person detection on PETS and for general object categories on the COCO dataset. Our approach shows promise providing improved localization and occlusion handling.
Forward citations
Cited by 1 Pith paper
-
Shape-Aware Oriented Bounding Box (OBB) to Horizontal Bounding Box (HBB) Conversion
A shape-aware OBB-to-HBB conversion using a fitted superellipse hull model is proposed, but the derived projection equations are internally inconsistent and the empirical claims are partly overstated.
Discussion (0). Continue with ORCID to comment.