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...
Main Authors: | Srikanthan, Thambipillai, Wu, Meiqing, Ramakrishnan, Nirmala, Lam, Siew-Kei |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference Paper |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/102865 http://hdl.handle.net/10220/16922 |
Similar Items
-
Evaluating the merits of ranking in structured network pruning
by: Sharma, Kuldeep, et al.
Published: (2021) -
Robust and low complexity obstacle detection and tracking
by: Wu, Meiqing, et al.
Published: (2021) -
CAP : Context-aware Pruning for semantic segmentation
by: He, Wei, et al.
Published: (2021) -
Accelerating computer vision algorithms on heterogeneous edge computing platforms
by: Prakash, Alok, et al.
Published: (2021) -
A framework for fast and robust visual odometry
by: Wu, Meiqing, et al.
Published: (2021)