INTERNATIONAL RESEARCH JOURNAL OF SCIENCE ENGINEERING AND TECHNOLOGY

( Online- ISSN 2454 -3195 ) New DOI : 10.32804/RJSET

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 50    Submit Your Rating     Cite This   Download        Certificate

EMOTION RECOGNITION USING GENETIC ALGORITHM

    2 Author(s):  NIRANJAN SAMUDRE ,DR. CHANDANSINGH RAWAT

Vol -  9, Issue- 3 ,         Page(s) : 22 - 28  (2019 ) DOI : https://doi.org/10.32804/RJSET

Abstract

In a genetic algorithm, a population of candidate solutions (called individuals, creatures, or phenotypes) to an optimization problem is evolved toward better solutions. Each candidate solution has a set of properties (its chromosomes or genotype) which can be mutated and altered; traditionally, solutions are represented in binary as strings of 0s and 1s, but other encodings are also possible. The evolution usually starts from a population of randomly generated individuals, and is an iterative process, with the population in each iteration called a generation. In each generation, the fitness of every individual in the population is evaluated; the fitness is usually the value of the objective function in the optimization problem being solved. The more fit individuals are stochastically selected from the current population, and each individual's genome is modified (recombined and possibly randomly mutated) to form a new generation. The new generation of candidate solutions is then used in the next iteration of the algorithm. Commonly, the algorithm terminates when either a maximum number of generations has been produced, or a satisfactory fitness level has been reached for the population.

1. Kass, M., Witkin, A. and Terzopoulus.D. Snakes, “Active contour models,” Int. Jr. of Computer Vision, vol 1, no.4, pp. 321-331, 1987.
2. Yuille, A., Cohen, D. and Halliman, P., “Feature Extraction From Faces Using Deformable Templates,” Int. Jr of Computer Vision, vol.8, pp.104-109, 1992.
3. Craw, I., Tock, D. and Bennett, A., “Finding Face   Features,” In Proc. Second European Conf. on Computer Vision, Santa Margherita Ligure, pp. 92-96, Italy,1992.
4. Brunelli,  R.  and  Poggio,  T.,  “Face  recognition:  Features  versus  templates,”  IEEE  Transactions  on  Pattern Analysis and Machine Intelligence, vol.15, no. 10, pp.1042-1052, October, 1993.
5. Kirby, M. and Sirovich, L., “Application of the Karhunen-Loeve procedure for the Characterization of Human Faces,” IEEE transactions on Pattern Analysis and Machine Intelligence, vol.12, no.1, pp.103-108, 1990.
6. B. Moghaddam, A. Pentland, “Beyond Euclidean eigenspaces: Bayesian matching for visual recognition,” Face Recognition: From Theories to Applications, Springer,Berlin, October 1998.
7. B. Draper, K. Baek, M.S. Bartlett, R. Beveridge, “Recognizing faces with pca and ica,” Comput. Vision Image Understanding (Special Issue on Face Recognition) 91 (2003), 115–137.
8. B. Moghaddam, “Principal manifolds and probabilistic subspaces for visual recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol.24 no. 6,  pp. 780–788, 2002.
9. B. Scholkopf, A. Smola, K. M. Uller, “Nonlinear component analysis as a kernel eigenvalue problem,” Neural Computation, vol. 10, no. 5,  pp. 1299–1319, 1998.
10. M-H. Yang, “Face recognition  using kernel methods,” in: S. Becker, T.G. Ditterich,  Z. Ghahramani  (Eds.), Advances in Neural Information Processing Systems, pp. 215–220,2002.
11. Bouchra  Abbound,  Franck  Davoine,  Mo  Dang,  “Facial  expression  recognition  and  synthesis  based  on  an apearence model,” In Jr. of Signal Processing, Image Communication, Elsevier , 2004.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details