cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 66 Documents
 3   4   5   6   7 
Search results for , issue "Vol 24, No 2: November 2021" : 66 Documents clear
Video steganography using 3D distance calculator based on YCbCr color components Esraa Jaffar Baker; Adil Abbas Majeed; Sundos Abdulameer Alazawi; Shahreen Kasim; Rohayanti Hassan; Noor Hidayah Zakaria; Tole Sutikno
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp831-842

Abstract

Steganography techniques have taken a major role in the development in the field of transferring multimedia contents and communications. Therefore, field of steganography become interested as the need for security increased significantly. Steganography is a technique to hide information within cover media so that this media does not change significantly. Steganography process in a video is to hide the information from the intruder and prevent him access to that hidden information. This paper presents the algorithm of steganography in the video frames. The proposed algorithm selected the best frames to hide the message in video using 3D distance equation to increasing difficulty onto the intruder to detect and guess the location of the message in the video frames. As well as selected the best frames in this algorithm increased the difficulty and give us the best stego-video quality using structural similarity (SSIM). Also, the hash function was used to generate random positions to hide the message in the lines of video frames. The proposed algorithm evaluated with mean squared error (MSE), peak signalto-noise ratio (PSNR) and SSIM measurement. The results were acceptable and shows that is the difficulty of distinguishing the hidden message in stego-video with the human eye.
An ear recognition system based on local wavelet subband energy distribution Ruaa Isam Fadhil; Loay E. George
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp1212-1219

Abstract

The outer ear features have been used for many years in forensic science of recognition. Human ear is a valuable information provenance of data for individual identification/authentication. Ear meets biometric characteristic (universality, distinctiveness, permanence and collectability). Biometric system depending on ear image facing two major challenges; the first one is the localization of human ear area in given profile face image, and the second one is the selection of proper features to distinguish between individuals. In this work, we propose an alogorithm for ear recognition based on the local spatial energy distribution of wavelet sub-bands, because of wavelet transform has the ability to analyze the local feature of 2-D image by determining where the low frequency and high frequency areas are and it provides full description of the spatial distribution of the ear image. Nearest classifier are used to make a recognition decision in matching stage. The system was tested over a public database consist of 493 images. The attained recognition rate was (95.28%) and the achieved minimum equal error rate (EER) is 0.02%.
Automatic control of the sand granulation process to improve homogeneity in the manufacture of ceramic tiles Guillermo Morales-Romero; Adrián Quispe-Andía; Beatriz Caycho-Salas; Nicéforo Trinidad-Loli; César León-Velarde; Carlos Palacios-Huaraca; Omar Chamorro-Atalaya
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp762-770

Abstract

The purpose of this article is to quantify to what extent the design of an automatic control system for the clay sand granulation process will improve the percentage of homogeneity in the manufacture of ceramic tiles, through the analysis of the percentage of dust moisture. For which the process under study is initially described, identifying its stages, the control strategy to be used and its main characteristics. After conducting the research, it was determined that from the proposed control strategy, in which the flow of clay sand is controlled through frequency variators and the sequential injection of water spray through electric nozzles, it was achieved improve the homogeneity percentage by 94.78%, achieving that the error between the desired value and the present value of the humidity percentage is 0.015%, the approximation to the desired value or setpoint value being significant. Thus, it was also possible to determine that through an analysis of the dispersion model, that the collected data respond to a constant; evidencing that there is no sudden variation in the percentage of homogeneity during the automated operation of the process, which validates the improvement of homogeneity in the manufacture of ceramic tiles.
Feature extraction with mel scale separation method on noise audio recordings Roy Rudolf Huizen; Florentina Tatrin Kurniati
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp815-824

Abstract

This paper focuses on improving the accuracy of noise audio recordings. High-quality audio recording, extraction using the mel frequency cepstral coefficients (MFCC) method produces high accuracy. While the low-quality is because of noise, the accuracy is low. Improved accuracy by investigating the effect of bandwidth on the mel scale. The proposed improvement uses the mel scale separation methods into two frequency channels (MFCC dual-channel). For the comparison method using the mel scale bandwidth without separation (MFCC single-channel). Feature analysis using k-mean clustering. The data uses a noise variance of up to -16 dB. Testing on the MFCC single-channel method for -16 dB noise has an accuracy of 47.5%, while the MFCC dual-channel method has an accuracy better of 76.25%. The next test used adaptive noise-canceling (ANC) to reduce noise before extraction. The result is that the MFCC single-channel method has an accuracy of 82.5% and the MFCC dual-channel method has an accuracy better of 83.75%. High-quality audio recording testing for the MFCC single-channel method has an accuracy of 92.5% and the MFCC dual-channel method has an accuracy better of 97.5%. The test results show the effect of mel scale bandwidth to increase accuracy. The MFCC dual-channel method has higher accuracy.
Proposed emerged and enhanced routing protocols for wireless networks Dheyaa Jasim Kadhim; Ali Abdulwahhab Mohammed
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp871-879

Abstract

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.
Dropout, a basic and effective regularization method for a deep learning model: a case study Brahim Jabir; Noureddine Falih
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp1009-1016

Abstract

Deep learning is based on a network of artificial neurons inspired by the human brain. This network is made up of tens or even hundreds of "layers" of neurons. The fields of application of deep learning are indeed multiple; Agriculture is one of those fields in which deep learning is used in various agricultural problems (disease detection, pest detection, and weed identification). A major problem with deep learning is how to create a model that works well, not only on the learning set but also on the validation set. Many approaches used in neural networks are explicitly designed to reduce overfit, possibly at the expense of increasing validation accuracy and training accuracy. In this paper, a basic technique (dropout) is proposed to minimize overfit, we integrated it into a convolutional neural network model to classify weed species and see how it impacts performance, a complementary solution (exponential linear units) are proposed to optimize the obtained results. The results showed that these proposed solutions are practical and highly accurate, enabling us to adopt them in deep learning models.
Sidelobe level minimization for uniform circular smart antenna array using cultural algorithm Asma Issa Mohsin; Asaad S. Daghal; Adheed Hasan Sallomi
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp930-936

Abstract

Cultural algorithm (CA) is a new evolutionary program inspired by sociology and archaeology theories that assisting formulating cultural evaluation. Its use to solve optimization problems. This paper analyzed the beamforming of a uniform circular antenna array (UCAA) via using the CA algorithm. The sidelobe level (SLL) is minimized by adjusting the appropriate weight for each element. In addition, the optimal beam pattern is achieved by using CA for UCAA, which means that the main beam is steering to the desired user, while the nulls represent the interference signals. The excitation amplitude is supposed to be constant while the elements are assumed isotropic. The circular array number elements and the interspacing distance between them are setting as optimization parameters. The simulation results show that the CA rationally reacts to the changing environments, and it is valuable for SLL reduction. A −25 dB of relative SLL is achieved under beam scanning (0º) and (15º), respectively.
Artificial neural network based meta-heuristic for performance improvement in physical internet supply chain network Chouar Abdelsamad; Tetouani Samir; Soulhi Aziz; Elalami Jamila
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp1161-1172

Abstract

Nowadays, reducing total costs while enhancing customer satisfaction is a major task for many supply chain systems. To deal with this issue, the physical internet (PI) paradigm can be represented as a potential replacement for the current logistics system. This paper devoted the cost reduction and lead time improvement in a PI-SCN using a hybrid framework based on an artificial neural network (ANN) and an improved slime mould algorithm (ISMA). To address the performance of the proposed framework, a real-case study in Morocco is considered. The new trainer ISMA’s performance has been investigated in three approximation datasets from the University of California at Irvine (UCI) machine-learning repository regarding nine recent metaheuristics. The experimental results highlight the effectiveness of ISMA according to other meta heuristics for training feed-forward neural networks (FNNs) to converge speed and to avoid local minima.
Review on path planning algorithm for unmanned aerial vehicles Nurul Saliha Amani Ibrahim; Faiz Asraf Saparudin
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp1017-1026

Abstract

The path planning problem has been a crucial topic to be solved in autonomous vehicles. Path planning consists operations to find the route that passes through all of the points of interest in a given area. Several algorithms have been proposed and outlined in the various literature for the path planning of autonomous vehicle especially for unmanned aerial vehicles (UAV). The algorithms are not guaranteed to give full performance in each path planning cases but each one of them has their own specification which makes them suitable in sophisticated situation. This review paper evaluates several possible different path planning approaches of UAVs in terms optimal path, probabilistic completeness and computation time along with their application in specific problems.
Modern tools and current trends in web-development Debani Prasad Mishra; Kshirod Kumar Rout; Surender Reddy Salkuti
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp978-985

Abstract

In this paper, a social media platform like LinkedIn and Facebook is made using MongoDB as a database. This paper aims to touch all the modern tools required to make an efficient web app, keeping in mind both the customer satisfaction and the ease for the developers to make their web designs, front-end and back-end. In this application, a user could make an account, add or delete details of their profile, education, and experience fields. The users could post, also comment and even like a post of other users. A monolithic architectural approach is used for simplicity in maintaining the database. Postman application programming interface (API) was used to check the working of the back-end. Git, Github, and Heroku were used to deploy the website. Node package manager (NPM) packages like bcrypt and validator are used to encrypt passwords and to validate a user during login. Media queries are used in cascading style sheets (CSS) to achieve a responsive design. Therefore, the users could view the website through a mobile phone, i-pad and also a personal computer (PC), maintaining the readability and design across all these devices.

Page 6 of 7 | Total Record : 66

 3   4   5   6   7 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue