Geometric hashing (GH) and partial pose clustering are well-known algorithms for pattern recognition. However, the performance of both these algorithms degrades rapidly with an increase in scene clutter and the measurement uncertainty in the detected features. The primary contribution of this paper
Robust face recognition using 2D and 3D data: Pose and illumination compensation
โ Scribed by Sotiris Malassiotis; Michael G. Strintzis
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 482 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
The paper addresses the problem of face recognition under varying pose and illumination. Robustness to appearance variations is achieved not only by using a combination of a 2D color and a 3D image of the face, but mainly by using face geometry information to cope with pose and illumination variations that inhibit the performance of 2D face recognition. A face normalization approach is proposed, which unlike state-of-the-art techniques is computationally efficient and does not require an extended training set. Experimental results on a large data set show that template-based face recognition performance is significantly benefited from the application of the proposed normalization algorithms prior to classification.
๐ SIMILAR VOLUMES
T his paper presents a fast and robust algorithm for generating compound panorama images from partially (spatially) overlapping data sets. This method results in optimizing a nonlinear functional. We propose a multiscale approach for the solution of the optimization problem that is based on a multir
We present a framework for recognition of 3D objects by integrating 2D and 3D sensory data. The major thrust of this work is to efficiently utilize all relevant data, both 2D and 3D, in the early stages of recognition, in order to reduce the computational requirements of the recognition process. To