Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/8439
Title: Particle Swarm Optimization algorithm for facial emotion detection
Authors: Ghandi, B.M.
Nagarajan, R.
Hazry, Desa, Prof. Madya Dr.
Keywords: Emotion detection
Facial action units
Facial emotions
Facial expressions
Particle swarm optimization
PSO
Issue Date: 16-Dec-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: Vol. 2, p. 595-599
Series/Report no.: Proceedings of the IEEE Symposium on Industrial Electronics and Applications (ISIEA) 2009
Abstract: Particle Swarm Optimization (PSO) algorithm has been applied and found to be efficient in many searching and optimization related applications. In this paper, we present a modified version of the algorithm that we successfully applied to facial emotion detection. Our approach is based on tracking the movements of facial action units (AUs) placed on the face of a subject and captured in video clips. We defined particles that form swarms such that they have a component around the neighborhood of each AU. Particles are allowed to move around the effectively n-dimensional search space in search of the emotion being expressed in each frame of a video clip (where n is the number of action units being tracked). We have implemented and tested the algorithm on video clips that contain three of the six basic emotions, namely happy, sad and surprise. Our results show the algorithm to have a promising success rate.
Description: Link to publisher's homepage at http://ieeexplore.ieee.org/
URI: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5356389&tag=1
http://dspace.unimap.edu.my/123456789/8439
ISBN: 978-142444682-7
Appears in Collections:Conference Papers
Ramachandran, Nagarajan, Prof. Dr.
Hazry Desa, Associate Prof.Dr.

Files in This Item:
File Description SizeFormat 
Particle swarm optimization algorithm for facial emotion detection.pdf42.53 kBAdobe PDFView/Open


Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.