![]() Liu HD, Yang M, Gao Y, Cui C (2014) Local histogram specification for face recognition under varying lighting conditions. Li Z, Liu G, Yang Y, You J (2012) Scale- and rotation-invariant local binary pattern using scale-adaptive texton and subuniform-based circular shift. Lee PH, Wu SW, Hung YP (2012) Illumination compensation using oriented local histogram equalization and its application to face recognition. IEEE Trans Pattern Anal Mach Intell 27(5):684–698 Lee KC, Ho J, Kriegman DJ (2005) Acquiring linear subspaces for face recognition under variable lighting. Le KN, Dabke KP, Egan GK (2006) On mathematical derivations of auto-term functions and signal-to-noise ratios of Choi–Williams, first and nth-order hyperbolic kernels. Le KN (2011) A mathematical approach to edge detection in hyperbolic distributed and Gaussian-distributed pixel-intensity images using hyperbolic and Gaussian masks. Kluckner S, Pacher G, Grabner H, Bischof H, Bauer J (2007) A 3D teacher for car detection in aerial images. Kellokumpu V, Zhao G, Pietikainen M (2008) Human activity recognition using a dynamic texture based method. Huijsmans DP, Sebe N (2003) Content-based indexing performance: a class size normalized precision, recall, generality evaluation. IEEE Trans Pattern Anal Mach Intell 28(4):657–662 Heikkila M, Pietikainen M (2006) A texture-based method for modeling the background and detecting moving objects. Han H, Shan S, Chen X, Gao W (2013) A comparative study on illumination preprocessing in face recognition. IEEE Trans Pattern Anal Mach Intell 30(8):1371–1384 Grangier D, Bengio S (2008) A discriminative kernel-based approach to rank images from text queries. IEEE Trans Pattern Anal Mach Intell 23(6):643–660 Georghiades AS, Belhumeur PN, Kriegman DJ (2001) From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans Syst Man Cybern B Cybern 36(2):458–466 IEEE Trans Pattern Anal Mach Intell 28(9):1519–1524Ĭhen W, Er MJ, Wu S (2006) Illumination compensation and normalization for robust face recognition using discrete cosine transform in logarithm domain. IEEE Trans Pattern Anal Mach Intell 25(2):218–233Ĭhen T, Yin W, Zhou XS, Comaniciu D, Huang TS (2006) Total variation models for variable lighting face recognition. Symp., pp 560–565īasri R, Jacobs D (2003) Lambertian reflectance and linear subspaces. IEEE Trans Pattern Anal Mach Intell 28(12):2037–2041Īli W, Georgsson F, Hellstrom T (2008) Visual tree detection for autonomous navigation in forest environment. IEEE Trans Pattern Anal Mach Intell 19(7):721–732Īhonen T, Hadid A, Pietikainen M (2006) Face description with local binary patterns: application to face recognition. The proposed method produced noticeably improved performance when using the CMU PIE, Yale B, and Extended Yale B databases.Īdini Y, Moses Y, Ullman S (1997) Face recognition: the problem of compensating for changes in illumination direction. Since similar patterns under different illumination conditions are located in the vicinity on the octagonal prism, the proposed method proved robust against illumination variations. In the proposed octagonal prism representation, the LBPs were represented as three dimensional vectors on the octagonal prism. To address this problem, we placed the LBPs on an octagonal prism in a three dimensional space and used the Euclidean distance measure. However, using this bin-to-bin distance measure may produce low similarity scores even for similar patterns. Most LBP matching methods use distribution features with a bin-to-bin distance measure. The LBP method has been widely used in many computer vision applications, particularly for face recognition. This representation implements a new circular distance measurement for face recognition under various illumination conditions. In this paper, we propose an octagonal prism representation for local binary patterns (LBP). ![]()
0 Comments
Leave a Reply. |