Fast algorithms for the computation of Ranklets

Authors:
Fabrizio Smeraldi
Affiliations:
Queen Mary University of London, School of Electronic Engineering and Computer Science, London, UK
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 7
Cited 0

Non-parametric local transforms for computing visual correspondence

ECCV '94 Proceedings of the third European conference on Computer Vision (Vol. II)
Ordinal Measures for Visual Correspondence

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Ranklets: Orientation Selective Non-Parametric Features Applied to Face Detection

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Integral Histogram: A Fast Way To Extract Histograms in Cartesian Spaces

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Non-rigid structure from motion using ranklet-based tracking and non-linear optimization

Image and Vision Computing
Texture classification using invariant ranklet features

Pattern Recognition Letters
Description of interest regions with local binary patterns

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

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 log N) 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.