cover
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
ISSN : 20888708     EISSN : 27222578     DOI : -
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Articles 6,301 Documents
Deep reinforcement learning based quality of experience aware for multimedia video streaming Reddy, Manjunatha Peddareddygari Bayya; Narayanappa, Sheshappa Shagathur
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 5: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i5.pp5209-5220

Abstract

Video streaming involves the continuous delivery of video files from a server to a client, where multimedia streaming is employed for playback through an online or offline media player. Video streaming uses live broadcasts to enhance direct communication with community partners and customers. The existing methods have less video streaming quality and are unable to efficiently adapt to the dynamic conditions of the network. In this research, an adaptive bit rate (ABR) method depending on dynamic adaptive video streaming over hypertext transfer protocol or HTTP (DASH) based deep reinforcement learning (DRL) named DASH-based DRL is proposed to determine the following segment’s quality in DASH video streaming with wireless networks. The proposed algorithm significantly improves the quality of experience (QoE) performance by providing a highly stable video quality, reducing the distance factor, and enduring smooth streaming sessions. The performance of the proposed method is analyzed based on performance measures of performance improvement, QoE metrics, mean opinion score, normalized value of QoE, average of normalized value of QoE, switching quality, and rebuffering time. The suggested algorithm obtains a high average normalized QoE of 0.72, average switching quality of 0.15, and an average rebuffering time of 0.16 sec, which is comparatively superior to other algorithms like real-time streaming protocol (RTSP), HTTP live streaming (HLS) and reinforcement learning (RL).
Multi-task learning using non-linear autoregressive models and recurrent neural networks for tide level forecasting Nikentari, Nerfita; Wei, Hua-Liang
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i1.pp960-970

Abstract

Tide level forecasting plays an important role in environmental management and development. Current tide level forecasting methods are usually implemented for solving single task problems, that is, a model built based on the tide level data at an individual location is only used to forecast tide level of the same location but is not used for tide forecasting at another location. This study proposes a new method for tide level prediction at multiple locations simultaneously. The method combines nonlinear autoregressive moving average with exogenous inputs (NARMAX) model and recurrent neural networks (RNNs), and incorporates them into a multi-task learning (MTL) framework. Experiments are designed and performed to compare single task learning (STL) and MTL with and without using non-linear autoregressive models. Three different RNN variants, namely, long short-term memory (LSTM), gated recurrent unit (GRU) and bidirectional LSTM (BiLSTM) are employed together with non-linear autoregressive models. A case study on tide level forecasting at many different geographical locations (5 to 11 locations) is conducted. Experimental results demonstrate that the proposed architectures outperform the classical single-task prediction methods.
A hybrid approach using convolutional neural networks and genetic algorithm to improve of sensing brain tumor prediction Ettakifi, Hamza; Tkatek, Said
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp4325-4335

Abstract

Brain tumor is the most constantly diagnosed cancer, and the opinion of the brain is veritably sensitive and complex, which is the subject of numerous studies and inquiries. In computer vision, deep literacy ways, similar as the convolutional neural network (CNN), are employed due to their bracket capabilities using learned point styles and their capability to work with complex images. still, their performance is largely dependent on the network structure and the named optimization system for tuning the network parameters. In this paper, we present new yet effective styles for training convolutional neural networks. The maturity of current state-of-the-art literacy styles for convolutional neural networks are grounded on grade descent. In discrepancy to traditional convolutional neural network training styles, we propose an enhancement by incorporating the inheritable algorithm for brain tumor prediction. Our work involves designing a convolutional neural network model to grease the bracket process, training the model using different optimizers (Adam and the inheritable algorithm), and assessing the model through colorful trials on the brain magnetic resonance imaging (MRI) dataset. We demonstrate that the convolutional neural network model trained using the inheritable algorithm performs as well as the Adam optimizer, achieving a bracket delicacy of 99.5.
An improved mining image segmentation with K-Means and morphology using drone dataset Haqiq, Nasreddine; Zaim, Mounia; Sbihi, Mohamed; El Alaoui, Mustapha; Masmoudi, Lhoussaine; Echarrafi, Hamza
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i3.pp2655-2675

Abstract

