Hardware/software co-design of embedded real-time KD-tree based feature matching systems

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature matching is an important step in many computational photography applications such as image stitching, 3D reconstruction and object recognition. KD-trees based Best Bin First (KD-BBF) search is one of the most widely used feature matching scheme being employed along with SIFT and SURF. The real time requirements of such computer vision applications for embedded systems put tight compute bounds on the processor. In this paper we propose a soft-core and a hardware accelerator based architecture that enables real time matching of SIFT feature descriptors for HD resolution images at 30 FPS. The proposed accelerator provides a speedup of more than 8 times over the pure software implementation.

Cite

CITATION STYLE

APA

Shoaib, S., Hafiz, R., & Shafique, M. (2014). Hardware/software co-design of embedded real-time KD-tree based feature matching systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8888, pp. 936–945). Springer Verlag. https://doi.org/10.1007/978-3-319-14364-4_90

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free