Abstract
Face recognition or verification remains a real challenge in the area of pattern recognition and image processing. The image acquisition process is a crucial step in which noise will inevitably be introduced, and in most cases this noise drastically decreases the accuracy of the classification rate of recognition systems, making them ineffective. This paper presents a novel approach to face recognition or verification, which increases the recognition rate in noisy environmental conditions. The latter is achieved by using the intrinsic face mode functions that result from applying a bi-dimensional empirical mode decomposition with Green’s functions in tension to noisy images. Each image is individually decomposed, and noisy modes are discarded or filtered during reconstruction. Then, the extracted modes are used for classification purposes with canonical classifiers such as vector support machines or k-nearest neighbor classifiers. Experimental results show that this method achieves very stable results, almost independently of the amount of noise added to the image, due to the ability of decomposition to capture the noise in the first mode. Classification results using noisy images are at the same level as other algorithms proposed for the same databases but working on clean images and therefore are better than those obtained using classic image filters in noisy images. Moreover, unlike most of the available algorithms, the algorithm proposed in this paper is based on the input data (without the need to adjust parameters), making it transparent to the user. Finally, the proposed new approach achieves good results independently of the type of noise, the level of noise and the type of the database, which is not possible with other classical methods requiring parameter adjustment.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.