The mining industry faces the challenge of incorporating advanced technology to explore new ways of increasing productivity and reducing costs. Our focus is on integrating drone technology to revolutionize mining tasks like inspection, mapping, and surveying. Drones offer a precision advantage over traditional satellite methods. To this end, we have created a dataset consisting of 373 aerial images captured by a DJI Phantom 4 drone, which depict a mining site in the Benslimane region of Western Morocco. These images, with a ground resolution of 2.5 cm per pixel, are the basis of our research. Our study aims to address the challenges posed by traditional mining techniques and to leverage technological innovations to improve segmentation and classification. The proposed approach includes new methodologies, particularly the combination of K-Means clustering and mathematical morphology, to overcome limitations and deliver better segmentation results. Our findings represent a significant step forward in advancing mining operations through the effective use of modern technologies.
PdM-FSA: predictive maintenance framework with fault severity awareness in Industry 4.0 using machine learning Moulla, Donatien Koulla; Mnkandla, Ernest; Aboubakar, Moussa; Abba Ari, Ado Adamou; Abran, Alain
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 6: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i6.pp7211-7223

Abstract

Predictive maintenance contributes to Industry 4.0, as it enables a decrease in maintenance costs and downtime while aiming to increase production and return on investment. Despite the increasing utilization of machine learning techniques in predictive maintenance in industrial systems over the past few years, several challenges remain to be addressed in the implementation of ML, including the quality of the data collected, resource constraints, and equipment heterogeneity. This study proposes an adaptive framework for predictive maintenance in the context of Industry 4.0, specifically in internet of things (IoT) systems, using machine learning (ML) models. In particular, this study introduces PdM-FSA, a new framework based on an ensemble classifier that takes advantage of four widely adopted ML models in the predictive maintenance literature: random forest (RF), support vector machine (SVM), extreme gradient boosting (XGBoost), and k-nearest neighbors (KNN). The performance evaluation results showed that the PdM-FSA framework can perform well for predictive maintenance according to the severity of equipment malfunctions in a smart factory. The results of this study provide significant knowledge to researchers and practitioners on predictive maintenance in the context of Industry 4.0. and enables the optimization of processes and improves productivity.
Comparison of Iris dataset classification with Gaussian naïve Bayes and decision tree algorithms Dani, Yasi; Artanta Ginting, Maria
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1959-1968

Abstract

In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GNB) and the decision tree (DT) classifiers. The Gaussian naïve Bayes classifier is a probability-based classification model that predicts future probabilities based on past experiences. Whereas the decision tree classifier is based on a decision tree, a series of tests that are performed adaptively where the previous test affects the next test. Both of these methods are simulated on the Iris dataset where the dataset consists of three types of Iris: setosa, virginica, and versicolor. The data is divided into two parts, namely training and testing data, in which there are several features as information on flower characteristics. Furthermore, to evaluate the performance of the algorithms on both methods and determine the best algorithm for the dataset, we evaluate it using several metrics on the training and testing data for each method. Some of these metrics are recall, precision, F1-score, and accuracy where the higher the value, the better the algorithm's performance. The results show that the performance of the decision tree classifier algorithm is the most outperformed on the Iris dataset.
Novel cryptosystem integrating the Vigenere cipher and one Feistel round for color image encryption Tabti, Hassan; El Bourakkadi, Hamid; Chemlal, Abdelhakim; Jarjar, Abdellatif; Najah, Said; Zenkouar, Khalid
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 5: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i5.pp5701-5714

Abstract

The present research will propose an innovative technique for pixel-level encryption of color images. After isolating the R, G, and B channels and converting them into vector mode, an enhanced Feistel network will be applied at the hexadecimal level, facilitated by integrating a substitution table generated from the employed chaotic maps. This is followed by a binary conversion and a shift ensured by pseudo-random vectors. A diffusion function is applied, incorporating another replacement matrix constructed from commonly used chaotic maps in cryptography. This operation links the cipher pixel to the next pixel, thereby reinforcing the avalanche effect and safeguarding the system against any differential attacks. Simulations conducted using our new system on various color images, arbitrarily selected from multiple databases, have yielded satisfactory and highly promising results.
Land scene classification from remote sensing images using improved artificial bee colony optimization algorithm Gowda Ganashree, Kamenahalli Chandre; Hemavathy, Ramakrishna; Ramakrishna Anala, Maddur
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i1.pp347-357

