Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal JURNAL ILMIAH INFORMATIKA PROCESSOR Jurnal Ilmiah Sistem Informasi, Teknologi Informasi dan Sistem Komputer
Kharisma Mahesa
Unknown Affiliation
Computer Science & IT

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

Found 3 Documents
Search

 1 
RANCANG BANGUN APLIKASI KOMPRESI DAN DEKOMPRESI PADA CITRA DIGITAL MENGGUNAKAN METODE HUFFMAN Kharisma Mahesa; Karpen .
Jurnal Processor Vol 12 No 1 (2017): Processor
Publisher : LPPM STIKOM Dinamika Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (598.925 KB)

Abstract

The rapid development of information technology and currently it’s possible to send information quickly. Speed transmission of information is certainly very dependent on the size of the capacity of such information. The large size of the capacity of information could result in the slow process of delivery. Beside that, the size of a large information capacity would require a very large storage space. The solution to this problem is to compress the information before sending in order to measure the capacity of such information becomes smaller. While reverting to forms the initial compression is to perform decompression technique. Some digital image compression techniques have been developed as block-coding, encoding and more. Digital image compression techniques continue to be developed with the aim to compress the image data as small as possible, but at the moment none of the decompression image data is lost. Huffman method is one method that is able to compress and decompress the digital image. Image compression is the process to minimize the number of bits that represents an image so that the image data capacity becomes smaller. Huffman method is a method of digital image compression is lossless compression method that is by doing the encoding in the form of bits to represent character data. Each type of characters contained in an image is calculated and sort by the fewest amount to a large amount in the form of binary trees and code for each character. The existing data will be replaced with the code bits based on a binary tree. Data that has been turned into a bit of code stored as a result of compression.
PEMANFAATAN METODE DNA KRIPTOGRAFI DALAM MENINGKATKAN KEAMANAN CITRA DIGITAL Kharisma Mahesa; Bambang Sugiantoro; Yudi Prayudi
JURNAL ILMIAH INFORMATIKA Vol 7 No 02 (2019): Jurnal Ilmiah Informatika (JIF)
Publisher : Teknik Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (632.523 KB) | DOI: 10.33884/jif.v7i02.1356

Abstract

There are many data transmitted on internet and certainly has positive and negative side. Negative side that perceived is the increase in cybercrime activities which is a threat to everyone. Securing confidential data is very necessary so that the data is not misused by others for individual or groups benefit. This research is developing an application that is able to secure data like digital images by applying cryptography. Cryptography is the most appropriate way to secure data like digital images. DNA cryptography is one of cryptography method. Beside to application of computing is very easy, this method has excess speed in processing, use minimal storage and power usage. The result from this research are application that are built can encrypt dan decrypt digital images which has a lot color distribution well. Application and method used will work well on image that have a lot or even distribution colors. But not in digital images that have 1 dominant or transparent color in that.
RANCANG BANGUN APLIKASI KOMPRESI DAN DEKOMPRESI PADA CITRA DIGITAL MENGGUNAKAN METODE HUFFMAN Kharisma Mahesa; Karpen .
Jurnal PROCESSOR Vol 12 No 1 (2017): Jurnal Processor
Publisher : LPPM Universitas Dinamika Bangsa

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

Abstract

The rapid development of information technology and currently it’s possible to send information quickly. Speed transmission of information is certainly very dependent on the size of the capacity of such information. The large size of the capacity of information could result in the slow process of delivery. Beside that, the size of a large information capacity would require a very large storage space. The solution to this problem is to compress the information before sending in order to measure the capacity of such information becomes smaller. While reverting to forms the initial compression is to perform decompression technique. Some digital image compression techniques have been developed as block-coding, encoding and more. Digital image compression techniques continue to be developed with the aim to compress the image data as small as possible, but at the moment none of the decompression image data is lost. Huffman method is one method that is able to compress and decompress the digital image. Image compression is the process to minimize the number of bits that represents an image so that the image data capacity becomes smaller. Huffman method is a method of digital image compression is lossless compression method that is by doing the encoding in the form of bits to represent character data. Each type of characters contained in an image is calculated and sort by the fewest amount to a large amount in the form of binary trees and code for each character. The existing data will be replaced with the code bits based on a binary tree. Data that has been turned into a bit of code stored as a result of compression.
Co-Authors Bambang Sugiantoro Karpen . Yudi prayudi