https://reunir.unir.net/handle/123456789/11741 2024-11-05T02:09:47Z https://reunir.unir.net/handle/123456789/11766 IJIMAI Editor's Note - Vol. 4 Issue 4 González-Crespo, Rubén The research works presented in this issue are based on various topics of interest, among which are included: Radar Clutter, Radar Detectors Performance, Butterfly Optimization Algorithm, Artificial Bee Colony, Evolutionary strategy, Fractal Coding, User Experience, Handwritten Arabic Character Recognition, Feature Extraction, Embedded Hidden Markov Models, Artificial Immune System, Hopfield Neural Network, Browsers, Multimedia, MoCap and Animations. The International Journal of Interactive Multimedia and Artificial Intelligence provides an interdisciplinary forum in which scientists and professionals can share their research results and report new advances on Artificial Intelligence and Interactive Multimedia techniques. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T09:22:59Z No. of bitstreams: 1 ijimai20174_4_0_pdf_21297.pdf: 136392 bytes, checksum: 09a117c5edcf5d5f60455017fdeeb1d0 (MD5); Made available in DSpace on 2021-09-01T09:22:59Z (GMT). No. of bitstreams: 1 ijimai20174_4_0_pdf_21297.pdf: 136392 bytes, checksum: 09a117c5edcf5d5f60455017fdeeb1d0 (MD5) https://reunir.unir.net/handle/123456789/11765 Electronic Health Record in Bolivia and ICT: A Perspective for Latin America Gil, Eugenio; Medinaceli Díaz, Karina The emergence of new technologies in society through its application to many areas and very diverse realities is a clear element in the time in which we live. The health sector has been unable to escape this reality and has been renovated many of its traditional structures with new options brought by the application of information technology and communication (ICT) in areas such as management and hospital administration. This paper focuses on analyzing from the point of view of medical diagnosis the importance of electronic medical records as a unifying element of the information essential for this type of diagnosis, and the use of artificial intelligence techniques in this field. To this end the current situation of electronic medical records is analyzed in a country like Bolivia exhaustively analyzing three of the most important health centers. Is used for this unstructured interview experts on the subject reflect the current status of electronic medical records from the point of view of protection of the right to privacy of individuals and will serve as a model for development, not only in Bolivia but also in other Latin American countries. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T09:15:09Z No. of bitstreams: 1 ijimai20174_4_12_pdf_10368.pdf: 708446 bytes, checksum: 51063803031283f60fe20acc4d555473 (MD5); Made available in DSpace on 2021-09-01T09:15:09Z (GMT). No. of bitstreams: 1 ijimai20174_4_12_pdf_10368.pdf: 708446 bytes, checksum: 51063803031283f60fe20acc4d555473 (MD5) https://reunir.unir.net/handle/123456789/11764 Distributed Search Systems with Self-Adaptive Organizational Setups Wall, Friederike This paper studies the effects of learning-induced alterations of distributed search systems’ organizations. In particular, scenarios where alterations of the search-systems’ organizational setup are based on a form of reinforcement learning are compared to scenarios where the organizational setup is kept constant and to scenarios where the setup is changed randomly. The results indicate that learning-induced alterations may lead to high levels of performance combined with high levels of efficiency in terms of reorganization-effort. However, the results also suggest that the complexity of the underlying search problem together with the aspiration level (which drives positive or negative reinforcement) considerably shapes the effects of learning. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T08:25:43Z No. of bitstreams: 1 ijimai20174_4_11_pdf_14655.pdf: 2163734 bytes, checksum: 0dd5c562734cd510fab6695a21118aa3 (MD5); Made available in DSpace on 2021-09-01T08:25:43Z (GMT). No. of bitstreams: 1 ijimai20174_4_11_pdf_14655.pdf: 2163734 bytes, checksum: 0dd5c562734cd510fab6695a21118aa3 (MD5) https://reunir.unir.net/handle/123456789/11763 Simple MoCap System for Home Usage Magdin, Martin Nowadays many MoCap systems exist. Generating 3D facial animation of characters is currently realized by using the motion capture data (MoCap data), which is obtained by tracking the facial markers from an actor/actress. In general it is a professional solution that is sophisticated and costly. This paper presents a solution with a system that is inexpensive. We propose a new easy-to-use system for home usage, through which we are making character animation. In its implementation we paid attention to the elimination of errors from the previous solutions. In this paper the authors describe the method how motion capture characters on a treadmill and as well as an own Java application that processes the video for its further use in Cinema 4D. This paper describes the implementation of this technology of sensing in a way so that the animated character authentically imitated human movement on a treadmill. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T07:53:56Z No. of bitstreams: 1 ijimai20174_4_10_pdf_20085.pdf: 1323395 bytes, checksum: c0b805954cd5d60e06ef1e0d28967eb4 (MD5); Made available in DSpace on 2021-09-01T07:53:56Z (GMT). No. of bitstreams: 1 ijimai20174_4_10_pdf_20085.pdf: 1323395 bytes, checksum: c0b805954cd5d60e06ef1e0d28967eb4 (MD5) https://reunir.unir.net/handle/123456789/11762 Exploring the Relevance of Search Engines: An Overview of Google as a Case Study Gaona-García, Paulo Alonso; Montenegro-Marin, Carlos Enrique; Beltrán-Alfonso, Ricardo; Torres-Tautiva, Andres The huge amount of data on the Internet and the diverse list of strategies used to try to link this information with relevant searches through Linked Data have generated a revolution in data treatment and its representation. Nevertheless, the conventional search engines like Google are kept as strategies with good reception to do search processes. The following article presents a study of the development and evolution of search engines, more specifically, to analyze the relevance of findings based on the number of results displayed in paging systems with Google as a case study. Finally, it is intended to contribute to indexing criteria in search results, based on an approach to Semantic Web as a stage in the evolution of the Web. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T07:35:15Z No. of bitstreams: 1 ijimai20174_4_9_pdf_20273.pdf: 997606 bytes, checksum: 45b3ccecea9408667a0fbc3290693e04 (MD5); Made available in DSpace on 2021-09-01T07:35:15Z (GMT). No. of bitstreams: 1 ijimai20174_4_9_pdf_20273.pdf: 997606 bytes, checksum: 45b3ccecea9408667a0fbc3290693e04 (MD5) https://reunir.unir.net/handle/123456789/11761 Robust Artificial Immune System in the Hopfield network for Maximum k-Satisfiability Bin Mohd Kasihmuddin, Mohd Shareduwan; Bin Mansor, Mohd Asyraf; Sathasivam, Saratha Artificial Immune System (AIS) algorithm is a novel and vibrant computational paradigm, enthused by the biological immune system. Over the last few years, the artificial immune system has been sprouting to solve numerous computational and combinatorial optimization problems. In this paper, we introduce the restricted MAX-kSAT as a constraint optimization problem that can be solved by a robust computational technique. Hence, we will implement the artificial immune system algorithm incorporated with the Hopfield neural network to solve the restricted MAX-kSAT problem. The proposed paradigm will be compared with the traditional method, Brute force search algorithm integrated with Hopfield neural network. The results demonstrate that the artificial immune system integrated with Hopfield network outperforms the conventional Hopfield network in solving restricted MAX-kSAT. All in all, the result has provided a concrete evidence of the effectiveness of our proposed paradigm to be applied in other constraint optimization problem. The work presented here has many profound implications for future studies to counter the variety of satisfiability problem. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-01T07:26:43Z No. of bitstreams: 1 ijimai20174_4_8_pdf_92087.pdf: 879559 bytes, checksum: 6abe6d4ff7fc8d59886dfd6a78da9047 (MD5); Made available in DSpace on 2021-09-01T07:26:43Z (GMT). No. of bitstreams: 1 ijimai20174_4_8_pdf_92087.pdf: 879559 bytes, checksum: 6abe6d4ff7fc8d59886dfd6a78da9047 (MD5) https://reunir.unir.net/handle/123456789/11756 A Depth Video-based Human Detection and Activity Recognition using Multi-features and Embedded Hidden Markov Models for Health Care Monitoring Systems Jalal, Ahmad; Kamal, Shaharyar; Kim, Daijin Increase in number of elderly people who are living independently needs especial care in the form of healthcare monitoring systems. Recent advancements in depth video technologies have made human activity recognition (HAR) realizable for elderly healthcare applications. In this paper, a depth video-based novel method for HAR is presented using robust multi-features and embedded Hidden Markov Models (HMMs) to recognize daily life activities of elderly people living alone in indoor environment such as smart homes. In the proposed HAR framework, initially, depth maps are analyzed by temporal motion identification method to segment human silhouettes from noisy background and compute depth silhouette area for each activity to track human movements in a scene. Several representative features, including invariant, multi-view differentiation and spatiotemporal body joints features were fused together to explore gradient orientation change, intensity differentiation, temporal variation and local motion of specific body parts. Then, these features are processed by the dynamics of their respective class and learned, modeled, trained and recognized with specific embedded HMM having active feature values. Furthermore, we construct a new online human activity dataset by a depth sensor to evaluate the proposed features. Our experiments on three depth datasets demonstrated that the proposed multi-features are efficient and robust over the state of the art features for human action and activity recognition. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-30T09:57:59Z No. of bitstreams: 1 ijimai20174_4_7_pdf_14110.pdf: 1636117 bytes, checksum: f04c6ead3ff8b03e8a3170838932db5d (MD5); Made available in DSpace on 2021-08-30T09:57:59Z (GMT). No. of bitstreams: 1 ijimai20174_4_7_pdf_14110.pdf: 1636117 bytes, checksum: f04c6ead3ff8b03e8a3170838932db5d (MD5) https://reunir.unir.net/handle/123456789/11755 Handwritten Character Recognition Based on the Specificity and the Singularity of the Arabic Language Boulid, Youssef; Souhar, Abdelghani; Elyoussfi Elkettani, Mohamed A good Arabic handwritten recognition system must consider the characteristics of Arabic letters which can be explicit such as the presence of diacritics or implicit such as the baseline information (a virtual line on which cursive text are aligned and/join). In order to find an adequate method of features extraction, we have taken into consideration the nature of the Arabic characters. The paper investigate two methods based on two different visions: one describes the image in terms of the distribution of pixels, and the other describes it in terms of local patterns. Spatial Distribution of Pixels (SDP) is used according to the first vision; whereas Local Binary Patterns (LBP) are used for the second one. Tested on the Arabic portion of the Isolated Farsi Handwritten Character Database (IFHCDB) and using neural networks as a classifier, SDP achieve a recognition rate around 94% while LBP achieve a recognition rate of about 96%. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-30T09:40:28Z No. of bitstreams: 1 ijimai20174_4_6_pdf_26575.pdf: 2120039 bytes, checksum: 41a5c999103b8f0a5c30c313e02f503a (MD5); Made available in DSpace on 2021-08-30T09:40:28Z (GMT). No. of bitstreams: 1 ijimai20174_4_6_pdf_26575.pdf: 2120039 bytes, checksum: 41a5c999103b8f0a5c30c313e02f503a (MD5) https://reunir.unir.net/handle/123456789/11754 Construction of a Benchmark for the User Experience Questionnaire (UEQ) Schrepp, Martin; Thomaschewski, Jörg; Hinderks, Andreas Questionnaires are a cheap and highly efficient tool for achieving a quantitative measure of a product’s user experience (UX). However, it is not always easy to decide, if a questionnaire result can really show whether a product satisfies this quality aspect. So a benchmark is useful. It allows comparing the results of one product to a large set of other products. In this paper we describe a benchmark for the User Experience Questionnaire (UEQ), a widely used evaluation tool for interactive products. We also describe how the benchmark can be applied to the quality assurance process for concrete projects. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-30T08:57:55Z No. of bitstreams: 1 ijimai20174_4_5_pdf_94297.pdf: 816087 bytes, checksum: eb41ed08fbc7ba9cbdd397f9ca996b41 (MD5); Made available in DSpace on 2021-08-30T08:57:55Z (GMT). No. of bitstreams: 1 ijimai20174_4_5_pdf_94297.pdf: 816087 bytes, checksum: eb41ed08fbc7ba9cbdd397f9ca996b41 (MD5) https://reunir.unir.net/handle/123456789/11753 Modified Three-Step Search Block Matching Motion Estimation and Weighted Finite Automata based Fractal Video Compression Kamble, Shailesh; Thakur, Nileshsingh; Bajaj, Preeti The major challenge with fractal image/video coding technique is that, it requires more encoding time. Therefore, how to reduce the encoding time is the research component remains in the fractal coding. Block matching motion estimation algorithms are used, to reduce the computations performed in the process of encoding. The objective of the proposed work is to develop an approach for video coding using modified three step search (MTSS) block matching algorithm and weighted finite automata (WFA) coding with a specific focus on reducing the encoding time. The MTSS block matching algorithm are used for computing motion vectors between the two frames i.e. displacement of pixels and WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image (frame or motion compensated prediction error) based on the idea of fractal that the image has self-similarity in itself. The self-similarity is sought from the symmetry of an image, so the encoding algorithm divides an image into multi-levels of quad-tree segmentations and creates an automaton from the sub-images. The proposed MTSS block matching algorithm is based on the combination of rectangular and hexagonal search pattern and compared with the existing New Three-Step Search (NTSS), Three-Step Search (TSS), and Efficient Three-Step Search (ETSS) block matching estimation algorithm. The performance of the proposed MTSS block matching algorithm is evaluated on the basis of performance evaluation parameters i.e. mean absolute difference (MAD) and average search points required per frame. Mean of absolute difference (MAD) distortion function is used as the block distortion measure (BDM). Finally, developed approaches namely, MTSS and WFA, MTSS and FC, and Plane FC (applied on every frame) are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, akiyo, bus, mobile, suzie, traffic, football, soccer, ice etc. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio and Peak Signal to Noise Ratio (PSNR). The video compression using MTSS and WFA coding performs better than MTSS and fractal coding, and frame by frame fractal coding in terms of achieving reduced encoding time and better quality of video. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-30T08:08:58Z No. of bitstreams: 1 ijimai20174_4_4_pdf_24716.pdf: 2654890 bytes, checksum: 09f25512e539637b268c528d4d25831a (MD5); Made available in DSpace on 2021-08-30T08:08:58Z (GMT). No. of bitstreams: 1 ijimai20174_4_4_pdf_24716.pdf: 2654890 bytes, checksum: 09f25512e539637b268c528d4d25831a (MD5) https://reunir.unir.net/handle/123456789/11744 A Solution to the N-Queens Problem Using Biogeography-Based Optimization Habiboghli, Ali; Jalali, Tayebeh Biogeography-based Optimization (BBO) is a global optimization algorithm based on population, governed by mathematics of biogeography, and dealing with geographical distribution of biological organisms. The BBO algorithm was used in the present study to provide a solution for the N-queens problem. The performance of the proposed algorithm has been evaluated in terms of the quality of the obtained results, cost function, and execution time. Furthermore, the results of this algorithm were compared against those of genetic and particle swarm algorithms. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-26T12:31:22Z No. of bitstreams: 1 ijimai20174_4_3_pdf_22761.pdf: 865721 bytes, checksum: 2e7b7ce8732b9d0b13050789489be65f (MD5); Made available in DSpace on 2021-08-26T12:31:22Z (GMT). No. of bitstreams: 1 ijimai20174_4_3_pdf_22761.pdf: 865721 bytes, checksum: 2e7b7ce8732b9d0b13050789489be65f (MD5) https://reunir.unir.net/handle/123456789/11743 An Effective Hybrid Butterfly Optimization Algorithm with Artificial Bee Colony for Numerical Optimization Arora, Sankalap; Singh, Satvir In this paper, a new hybrid optimization algorithm which combines the standard Butterfly Optimization Algorithm (BOA) with Artificial Bee Colony (ABC) algorithm is proposed. The proposed algorithm used the advantages of both the algorithms in order to balance the trade-off between exploration and exploitation. Experiments have been conducted on the proposed algorithm using ten benchmark problems having a broad range of dimensions and diverse complexities. The simulation results demonstrate that the convergence speed and accuracy of the proposed algorithm in finding optimal solutions is significantly better than BOA and ABC. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-26T12:09:10Z No. of bitstreams: 1 ijimai20174_4_2_pdf_16914.pdf: 1855596 bytes, checksum: 61f04bbd0ce67d809c13ab724dc52518 (MD5); Made available in DSpace on 2021-08-26T12:09:10Z (GMT). No. of bitstreams: 1 ijimai20174_4_2_pdf_16914.pdf: 1855596 bytes, checksum: 61f04bbd0ce67d809c13ab724dc52518 (MD5) https://reunir.unir.net/handle/123456789/11742 CA-CFAR Adjustment Factor Correction with a priori Knowledge of the Clutter Distribution Shape Parameter Machado-Fernández, José Raúl; Bacallao-Vidal, Jesús Concepción; Torres Martinez, Shirley Oceanic and coastal radars operation is affected because the targets information is received mixed with and undesired contribution called sea clutter. Specifically, the popular CA-CFAR processor is incapable of maintaining its design false alarm probability when facing clutter with statistical variations. In opposition to the classic alternative suggesting the use of a fixed adjustment factor, the authors propose a modification of the CA- CFAR scheme where the factor is constantly corrected according on the background signal statistical changes. Mathematically translated as a variation in the shape parameter of the clutter distribution, the background signal changes were simulated through the Weibull, Log-Normal and K distributions, deriving expressions which allow choosing an appropriate factor for each possible statistical state. The investigation contributes to the improvement of radar detection by suggesting the application of an adaptive scheme which assumes the clutter shape parameter is known a priori. The offered mathematical expressions are valid for three false alarm probabilities and several windows sizes, covering also a wide range of clutter conditions. Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-08-26T11:59:27Z No. of bitstreams: 1 ijimai20174_4_1_pdf_69507.pdf: 957739 bytes, checksum: 13c49f7fe5ae6e09039492fe600bbbd6 (MD5); Made available in DSpace on 2021-08-26T11:59:27Z (GMT). No. of bitstreams: 1 ijimai20174_4_1_pdf_69507.pdf: 957739 bytes, checksum: 13c49f7fe5ae6e09039492fe600bbbd6 (MD5)