Hardware/Software Co-design of Embedded Real-Time KD-Tree Based Feature Matching Systems

被引：0

作者：

Shoaib, Saad ^{[1
]}

Hafiz, Rehan ^{[1
]}

Shafique, Muhammad ^{[2
]}

机构：

[1] Natl Univ Sci & Technol, Islamabad, Pakistan

[2] Karlsruhe Inst Technol, Chair Embedded Syst, D-76021 Karlsruhe, Germany

来源：

ADVANCES IN VISUAL COMPUTING (ISVC 2014), PT II | 2014年 / 8888卷

关键词：

APPROXIMATE NEAREST-NEIGHBOR; SEARCH;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：936 / 945

页数：10

共 17 条

[1]

Altera, 2010, INTR ALT NIOS II SOF

[2]

Andoni A, 2006, ANN IEEE SYMP FOUND, P459

[3]

[Anonymous], 2006, 2006 IEEE COMP SOC C

[4]

[Anonymous], 2012, ZYNQ 7000 ALL PROGR

[5] SURF: Speeded up robust features [J].

Bay, Herbert ;

Tuytelaars, Tinne ;

Van Gool, Luc .

COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417

[6] Shape indexing using approximate nearest-neighbour search in high-dimensional spaces [J].

Beis, JS ;

Lowe, DG .

1997 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1997, :1000-1006

[7]

Chao J., 2013, PERFORMANCE COMP VAR

[8]

Datar Mayur, 2004, PROC 20 S COMPUTATIO, P253

[9]

Garcia V, 2009, LECT NOTES COMPUT SC, V5496, P425, DOI 10.1007/978-3-642-01811-4_38

[10]

Leutenegger S, 2011, IEEE I CONF COMP VIS, P2548, DOI 10.1109/ICCV.2011.6126542

← 1 2 →