Efficient Non-Maximum Suppression
2006pp. 850–855
Citations Over TimeTop 10% of 2006 papers
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
Related Papers
- → Evaluation of time-based ranging methods: Does the choice matter?(2017)13 cited
- → Performance Comparison of Asynchronous Ranging Algorithms(2009)13 cited
- → Ranging-Aided Ground Robot Navigation Using UWB Nodes at Unknown Locations(2022)4 cited
- A laser ranging method with high precision and large range in high speed based on phase measurement(2015)
- → Ranging Sensor Fusion in LISA Data Processing: Treatment of Ambiguities, Noise, and On-Board Delays in LISA Ranging Observables(2023)