Adaptive Step Size Window Matching for Detection

An often overlooked problem in matching lies in selecting an appropriate step size. The selection of the step size for real-time applications is critical both from the point of view of computational efficiency and detection performance. Current systems set the step size in an ad hoc manner. This paper describes an algorithm for selecting the step size based on a theoretical worst case analysis. We have implemented this adaptive step size method in an object detection algorithm. Experimental evaluation demonstrates the effectiveness of our proposed algorithm