Abstract
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMBP) is subsequently presented for robust face representation and recognition. MBP consists of two parts: one is monogenic magnitude encoded via uniform LBP, and the other is monogenic orientation encoded as quadrant-bit codes. The HMBP is established by concatenating the histograms of MBP of all subregions. Compared with the well-known and powerful Gabor filtering based LBP schemes, one clear advantage of HMBP is its lower time and space complexity because monogenic signal analysis needs fewer convolutions and generates more compact feature vectors. The experimental results on the AR and FERET face databases validate that the proposed MBP algorithm has better performance than or comparable performance with state-of-the-art local feature based methods but with significantly lower time and space complexity.
Original language | English |
---|---|
Title of host publication | Proceedings - 2010 20th International Conference on Pattern Recognition, ICPR 2010 |
Pages | 2680-2683 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 18 Nov 2010 |
Event | 2010 20th International Conference on Pattern Recognition, ICPR 2010 - Istanbul, Turkey Duration: 23 Aug 2010 → 26 Aug 2010 |
Conference
Conference | 2010 20th International Conference on Pattern Recognition, ICPR 2010 |
---|---|
Country | Turkey |
City | Istanbul |
Period | 23/08/10 → 26/08/10 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition