cover
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
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,138 Documents
Enhanced vegetation encroachment detection along power transmission corridors using random forest algorithm Somasundaram, Deepa; Sivaraj, Nivetha; Shalinirajan, Shalinirajan; Karuppiah, Santhi; Rajendran, Sudha
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 2: May 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i2.pp1376-1382

Abstract

Vegetation encroachment along power transmission corridors poses significant risks to infrastructure safety and reliability, necessitating effective monitoring and management strategies. This study introduces an innovative methodology for detecting vegetation encroachment using a combination of manual and automatic processes integrated with the random forest algorithm. The issue of vegetation encroachment is critical as it can lead to power interruptions and safety hazards if not addressed promptly. The objective of this research is to develop a scalable and cost-effective solution for vegetation management in power infrastructure maintenance. The methodology involves manual patch extraction and labeling to ensure the accuracy of the training dataset, combined with automatic feature extraction techniques to capture relevant information from satellite imagery. Leveraging the random forest algorithm, the model constructs an ensemble of decision trees based on the extracted features, achieving robust classification accuracy. Findings from this study demonstrate that the proposed approach enables consistent and timely identification of vegetation encroachment in new satellite imagery. Stored model parameters facilitate efficient testing, enhancing the system's ability to provide proactive interventions. This scalable solution significantly reduces reliance on manual labor and offers a cost-effective method for continuous monitoring, ultimately contributing to the resilience and safety of power transmission infrastructure.
Design and simulation of a double boost switched capacitor multilevel inverter Khadar, Shaik Abdul; Shuaib, Yassin Mohamed; Arun, Vijayakumar; Karakilic, Murat; Rahul, Jammy Ramesh
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i3.pp1450-1462

Abstract

This article presents an innovative boost inverter configuration that produces a nine-level double voltage augmentation waveform. A significant drawback of conventional multilevel inverters (MLIs) lies in their dependence on conversion for elevating the voltage, particularly applied in conjunction with renewable energy sources. The proposed methodology, characterized by its double voltage boosting capacity, mitigates this challenge by automatically enhancing the input voltage. Switched-capacitor multilevel inverters (SCMLIs) represent a prevalent category within the realm of MLIs. This paper presents a double boost switched capacitor inverter (DB-SCI) designed to address critical issues involving the increased use of semiconductor switches, DC sources, and capacitors. The proposed DB-SCI achieves a nine-level resultant voltage utilizing a single DC source, 8 switches, and 3 capacitors. It can amplify the output voltage with a gain of two. Moreover, the DB-SCI employs a level-shifted pulse width modulation (PWM) approach to augment the resultant voltage and enhance the output voltage's quality. The article assesses the effectiveness and feasibility of the DB-SCI under various modulation indices using MATLAB/Simulink. The comparison study of MLI topologies is presented.
Influences of the Sm3+ -Eu3+ codoped Ba2Gd(BO3)2Cl phosphors on the commercial white light emitting diodes Quan, Luu Hong; Nguyen Thi, My Hanh
Indonesian Journal of Electrical Engineering and Computer Science Vol 39, No 1: July 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v39.i1.pp62-69

Abstract

The color quality of current commercial white light emitting diodes (wLEDs) suffers low performance owing to the lack of the red-emission component. Developing quality and stable red-emission phosphors is feasible among various approaches to obtain the red spectral supplement for the w-LEDs in the pursuit of color quality improvement. In this paper, the Sm3+-Eu3+ codoped Ba2Gd(BO¬3)2Cl (BGBC:Sm-Eu) red phosphor was proposed for using in commercial w-LEDs. Its luminescence and influences on w-LED properties were simulated and presented. The solid-phase method was utilized for the fabrication of the phosphor. The results indicated that the phosphor emitted the strong emission in orange-red region with a peak centering at 593 nm. It can be caused by the proficient power shift between Sm3+ and Eu3+. In the w-LED package, the presence of BGBC:Sm-Eu phosphor stimulated the scattering efficiency to promote the blue-light conversion and extraction. The orange emission spectrum of the w-LED increased with the higher BGBC:Sm-Eu doping amount. The luminous strength of the w-LED was enhanced and so was the color temperature uniformity. The color rendering properties declined with high BGBC:Sm-Eu phosphor concentration owing to the red-light dominance over the light spectrum. The BGBC:Sm-Eu phosphor is a promising red phosphor for improving commercial w-LED color-temperature stability and luminosity. It also helps to obtain full-spectrum w-LED with high color rendition when combined with other blue-to-green luminescent materials.
Enhancing vocational computer engineering education with a GPT-driven speech recognition tool Eka Sakti, Putra Utama; Muhammad, Alva Hendi; Nasiri, Asro
Indonesian Journal of Electrical Engineering and Computer Science Vol 39, No 1: July 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v39.i1.pp564-574

