Bilgisayar Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940

Browse

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    Facial Expression Recognition From Still Images
    (Springer International Publishing AG, 2017) Gökmen, Muhittin; Gökmen, Muhittin; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF University
    With the development of technology, Facial Expression Recognition (FER) become one of the important research areas in Human Computer Interaction. Changes in the movement of some muscles in face create the facial expressions. By defining these changes, facial expressions can be recognized. In this study, a cascaded structure consists of Local Zernike Moments (LZM), Local XOR Patterns (LXP) and Global Zernike Moments (GZM) methods is proposed for the FER problem. The generally used database is the Extended Chon - Kanade (CK +) in FER problems. The database consists of image sequences of 327 expressions of 118 people. Most FER system includes recognition of 7 classes of emotions happiness, sadness, surprise, anger, disgust, fear and contempt, and we use Library of Support Vector Machines (LIBSVM) classifier for multi class classification with the leave one out cross-validation method. Our overall system performance is measured as 90.34% for FER.
  • Conference Object
    A Multiobjective Evolutionary Algorithm Approach for Map Sketch Generation
    (Springer International Publishing AG, 2017) Topcu, Şafak; Etaner-Uyar, A. Sima; 01. MEF University
    In this paper, we present a method to generate map sketches for strategy games using a state of the art many-objective evolutionary algorithm, namely NSGAIII. The map sketch generator proposed in this study outputs a three objective Pareto-front in which all the points are fair and strong in different aspects. The generated map sketch can be used by level designers to create real time strategy maps effectively and/or help them see multiple aspects of a game map simultaneously. The algorithm can also be utilised as a benchmark generator to be used in tests for various cases such as shortest path algorithms and strategy game bots. The results reported in this paper are very promising and promote further study.