Cited by 2,118Advanced Neural Network ApplicationsAdvanced Image and Video Retrieval TechniquesImage and Object Detection Techniques

Efficient Non-Maximum Suppression

Neubeck, A., Van Gool, L.·2006·18th International Conference on Pattern Recognition (ICPR'06)

Abstract

In this work we scrutinize a low level computer vision task - non-maximum suppression (NMS) - which is a crucial preprocessing step in many computer vision applications. Especially in real time scenarios, efficient algorithms for such preprocessing algorithms, which operate on the full image resolution, are important. In the case of NMS, it seems that merely the straightforward implementation or slight improvements are known. We show that these are far from being optimal, and derive several algorithms ranging from easy-to-implement to highly-efficient

Integrity signals

Registry

Crossref · 10.1109/icpr.2006.479

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A technique inspired by non-maximum suppression (NMS) was developed to refine spatial probabilistic maps, enhancing decomposition performance by reducing ambiguity in complex spatial scenarios and focusing predictions on the most confident cell-type assignments.

    “We developed a technique inspired by non-maximum suppression (NMS)58 to refine spatial probabilistic maps, enhancing decomposition performance by reducing ambiguity in complex spatial scenarios and focusing predictions on the most confident cell-type assignments.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Neubeck, A., & Van Gool, L.
Affiliations
ETH Zurich (CH)
Venue
18th International Conference on Pattern Recognition (ICPR'06)
Publisher
IEEE
Published
2006
Pages
850-855
ISSN
1041-3278 (ISSN-L)
OpenAlex
W2144506857
Cited by
2,118
References
2
Citations by year
2026: 127 · 2025: 233 · 2024: 295 · 2023: 294 · 2022: 311 · 2021: 275 · 2020: 203 · 2019: 133 · 2018: 66 · 2017: 43 · 2016: 28 · 2015: 22 · 2014: 28 · 2013: 15 · 2012: 14
FWCI
3.68
Type
conference paper
Language
en
Open access
closed
Locations
Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Object Detection Techniques
Keywords
non-maximum suppression, real-time image processing, preprocessing algorithms, algorithm efficiency

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review