| dc.contributor.author | Smeraldi, Fabrizio | |
| dc.date.accessioned | 2013-12-30T09:25:10Z | |
| dc.date.available | 2013-12-30T09:25:10Z | |
| dc.date.issued | 2013-12-30 | |
| dc.identifier.issn | 2043-0167 | |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/4999 | |
| dc.description.abstract | Ranklets are orientation selective rank features with applications to tracking, face detection, texture and medical imaging. We introduce efficient algorithms that reduce their computational complexity from O(N logN) to O(!N + k), where N is the area of the filter. Timing tests show a speedup of
one order of magnitude for typical usage, which should make Ranklets attractive for real-time applications. | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | School of Electronic Engineering and Computer Science Research Reports;EECSRR-09-01 - January 2009 | |
| dc.subject | Ranklets | en_US |
| dc.subject | Rank features | en_US |
| dc.subject | Orientation decomposition | en_US |
| dc.subject | Wilcoxon statistics | en_US |
| dc.subject | Distributuin counting sort | en_US |
| dc.title | Fast Algorithms for the Computation of Ranklets | en_US |
| dc.type | Technical Report | en_US |
