Resource-Aware Harris Corner Detection Based on Adaptive Pruning
Lists
Only you see this
Abstract
Corner-detection techniques are being widely used in computer vision – for example in object recognition to find suitable candidate points for feature registration and matching. Most computer-vision applications have to operate on real-time video sequences, hence maintaining a consistent throughput and high accuracy are important constrains that ensure high-quality object recognition. A high throughput can be achieved by exploiting the inherent parallelism within the algorithm on massively parallel architectures like many-core processors. However, accelerating such algorithms on many-core CPUs offers several challenges as the achieved speedup depends on the instantaneous load on the processing elements. In this work, we present a new resource-aware Harris corner-detection algorithm for many-core processors. The novel algorithm can adapt itself to the dynamically varying load on a many-core processor to process the frame within a predefined time interval. The results show a 19% improvement in throughput and an 18% improvement in accuracy.
BibTeX
@inproceedings{paul2014resource,
author = {Johny Paul and Walter Stechele and Manfred Kröhnert and Tamim Asfour and Benjamin Oechslein and Christoph Erhardt and Jens Schedel and Daniel Lohmann and Wolfgang Schröder-Preikschat},
title = {{Resource-Aware Harris Corner Detection Based on Adaptive Pruning}},
booktitle = {ARCS},
year = {2014},
doi = {10.1007/978-3-319-04891-8\_1},
}Loading related content...