Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/3014
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKar, Nikunja Bihari-
dc.contributor.authorKorra, Satya Babu-
dc.date.accessioned2018-07-02T10:33:41Z-
dc.date.available2018-07-02T10:33:41Z-
dc.date.issued2018-06-
dc.identifier.citationInternational Conference on Control and Computer Vision, NTU Singapore, 15-18 June, 2018en_US
dc.identifier.urihttp://hdl.handle.net/2080/3014-
dc.descriptionCopyright of this document belongs to proceedings publisher.en_US
dc.description.abstractThis paper presents an automated facial expression recognition (FER) system based on two dimensional stationary wavelet transform (2D-SWT) and gray-level co-occurrence matrix (GLCM). The proposed scheme employs 2D-SWT to decompose the image into a set of sub-bands. Then GLCM features are obtained from the 2D-SWT sub-bands. Subsequently, linear discriminant analysis (LDA) is harnessed to select the most relevant features. Finally, these features are used for classification of facial emotions using least squares variant of support vector machine (LS-SVM) with radial basis function (RBF) kernel. The performance of the pro-posed system is evaluated on two standard datasets namely, Extended Cohn-Kanade (CK+) and Japanese female facial expression (JAFFE). Experimental results based on 5-fold cross validation strategy indicate that the proposed scheme earns an accuracy of 96.72% and 99.79% over CK+ and JAFFE dataset respectively, which are superior to other competent schemes.en_US
dc.subjectFacial expression recognitionen_US
dc.subjectStationary wavelet transformen_US
dc.subjectGray-level co-occurrence matrixen_US
dc.titleFacial Expression Recognition using 2D Stationary Wavelet Transform and Gray-Level Co-occurrence Matrixen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
ICCCV_2018_KSatyaBabu_Facial expression.pdfConference Paper701.07 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.