Players may cease from playing a chosen gamesooner than expected for many reasons. One of the mostimportant is related to the way game designers and developerscalibrate game challenge levels. In practice, players havedifferent skill levels and may find usual predetermined difficultlevels as too easy or too hard, becoming frustrated or bored. The result may be decreased motivation to keep on playingthe game, which means reduced engagement. An approachto mitigate this issue is dynamic game difficulty balancing(DGB), which is a process that adjusts gameplay parametersin real-time according to the current player skill level. Inthis paper we propose a real-time solution to DGB usingEvolutionary Fuzzy Cognitive Maps, for dynamically balancinga game difficulty, helping to provide a well balanced level ofchallenge to the player. Evolutionary Fuzzy Cognitive Maps arebased on concepts that represent context game variables andare related by fuzzy and probabilistic causal relationships thatcan be updated in real time. We discuss several simulationexperiments that use our solution in a runner type game tocreate more engaging and dynamic game experiences.
Due to the advancement of computing and the power of the new hardware, more economical, it is now feasible to have thousands of images which can be analyzed to allow classification for its shape and/or color. Furthermore, techniques and efficiency of the classification depends on the characteristics to be obtained of images in order to compare and classify them according to their similarity. Some images, such as model cars, planes and boats, can be discriminated by their shape. However, other images such as butterfly species where the shape is similar, the color plays an important role in the discrimination task. In this research we propose a novel approach to extract distinctive features of images by combining the HSV color model and wavelets filters. Furthermore, we investigate the best combination of features color and form. Experiments have shown improved performance by combining the HSV color model with Gabor wavelets.
18 November 2016 in Journal on Interactive Systems
Fuzzy Cognitive Maps (FCM) is a paradigm used to represent knowledge in a simple and concise way, expressing the grade of relation that exists between concepts and causal relationships. Due to its flexibility, FCM has been successfully applied in numerous applications in diverse research fields, such as, robotics, medical diagnosis, decision problems in information technology, games, and so forth. However, one critical drawback is the determination of the weights in the representation graph, which is generally done by an expert. The present paper proposes a semi-automated method for calibrating the weights in a solution for the problem of dynamic game difficulty balancing (DGB) using Evolutionary Fuzzy Cognitive Maps (E-FCM). The proposed algorithm adjusts the weights in real time, ensuring an equilibrium between the values generated according to the expert’s contribution (based on a static analysis) and the changes produced in the values of the concepts by the calibration process during the simulation (a dynamic analysis).
14 February 2014 in International Journal of Computer Applications
Due to the increasing amount of data and the reduction of costs in 3D data acquisition devices, there has been a growing interest, in developing efficient and robust feature extraction algorithms for 3D shapes, invariants to isometric, topological and noise changes, among others. One of the key tasks for feature extraction in 3D shapes is the interest points detection; where interest points are salient structures, which can be used, instead of the whole object. In this research, we present a new approach to detect interest points in 3D shapes by analyzing the triangles that compose the mesh which represent the shape, in different way to other algorithms more complex such as Harris 3D or HKS. Our results and experiments of repeatability, confirm that our algorithm is stable and robust, in addition, the computational complexity is O(n log n), where n represents the number of faces of the mesh.