Harris corner detection on a NUMA manycore

Abstract : Corner detection is a key kernel for many image processing procedures including pattern recognition and motion detection. The latter, for instance, mainly relies on the corner points for which spatial analyses are performed, typically on (probably live) videos or temporal flows of images. Thus, highly efficient corner detection is essential to meet the real-time requirement of associated applications. In this paper, we consider the corner detection algorithm proposed by Harris, whose the main work-flow is a composition of basic operators represented by their approximations using 3 3 matrices. The corresponding data access patterns follow a stencil model, which is known to require careful memory organization and management. Cache misses and other additional hindering factors with NUMA architectures need to be skillfully addressed in order to reach an efficient scalable implementation. In addition, with an increasingly wide vector registers, an efficient SIMD version should be designed and explicitly implemented. In this paper, we study a direct and explicit implementation of common and novel optimization strategies, and provide a NUMA-aware parallelization. Experimental results on a dual-socket INTEL Broadwell-E/EP show a noticeably good scalability performance.
Document type :
Journal articles
Complete list of metadatas

https://hal-mines-paristech.archives-ouvertes.fr/hal-01711050
Contributor : Claire Medrala <>
Submitted on : Friday, February 16, 2018 - 4:34:10 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Links full text

Identifiers

Citation

Olfa Haggui, Claude Tadonki, Lionel Lacassagne, Fatma Sayadi, Ouni Bouraoui. Harris corner detection on a NUMA manycore. Future Generation Computer Systems, Elsevier, 2018, 88, pp.442-452. ⟨10.1016/j.future.2018.01.048⟩. ⟨hal-01711050⟩

Share

Metrics

Record views

350