dc.contributor.authorWu, Meiqing
dc.contributor.authorRamakrishnan, Nirmala
dc.contributor.authorLam, Siew-Kei
dc.contributor.authorSrikanthan, Thambipillai
dc.identifier.citationWu, 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.en_US
dc.description.abstractIn 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.en_US
dc.rights© 2012 IEEE.en_US
dc.subjectDRNTU::Engineering::Computer science and engineering
dc.titleLow-complexity pruning for accelerating corner detectionen_US
dc.typeConference Paper
dc.contributor.conferenceIEEE International Symposium on Circuits and Systems (2012 : Seoul, Korea)en_US
dc.contributor.researchCentre for High Performance Embedded Systemsen_US
dc.contributor.schoolSchool of Computer Engineeringen_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record