There have been a number of corner detection methods proposed for event cameras in the last years, since event-driven computer vision has become more accessible. Current state-of-the-art have either unsatisfactory accuracy or real-time performance when considered for practical use, for example when a camera is randomly moved in an unconstrained environment. In this paper, we present yet another method to perform corner detection, dubbed look-up event-Harris (luvHarris), that employs the Harris algorithm for high accuracy but manages an improved event throughput. Our method has two major contributions, 1. a novel "threshold ordinal event-surface" that removes certain tuning parameters and is well suited for Harris operations, and 2. an implementation of the Harris algorithm such that the computational load per event is minimised and computational heavy convolutions are performed only "as-fast-as-possible", i.e. only as computational resources are available. The result is a practical, real-time, and robust corner detector that runs more than 2.6x the speed of current state-of-the-art; a necessity when using high-resolution event-camera in real-time. We explain the considerations taken for the approach, compare the algorithm to current state-of-the-art in terms of computational performance and detection accuracy, and discuss the validity of the proposed approach for event cameras.
翻译:在过去几年里,人们为事件摄像机提出了若干个角落探测方法,因为事件驱动的计算机视觉已经变得更加容易获得。当考虑实际使用时,目前的先进技术要么不令人满意,要么是准确性或实时性能,例如照相机在不受限制的环境中随机移动。在本文中,我们提出了另一种方法,用哈里斯算法进行角落探测,称为外观事件-Harris(LuvHarris),这种方法使用哈里斯算法,以便提高准确性,但管理一个更好的事件通过量。我们的方法有两个主要贡献,即1. 一种新颖的“临界或地表事件”,可以消除某些调试参数,并且非常适合哈里斯的操作;2. 实施哈里斯算法,这样可以将每件事件的计算负荷最小化,而计算重演动只能“快速”进行,也就是说,只有当计算资源到位时,我们才使用实用、实时和稳健的角探测器,其速度超过当前状态速度的2.6x;在使用高分辨率测算法时,有必要使用当前测算法的准确性,我们用高分辨率来解释当前测算结果的准确性。