Advertisement

Flow Counting Using Realboosted Multi-sized Window Detectors

  • Håkan Ardö
  • Mikael Nilsson
  • Rikard Berthilsson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7585)

Abstract

One classic approach to real-time object detection is to use adaboost to a train a set of look up tables of discrete features. By utilizing a discrete feature set, from features such as local binary patterns, efficient classifiers can be designed. However, these classifiers include interpolation operations while scaling the images over various scales. In this work, we propose the use of real valued weak classifiers which are designed on different scales in order to avoid costly interpolations. The use of real valued weak classifiers in combination with the proposed method avoiding interpolation leads to substantially faster detectors compared to baseline detectors. Furthermore, we investigate the speed and detection performance of such classifiers and their impact on tracking performance. Results indicate that the realboost framework combined with the proposed scaling framework achieves an 80% speed up over adaboost with bilinear interpolation.

Keywords

Object Detection Local Binary Pattern Lookup Table Face Detection Bilinear Interpolation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wolf, L., Hassner, T., Maoz, I.: Face recognition in unconstrained videos with matched background similarity. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 529–534 (2011)Google Scholar
  2. 2.
    Viola, P., Jones, M.: Rapid object detection using a boosted cascade of simple features. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), vol. 1, pp. 511–518 (2001)Google Scholar
  3. 3.
    Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and An Application to Boosting. In: Vitányi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 23–37. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. 4.
    Ojala, T., Pietikainen, M., Harwood, D.: Performance evaluation of texture measures with classification based on kullback discrimination of distributions. In: Proceedings of the 12th IAPR International Conference on Pattern Recognition - Conference A: Computer Vision Image Processing, vol. 1, pp. 582–585 (October 1994)Google Scholar
  5. 5.
    Nilsson, M., Dahl, M., Claesson, I.: The successive mean quantization transform. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 4, pp. 429–432 (March 2005)Google Scholar
  6. 6.
    Nilsson, M., Nordberg, J., Claesson, I.: Face detection using local smqt features and split up snow classifier. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) (April 2007)Google Scholar
  7. 7.
    Mason, L., Baxter, J., Bartlett, P.L., Frean, M.R.: Boosting algorithms as gradient descent. In: NIPS, pp. 512–518 (1999)Google Scholar
  8. 8.
    Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Mach. Learn. 37, 297–336 (1999)zbMATHCrossRefGoogle Scholar
  9. 9.
    Kuhn, H.W.: The hungarian method of solving the assignment problem. Naval Res. Logistics Quart. 2, 83–97 (1955)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Håkan Ardö
    • 1
  • Mikael Nilsson
    • 1
  • Rikard Berthilsson
    • 1
  1. 1.Cognimatics ABLund UniversitySweden

Personalised recommendations