A Time-Efficient Cascade for Real-Time Object Detection: With applications for the visually impaired

Authors:
Xiangrong Chen;Alan L. Yuille
Affiliations:
University of California, Los Angeles;University of California, Los Angeles
Venue:
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03
Year:
2005

Citing 0
Cited 7

Text Locating Competition Results

ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
On the Design of Cascades of Boosted Ensembles for Face Detection

International Journal of Computer Vision
Max Margin Learning of Hierarchical Configural Deformable Templates (HCDTs) for Efficient Object Parsing and Pose Estimation

International Journal of Computer Vision
Automatic bus line number localization and recognition on mobile phones: a computer vision aid for the visually impaired

ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing - Volume Part II
Mobile-based advertisement information retrieval from images and websites

Proceedings of the 20th ACM international conference on Multimedia
Robust real-time detection of multi-color markers on a cell phone

Journal of Real-Time Image Processing
Scale based region growing for scene text detection

Proceedings of the 21st ACM international conference on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time object detection is essential for many computer vision applications. Many rapid detection algorithms are based on using cascades of tests. But existing design criteria for cascades either ignore the time complexity of the tests or make over-simplified assumptions about them. This paper gives a criterion for designing a time-efficient cascade that explicitly takes into account the time complexity of tests (as evaluated by computer run time) including the time for pre-processing. We design a greedy algorithm to minimize this criterion (noting that the full problem is NP-complete). Finally, we illustrate our method on the task of text detection in city scenes. This gives a text detection algorithm that runs at 0.025 seconds per 320脳240 image, which is equivalent to 40 frames per second. This is a speed up factor of 2.5 compared to our previous text detector. It gives a realtime system which can be used for applications to help the blind and visually impaired.