Please use this identifier to cite or link to this item:
Title: Low-complexity pruning for accelerating corner detection
Authors: Srikanthan, Thambipillai
Wu, Meiqing
Ramakrishnan, Nirmala
Lam, Siew-Kei
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2012
Source: Wu, M., Ramakrishnan, N., Lam, S.- K., & Srikanthan, T. (2012). Low-complexity pruning for accelerating corner detection. 2012 IEEE International Symposium on Circuits and Systems, pp1684-1687.
Abstract: In this paper, we present a novel and computationally efficient pruning technique to speed up the Shi-Tomasi and Harris corner detectors. The proposed technique quickly prunes non-corners and selects a small corner candidate set by approximating the complex corner measure of Shi-Tomasi and Harris. The actual corner measure is then applied only to the reduced candidate set. Experimental results on the NiOS-II platform show that the proposed technique achieves an average execution time savings of 90% for Shi-Tomasi and 70% for Harris detectors for 500 corners with no loss in accuracy.
DOI: 10.1109/ISCAS.2012.6271582
Rights: © 2012 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Conference Papers

Citations 20

Updated on Jul 16, 2020

Page view(s) 20

Updated on May 11, 2021

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.