Combined Analysis of Image Processing Transforms with Location Averaging Technique for Facial and Ear Recognition System

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 490)

Abstract

In the current biometric human recognition scenario, novel ideas are evolving to solve the errors in facial and ear recognition system. In this proposed work, a blooming new technique called location averaging technique is combined with few image processing transforms, i.e., location averaging technique is combined with FFT, DCT, and DWT for human face and ear recognition. Location averaging technique is a feature extraction/reduction process; it transforms the whole size of an image into a single column vector. It helps to accumulate more number of images for recognition system. Location averaged FFT, location averaged DCT, and location averaged DWT are the three methods proposed for face and ear recognition system. The standard face and ear database images are used for analyzing the accuracy, runtime, and mismatching. The maximum accuracy value of about 99% is achieved in shortest run time with less mismatching.

References

  1. 1.
    Parivazhagan A, Brintha Therese A (2015) A novel, location averaging, linear equation and exponential function techniques for face recognition in human identification system. Int J Appl Eng Res (IJAER) 10(87):21–26Google Scholar
  2. 2.
    Parivazhagan A, Brintha Therese A (2016) A combination of location averaging feature reduction technique with recognition algorithms for face recognition system. Int J Intell Electron Syst 10(2):1–10CrossRefGoogle Scholar
  3. 3.
    Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex Fourier series. Math Comput 19(90):297–301MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cooley JW, Lewis PAW, Welch PD (1967) Historical notes on the fast Fourier transform. IEEE Trans Audio Electroacoust Au-15(2):76–79CrossRefGoogle Scholar
  5. 5.
    Uzun IS, Amira A, Bouridane A (2005) FPGA implementations of fast Fourier transforms for real-time signal and image processing. IEE Proc-Vis Image Signal Process 152(3):283–296CrossRefGoogle Scholar
  6. 6.
    Cho NI, Lee SU (1991) Fast algorithm and implementation of 2-D discrete Cosine transform. IEEE Trans Circuits Syst 38(3):297–305CrossRefGoogle Scholar
  7. 7.
    Ahmed N, Natarajan T, Rao KR (1974) Discrete Cosine transform. IEEE Trans Comput 100(1):90–93MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Ezoji M, Faez K (2011) Use of matrix polar decomposition for illumination-tolerant face recognition in discrete cosine transform domain. IET Image Process 5(1):25–35CrossRefGoogle Scholar
  9. 9.
    Huang S-M, Chou Y-T, Yang J-F (2014) Low-resolution face recognition in uses of multiple-size discrete cosine transforms and selective Gaussian mixture models. IET Comput Vis 8(5):382–390CrossRefGoogle Scholar
  10. 10.
    Mallat S (2009) A wavelet tour of signal processing the sparse way, 3rd edn. Academic PressGoogle Scholar
  11. 11.
    Akansu AN, Serdijn WA, Selesnick IW (2010) Emerging applications of wavelets: a review. Phys Commun 3:1–18CrossRefGoogle Scholar
  12. 12.
    Lesson 12 Multi-resolution analysis: discrete wavelet transforms, Version 2 ECE IIT, KharagpurGoogle Scholar
  13. 13.
    Martinez AM, Kak AC (2001) PCA versus LDA. IEEE Trans Pattern Anal Mach Intell 23(2):228–233CrossRefGoogle Scholar
  14. 14.
    Zhang T, Fang B, Tang YY, He G, Wen J (2008) Topology preserving non-negative matrix factorization for face recognition. IEEE Trans Image Proc 17(4):574–584MathSciNetCrossRefGoogle Scholar
  15. 15.
    Belhumeur PN, Hespanha JP, Kriegman DJ (1997) Eigenfaces vs. Fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19:711–720CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.School of Electronics EngineeringVIT UniversityChennaiIndia

Personalised recommendations