Illumination invariant head pose estimation using random forests classifier and binary pattern run length matrix

25Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a novel approach for head pose estimation in gray-level images is presented. In the proposed algorithm, two techniques were employed. In order to deal with the large set of training data, the method of Random Forests was employed; this is a state-of-the-art classification algorithm in the field of computer vision. In order to make this system robust in terms of illumination, a Binary Pattern Run Length matrix was employed; this matrix is combination of Binary Pattern and a Run Length matrix. The binary pattern was calculated by randomly selected operator. In order to extract feature of training patch, we calculate statistical texture features from the Binary Pattern Run Length matrix. Moreover we perform some techniques to real-time operation, such as control the number of binary test. Experimental results show that our algorithm is efficient and robust against illumination change.

Cite

CITATION STYLE

APA

Kim, H., Lee, S. H., Sohn, M. K., & Kim, D. J. (2014). Illumination invariant head pose estimation using random forests classifier and binary pattern run length matrix. Human-Centric Computing and Information Sciences, 4(1), 1–12. https://doi.org/10.1186/s13673-014-0009-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free