Low-complexity pruning for accelerating corner detection
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. T...
Saved in:
Main Authors: | Srikanthan, Thambipillai, Wu, Meiqing, Ramakrishnan, Nirmala, Lam, Siew-Kei |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/102865 http://hdl.handle.net/10220/16922 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Evaluating the merits of ranking in structured network pruning
by: Sharma, Kuldeep, et al.
Published: (2021) -
Accelerating computer vision algorithms on heterogeneous edge computing platforms
by: Prakash, Alok, et al.
Published: (2021) -
Embedded accelerators
by: Thambipillai Srikanthan.
Published: (2009) -
Rapid memory-aware selection of hardware accelerators in programmable SoC design
by: Prakash, Alok, et al.
Published: (2019) -
Threshold-guided design and optimization for Harris corner detector architecture
by: Jasani, Bhavan Ashwin, et al.
Published: (2020)