Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Jurnal Satya Informatika Jurnal Riset Multidisiplin Edukasi
Edison Pardengganan Siahaan
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Library & Information Science Social Sciences Other

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
PENGEMBANGAN PROTOTYPE SISTEM PENGENALAN WAJAH REAL-TIME BERBASIS PYTHON DAN OPENCV Rajagukguk, Ronaldo P; Siahaan, Edison P; Sitorus, Berlin P
JURNAL SATYA INFORMATIKA Vol. 10 No. 2 (2025): JURNAL SATYA INFORMATIKA
Publisher : FAKULTAS TEKNIK

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59134/jsk.v10i2.747

Abstract

Attendance is one of the important aspects in managing the presence of employees and students. Manual or card-based attendance methods still have several weaknesses, such as being prone to manipulation, requiring more time, and lacking efficiency. Therefore, this study develops a prototype of a real-time face recognition-based attendance system using Python and OpenCV. The research method applied is Prototyping, consisting of stages of requirement analysis, system design,implementation, and testing. The system is designed using the Haar Cascade algorithm for face detection and Local Binary Pattern Histogram (LBPH) for face recognition. The database uses SQLite with three main tables: users, positions, and attendance. The system was tested using four face datasets with a total of approximately 400 images, namely from users: Ronaldo, Lisra, Juliardo, and Riswanti. The test results show that the system can detect and recognize users' faces in real-time, automatically record attendance, and generate daily, monthly, and individual attendance reports.
Penggabungan Sifat Binary Min Heap dan Max Heap pada Struktur Data Min-Max Heap dan Max-Min Heap: Konsep dan Visualisasi Edison Pardengganan Siahaan
Jurnal Riset Multidisiplin Edukasi Vol. 3 No. 1 (2026): Jurnal Riset Multidisiplin Edukasi (Januari 2026)
Publisher : PT. Hasba Edukasi Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71282/jurmie.v3i1.1579

Abstract

This paper outlines the organizational mechanisms of two variants of the Binary Heap data structure, namely the Binary Min-Max Heap and the Binary Max-Min Heap. These variants are derived from a combination of characteristics found in the Binary Min Heap and Binary Max Heap, allowing users to efficiently retrieve both minimum and maximum values from a collection of stored and organized data. In addition to discussing the conceptual and operational aspects of these structures, the paper also presents the design of a software tool developed to visualize the organization process, particularly the procedures for inserting new nodes and deleting existing nodes from the data structures. The visualization is represented through a class diagram, which illustrates the internal structure of the program, including the attributes and methods involved in its implementation. This design aims to assist users in gaining a more intuitive understanding of the internal workings of both Binary Heap variants.
Co-Authors Rajagukguk, Ronaldo P Sitorus, Berlin P