Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal KAKIFIKOM : Kumpulan Artikel Karya Ilmiah Fakultas Ilmu Komputer Journal of Computer Networks, Architecture and High Performance Computing
Sagala, Angelica Claudia
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Education Other

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

Found 2 Documents
Search

 1 
Penerapan Analisis Algoritma Elias Omega Code Pada Citra Digital Liskedame Yanti; Sinaga, Chaston Ramotto; Sagala, Angelica Claudia
KAKIFIKOM : Kumpulan Artikel Karya Ilmiah Fakultas Ilmu Komputer Volume 6 Nomor 1 Tahun 2024
Publisher : UNIKA Santo Thomas

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The large size of digital image files is an obstacle in their storage, transmission, and processing. Digital image compression is a solution to overcome this problem. The Elias Omega Code algorithm is one of the efficient and easy-to-implement lossless compression algorithms. This research aims to analyze the Elias Omega Code algorithm on digital images. The analysis includes: implementation of the Elias Omega Code algorithm for digital image compression, evaluation of the performance of the Elias Omega Code algorithm in terms of compression ratio and image quality, comparison of the performance of the Elias Omega Code algorithm with other image compression algorithms. The results of the study show that the Elias Omega Code algorithm can produce a high compression ratio with preserved image quality. This algorithm has better performance than the Huffman and LZW algorithms, but lower than the JPEG algorithm..
Application of Dijkstra's Algorithm to Determine the Shortest Route from City Center to Medan City Tourist Attractions Sipayung, Liskedame Yanti; Sinaga, Chaston Ramotto; Sagala, Angelica Claudia
Journal of Computer Networks, Architecture and High Performance Computing Vol. 5 No. 2 (2023): Article Research Volume 5 Issue 2, July 2023
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v5i2.2699

Abstract

Tourist attractions are very interesting things to visit in an area that we are living. It is no exception when visiting the city of Medan, the tourists will visit interesting tourist spots in the city of Medan. To optimize time so that you can visit all tourist attractions in Medan City, you need to map locations so that you can create the shortest route that can be used to take all the tourist sites you want to visit in Medan City. The shortest route of a trip will shorten the travel time. Likewise in terms of seeking experts. When requesting a route from one point (start point) to another location (destination point), usually the result that comes out is the "shortest path" from the starting point to the destination point. The shortest path is the problem of finding a path between two or more vertices in a minimum weighted graph. To simplify solving the shortest path problem, a search algorithm is needed. Dijkstra's algorithm solves the problem of finding the shortest path between two vertices in a weighted graph with the smallest total number, by finding the shortest distance between the initial vertex and other vertices, so that the path formed from the initial vertex to the destination vertex has the smallest total weight. In this study, Dijkstra's algorithm looks for the shortest path based on the smallest weight from one point to another, so that it can help provide a choice of paths. Based on the trials of Dijkstra's algorithm, it has the ability to find the shortest path, because in this algorithm each graph is selected an edge with a minimum weight that connects the selected vertices with other unselected vertices.
Co-Authors Liskedame Yanti Sinaga, Chaston Ramotto Sipayung, Liskedame Yanti