Abstract

This research investigates the effectiveness of an AI-driven speech recognition and GPT-powered learning tool in enhancing vocational students’ proficiency in computer networks. The study involved 100 students from vocational hig school, who used the prototype as part of their learning process. A pre-test/post-test design was employed to assess changes in proficiency, and students also provided feedback on the tool’s usability and impact. The results showed a consistent improvement in proficiency across all classes. A strong positive correlation was found between students’ feedback and their proficiency improvement, suggesting that students who rated the prototype as Very Helpful were more likely to see significant learning gains. However, the correlation between time spent using the tool and proficiency improvement was minimal, indicating that the quality of engagement with the tool was more important than the duration of usage. These findings highlight the prototype’s potential to improve vocational learning outcomes and underscore the importance of user satisfaction in driving success, with future refinements necessary to ensure the tool’s broader effectiveness across different learning contexts.
Plagiarism detection in verilog and textual content using linguistic features V., Sathya; C., Nalayini; Kumar, M. Kiran; G., Kumar; Babu M., Dinesh
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i3.pp1924-1935

Abstract

The illicit act of appropriating programming code has long been an appealing notion due to the immediate time and effort savings it affords perpetrators. However, it is universally acknowledged that concerted efforts are imperative to identify and rectify such transgressions. This is particularly crucial as academic institutions, including universities, may inadvertently confer degrees for work tainted by this form of plagiarism. Consequently, the primary objective of this research is to scrutinize the feasibility of identifying plagiarism within pairs of Verilog algorithms and texts. this study aims to detect plagiarism in textual content and Verilog code by leveraging diverse linguistic characteristics from the WordNet lexical database. The primary objective is to achieve optimal accuracy in identifying instances of plagiarism, incorporating features such as modifications to text structure, synonym substitution, and simultaneous application of these strategies. The system's architecture is intricately designed to unveil instances of plagiarism in both textual content and Verilog code by extracting nuanced characteristics. The systematic process includes preprocessing, detailed analysis, and post-processing, supported by a feature-rich database. Each entry in the database represents a distinctive similarity case, contributing to a thorough and comprehensive approach to plagiarism detection.
Novel prostate cancer detection and classification model using support vector machine Sujata, Kandukuri; Sridhar, Bokka; Prasad, Avala Mallikarjuna
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i3.pp1681-1689

Abstract

Prostate cancer (PCa) is one of the most common and deadliest cancers that kill men worldwide with high mortality and prevalence especially in developed countries. PCa is regarded as one of the most prevalent cancers and is one of the main causes of deaths worldwide. Early detection of PCa diseases helps in making decisions about the progressions that should have occurred in high-risk patients decrease their risks. The recent developments in technology and methods have given rise to computer aided diagnosis (CAD). Early cancer detection can greatly increase the chance of survival through the administration of the proper treatment. Due to the emerging trends and available datasets in state-of-art machine learning (ML) and deep learning (DL) techniques, there has been significant growth in recent disease prediction and classification publications. This paper presents a unique support vector machine-based model for PCa detection and classification. This analysis aims to classify the PCa using ML algorithm and to determine the risk factors. Support vector machines (SVM) is used to identify and classify the PCa. Accuracy, sensitivity, specificity, precision, and F1-score are the measurements used to evaluate the performance of the presented method. This model will achieve accuracy, sensitivity, specificity, precision, and F1-score than earlier models.
SVM algorithm-based anomaly detection in network logs and firewall logs Jesudasan Peter, John Benito; Rakesh, Nitin; Rekha, Puttaswamy; Sreelatha, Tammineni; Sujatha, Velusamy; Muthumarilakshmi, Surulivelu; Sujatha, Shanmugam
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i3.pp1642-1651

Abstract

The purpose of many advanced forms of cyberattack is to deceive the monitors, and as a result, these attacks often involve several kinds, levels, and stages. Existing anomaly detection systems often examine logs or traffic for indications of attacks, ignoring any additional analysis regarding attack procedures. This is done to save time. For example, traffic detection technologies can only identify the attack flows in a general sense. Still, they cannot reconstruct the attack event process or expose the present condition of the network node. In addition, the logs kept by the firewall are significant sources of evidence; nevertheless, they are still challenging to decipher. This paper introduces support vector machine algorithm-based Anomaly detection (SVMA) in network logs and firewall logs to provide robust security against cyberattacks. This mechanism consists of three modules: preprocessing, feature selection and anomaly detection. The genetic algorithm (GA) selects the better feature from the input. Finally, the support vector machine (SVM) isolates an anomaly powerfully. The investigational outcomes illustrate that the SVMA minimizes the required time to select the features and enhances the detection accuracy.
Geographic information system for marine ecotourism and rural lifestyle in Prachuap Khiri Khan Puengsom, Sompond; Polpong, Jakkapong; Pornpongtechavanich, Phisit
Indonesian Journal of Electrical Engineering and Computer Science Vol 39, No 1: July 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v39.i1.pp485-496

Abstract

According to the Prachuap Khiri Khan Province tourism statistics report for 2023, there were 11,143,079 Thai and foreign tourists from January to December 2023, which increased by 1,395,195 people or 14.31 percent compared to 2022. Simultaneously, tourist attractions accumulated tourism income in 2023 totaling 44,241 million baht, marking an increase of 11,402.63 million baht or 34.72 percent from 2022. Despite this growth, tourist attractions that are popular with tourists remain centered in Hua Hin District due to a lack of publicity and insufficient information provided to tourists. Consequently, the researcher intended to develop a geographic information system (GIS) for marine ecotourism and rural lifestyles in Prachuap Khiri Khan Province to promote rural tourist attractions and distribute tourism income to the community. The system utilized the classification (precision and recall) model and was developed using ArcGIS and the web app builder ArcGIS. Findings from 8 experts in computers, information technology (IT), and GIS indicated that the overall system efficiency had an average of 4.54 and a standard deviation of 0.50. Additionally, results from the study on retrieval efficiency using the classification (precision and recall) model revealed a precision value of 0.90 and a recall value of 0.95.
Internet of things based smart agriculture using K-nearest neighbor for enhancing the crop yield Dasari, Kalyankumar; Kharde, Mukund Ramdas; Maddileti, Kuruva; Pasupuleti, Venkat Rao; Ram, Mylavarapu Kalyan; Sujana, Challapalli; Komali, Govindu; Fariddin, Shaik Baba
Indonesian Journal of Electrical Engineering and Computer Science Vol 39, No 1: July 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v39.i1.pp436-445

Abstract

Agriculture is one of the major occupations in India and is one of the significant contributors to the economy of India. The agriculture plays a vital role in country gross domestic product (GDP) and is also part of civilization. The production of crop influences the economies of countries. However, still the agriculture filed stands technologically backward. In addition, the lack of favourable weather conditions might result loss of crops yields. The farmers need awareness about their soils, timely weather updates and techniques to improve their soil for growing healthy crops. Hence it is essential to develop a system which can technologically support the farmers for suggesting the crop and improving crop yields. With the development of electronics, researchers have been developed many applications and micro controllerbased systems to do agricultural operations. The internet of things (IoT) has opened many opportunities to design and implements a smart agriculture system and machine learning (ML) algorithm can help to obtain accurate performance. Hence, in this analysis, IoT based smart agriculture using K-nearest neighbor (KNN) for enhancing the crop yields is presented. With the combination of IoT and ML algorithm this system is designed which integrates primary agriculture operations such as recommendation of crops, automated watering and fertilizers recommendation.
Skin cancer disease analysis using classification mechanism based on 3D feature extraction Srikanteswara, Ramya; A. C., Ramachandra
Indonesian Journal of Electrical Engineering and Computer Science Vol 38, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v38.i3.pp2012-2019

Abstract

Dermoscopic image analysis is essential for effective skin cancer diagnosis and classification. Extensive research work has been carried out on dermoscopic image classification for the early detection of skin cancer. However, most of the research works are concentrated on 2D features. Therefore, a 3D lesion establishment mechanism is presented in this work to generate 3D features from the obtained 3D lesions. The objective of this work is to reconstruct 3D lesion image from 2D lesion images and a multispectral reference IR light image. The 3D lesion establishment is achieved by designing an efficient convolutional neural network (CNN) architecture. Details of CNN design architecture are discussed. After reconstruction of 3D lesions, 2D and 3D features are extracted and classification is performed on the obtained 2D and 3D features. Classification performance is evaluated using the images from PH2 database. The mean classification accuracy using K-nearest neighbors (KNN) classifier based on the 3D lesion establishment using the CNN architecture is 98.70%. The performance results are compared against varied classification methods in terms of accuracy, sensitivity, specificity and are proved to be better.

Filter by Year

2012 2026


Filter By Issues
All Issue 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