Abstract

The images obtained from remote sensing consist of background complexities and similarities among the objects that act as challenge during the classification of land scenes. Land scenes are utilized in various fields such as agriculture, urbanization, and disaster management, to detect the condition of land surfaces and help to identify the suitability of the land surfaces for planting crops, and building construction. The existing methods help in the classification of land scenes through the images obtained from remote sensing technology, but the background complexities and presence of similar objects act as a barricade against providing better results. To overcome these issues, an improved artificial bee colony optimization algorithm with convolutional neural network (IABC-CNN) model is proposed to achieve better results in classifying the land scenes. The images are collected from aerial image dataset (AID), Northwestern Polytechnical University-Remote Sensing Image Scene 45 (NWPU-RESIS45), and University of California Merced (UCM) datasets. IABC effectively selects the best features from the extracted features using visual geometry group-16 (VGG-16). The selected features from the IABC are provided for the classification process using multiclass-support vector machine (MSVM). Results obtained from the proposed IABC-CNN achieves a better classification accuracy of 96.40% with an error rate 3.6%.
Design of a perturb and observe and neural network algorithms-based maximum power point tracking for a grid-connected photovoltaic system Salem, Ahmed Ali; Ismail, Mohamed Mahmoud; Zedan, Honey Ahmed; Elnaghi, Basem Elhady
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 4: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i4.pp3674-3687

Abstract

Integrating photovoltaic systems (PV) into the grid has garnered significant attention due to increasing interest in renewable energy sources. Maximizing the PV systems output power is crucial for improving energy efficiency and reducing operating costs. This paper presents a comparative analysis of two different techniques of maximum power point tracking (MPPT): perturb and observe (P&O) and artificial neural network (ANN) MPPT, focusing on their application in grid-connected PV systems. The paper evaluates their performance under various operating conditions, including changes in irradiance and temperature, that are discussed in three cases. The comparative analysis includes metrics such as voltage regulation and powerloss. MATLAB Simulink is utilized to implement P&O and ANN MPPT methods, which include a PV cell connected to an MPPT-controlled boost converter. The simulation demonstrates the power loss of the PV model as well as the voltage regulation in the three cases for the two methods. The results obtained in simulation and implementations show that the ANN method outperforms the P&O in the three cases discussed in terms of powerloss, voltage regulation, and efficiency. The results also show that the change in output power from PV is noticeable when compared to changes in radiation, while the change is slight when temperatures change.
Low-power body-coupled transceiver for miniaturized body area networks Nataraju, Chaitra Soppinahally; Karanam Sreekantha, Desai; V. S. S. S. S.Sairam, Kanduri
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i3.pp3522-3532

Abstract

As wearable devices continue to proliferate, seamlessly integrating them into wireless body-area networks (WBANs) becomes increasingly crucial. Body-coupled communication (BCC) emerges as a promising WBAN technology, utilizing the human body itself as a transmission channel. This paper presents a novel BCC transceiver designed for efficiency and miniaturization. The proposed transceiver prioritizes reliable data transmission with a convolutional encoder. It leverages a simple direct digital synthesizer (DDS) for frequency shift keying (FSK) modulation, minimizing chip area. At the receiver, a Viterbi decoder (VD) ensures accurate data recovery. This design shines in its resource efficiency. It occupies less than 1% of an Artix-7 FPGA, operates at 268.77 MHz with a mere 111 mW power consumption, and achieves a remarkable data rate of 13.78 Mbps. This translates to a hardware efficiency of 44.46 Kbps/slice, surpassing existing transceivers. Moreover, the BCC transceiver exhibits a stellar bit error rate (BER) of over 10⁻⁷ under realistic body channel conditions. Overall, this work presents a highly efficient BCC transceiver with significant improvements in chip area, power consumption, and data rate compared to existing designs. This paves the way for practical and miniaturized WBAN solutions for future wearable applications.

Filter by Year

2011 2026


Filter By Issues
All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue