Claim Missing Document
Check
Articles

Found 40 Documents
Search

Algoritma Enkripsi Selektif Citra Digital dalam Ranah Frekuensi Berbasis Permutasi Chaos Rinaldi Munir
Jurnal Rekayasa Elektrika Vol 10, No 2 (2012)
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17529/jre.v10i2.82

Abstract

This paper presents a selective image encryption in frequency domain. At first, the image is transformed into frequency domain with Discrete Cosine Transform (DCT), and then DCT coefficients are scanned in zigzag, and elements of the low-frequency sub-band are extracted. Encryption is performed only on selected elements by scrambling them using 2D chaos map, namely Arnold Cat Map. Next, IDCT is applied to obtain the encrypted image. The encryption algorithm is included in lossy encryption. Experiments on both grayscale images and color images show that the images can be encrypted succesfully. Histograms of the encrypted images differ significantly from histogram of the original images, and the pixels in the encrypted images are not longer correlated.
Penerapan Pewarnaan Simpul Graf dengan Algoritma Welch Powell dan Algoritma Depth First Search pada Distribusi Giliran Main Angklung Pribadi, Fithratulhay; Munir, Rinaldi
Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer dan Teknologi Informasi Vol 7, No 2 (2021): Desember 2021
Publisher : Fakultas Sains dan Teknologi, Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (356.276 KB) | DOI: 10.24014/coreit.v7i2.15338

Abstract

Abstrak. Angklung adalah alat musik yang setiap alat musiknya hanya bisa memainkan satu nada saja. Untuk memainkan sebuah lagu dengan angklung, membutuhkan sebuah tim yang masing-masing pemainnya memegang satu atau lebih angklung. Pengaturan giliran memainkan dalam sebuah lagu agar pemain mengetahui ketukan dan nada apa yang harus dimainkannya, dapat disebut pembagian giliran angklung. Pada saat ini, masih sering terjadi gap jumlah turn antar pemain. Untuk mengatasi masalah tersebut, telah dibuat sebuah aplikasi untuk melakukan proses pembagian giliran angklung yang memanfaatkan pewarnaan graf dengan algoritma Welch Powell untuk membagi giliran menjadi kelompok-kelompok dimana tidak ada giliran lain yang dimainkan secara bersamaan (clashing) dan dilanjutkan dengan Algoritma Depth First Search yang akan mengoptimalkan jumlah ketukan di setiap grup. Aplikasi tersebut mampu membuat proses distribusi menjadi lebih efisien dan cukup memuaskan. Namun perbaikan masih diperlukan karena ada beberapa aspek yang belum dijadikan parameter dalam aplikasi.Kata kunci: Angklung, Depth First Search, Pewarnaan Graf. Abstract. Angklung is a musical instrument in which each instrument can only play one note. To play a song with angklung requires a team in which each player holds one or more angklung. Setting the turn to play in a song so that the player knows on what beat and what note he should play can be called the distribution of angklung's turn. At this time, there is still often a gap in the number of turns between players. To overcome this problem, an application has been created to perform the angklung turn distribution process that utilizes graph coloring with the Welch Powell algorithm to divide the turn into groups where there are no other turns to play at the same time (clashing) and continued with Depth First Search algorithm that will optimize the number of beats in each group. The application is able to make the distribution process more efficient and quite satisfying. However, improvements are still needed because there are several aspects that have not been used as parameters in the application.Keywords: Angklung, Depth First Search, Graph Coloring.
Watermarking Study on The Vector Map Hartanto Tantriawan; Rinaldi Munir
Indonesian Journal of Artificial Intelligence and Data Mining Vol 6, No 1 (2023): Maret 2023
Publisher : Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/ijaidm.v6i1.22211

Abstract

In addition to being employed in a variety of military and security applications, GIS vector maps are frequently used in social, environmental, and economic applications like navigation, business planning, infrastructure & utility allocation, and disaster management. Given the high value of this map, copyright protection is implemented in the watermarking as a required safeguard against unauthorized modification and exchange of GIS vector maps. Watermarking is inserting information (watermark) stating ownership of multimedia data. This paper discusses several approaches that can be used to watermark vector maps, including using the space-domain algorithm and transform-domain algorithm. Second The watermarking algorithm was developed with the following quality metrics: fidelity, robustness, capacity, complexity, and security. The challenge in this study is that the higher the capacity, the lower the fidelity value. Low fidelity causes map properties to be lost, making the map unusable. These two things need to be balanced.
Algoritma Enkripsi Selektif Citra Digital dalam Ranah Frekuensi Berbasis Permutasi Chaos Rinaldi Munir
Jurnal Rekayasa Elektrika Vol 10, No 2 (2012)
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17529/jre.v10i2.82

Abstract

This paper presents a selective image encryption in frequency domain. At first, the image is transformed into frequency domain with Discrete Cosine Transform (DCT), and then DCT coefficients are scanned in zigzag, and elements of the low-frequency sub-band are extracted. Encryption is performed only on selected elements by scrambling them using 2D chaos map, namely Arnold Cat Map. Next, IDCT is applied to obtain the encrypted image. The encryption algorithm is included in lossy encryption. Experiments on both grayscale images and color images show that the images can be encrypted succesfully. Histograms of the encrypted images differ significantly from histogram of the original images, and the pixels in the encrypted images are not longer correlated.
Curating Multimodal Satellite Imagery for Precision Agriculture Datasets with Google Earth Engine Bagus Setyawan Wijaya; Rinaldi Munir; Nugraha Priya Utama
Proceedings of The International Conference on Data Science and Official Statistics Vol. 2023 No. 1 (2023): Proceedings of 2023 International Conference on Data Science and Official St
Publisher : Politeknik Statistika STIS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34123/icdsos.v2023i1.399

Abstract

In the era of modern agriculture, satellite imagery has been widely used to monitor crops, one of which is paddy. This paper tries to describe the vegetation indices, climate, and soil index features related to paddy plants and curates a collection of satellite imagery on the Google Earth Engine (GEE). This paper reveals how GEE can be used to collect and process multimodal satellite imagery to form a precision agriculture dataset. The objective of this study is to establish a comprehensive precision agriculture dataset by leveraging multimodal satellite imagery to monitor paddy crops. The data collected as a dataset originates from 306 locations in Karawang Regency, Indonesia, during the 2019-2020 period. In the first step, we identify the relevant features essential for paddy crop analysis. Subsequently, we carefully select image collections within GEE based on these features. Afterward, we perform data acquisition and necessary preprocessing through the Google Colab environment. The results showed that satellite imagery from Sentinel-2 outperforms Landsat 8 in terms of spatial and temporal resolution. Apart from that, the generated dataset successfully captures the growth patterns of paddy plants.
PERBANDINGAN BERBAGAI METODE STEGANOGRAFI PADA CITRA DIGITAL Ratih Kartika Dewi; Rinaldi Munir
Jurnal Informatika Polinema Vol. 9 No. 3 (2023): Vol 9 No 3 (2023)
Publisher : UPT P2M State Polytechnic of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33795/jip.v9i3.1336

Abstract

Topik keamanan informasi selalu menarik untuk dibahas. Steganografi merupakan salah satu teknik yang digunakan untuk meningkatkan keamanan informasi yang banyak dikembangkan saat ini serta memiliki tujuan menyembunyikan keberadaan pesan untuk menghindari kecurigaan dari pihak lain. Penyisipan pesan ke dalam media pembawa tidak membuat kualitas media pembawa itu berubah dan media yang telah disisipi pesan tidak dapat dibedakan secara kasat mata dengan media aslinya. Media digital yang banyak digunakan dalam steganografi saat ini adalah citra. Oleh karena itu, penelitian ini menyediakan perbandingan metode steganografi pada citra digital, sehingga diharapkan dapat memberikan gambaran mengenai karakteristik citra setelah disisipi pesan menggunakan berbagai algoritma steganografi. Pada bagian akhir paper ini juga akan dibahas mengenai tantangan dan peluang penelitian lanjutan.
Combining Two Chaos Maps and Determining Selective Methods for MSB Bits in a Digital Image Encryption Algorithm Munir, Rinaldi
Journal of Multimedia Trend and Technology Vol. 3 No. 3 (2024): Journal of Multimedia Trend and Technology
Publisher : Universitas Amikom Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35671/jmtt.v3i3.63

Abstract

In order to reduce the computational volume, we employ selective encryption approaches in conjunction with a chaos-based picture encryption algorithm in this research. Two chaos maps are used, namely Arnold Cat Map and Logistic Map. Before encryption, the image is scrambled with Arnold Cat Map, then selective encryption techniques are applied by selecting only four MSB bits from each pixel to be XORed with the keystream generated from the Logistic Map. Experimental results show that the use of both chaos functions can produce confusion and diffusion effects, and the use of selective encryption techniques only processes 50% of the entire image data. The encrypted image shows a relatively uniformly distributed histogram, making it difficult for attackers to perform statistical analysis to find the key or plain image. Chaos sensitivity shows that this algorithm is safe from exhaustive-key search attacks. This method is sensitive to modest changes in the key, making it safe from exhaustive-key search assaults, according to experiments conducted by gently altering the initial value of chaos. This technique is immune to brute-force attacks because of its sufficiently huge key space.
Optimalisasi Rekomendasi Rute Pada Perencanaan Perjalanan Wisata: Studi Pustaka: Optimization Route Recommendation-Based Tourist Trip Design Problem: A Literature Study Ramdani, Ahmad Luky; Widyantoro, Dwi Hendratmo; Munir, Rinaldi
MALCOM: Indonesian Journal of Machine Learning and Computer Science Vol. 4 No. 2 (2024): MALCOM April 2024
Publisher : Institut Riset dan Publikasi Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.57152/malcom.v4i2.1213

Abstract

Tourist trip design problems (TTDP) merupakan permasalahan yang berkaitan dengan bidang pariwisata. TTDP berkaitan dengan perencanaan pengguna dalam melakukan perjalanan wisata berdasarkan pada tempat wisata yang menarik. Dalam sistem rekomendasi, TTDP merupakan permasalahan yang menarik. Hal ini karena tidak hanya digunakan untuk menemukan tempat wisata yang sesuai dengan pengguna, tetapi juga untuk menggabungkan tempat wisata ke dalam rute perjalanan yang praktis dengan mempertimbangkan batasan. Pada artikel ini bertujuan menyajikan penelitian sebelumnya yang berkaitan dengan proses optimasi rekomendasi perjalanan dan bagaimana permasalahan tersebut dimodelkan menggunakan pendekatan yang berbeda untuk mencari solusi yang optimal. Selain itu peluang penelitian yang dapat dilakukan untuk meningkatkan performa rekomendasi. Berdasarkan synthetic literatur review (SLR) dalam penelitian ini, didapatkan peluang penelitian yang dapat dilakukan untuk mendapatkan rekomendasi rute perjalanan yang optimal seperti kombinasi algoritma metaheuristic atau algoritma bio-inspired. Selain itu pada personalisasi pengguna terkait tempat wisata, terdapat peluang mengimplementasikan algorime deep learning seperti LTSM, Transformer, Bert sebagai nilai tempat wisata dari sisi pengguna
Storychart: A Character Interaction Chart for Visualizing the Activities Flow Abidin, Zainal; Munir, Rinaldi; Akbar, Saiful; Mandala, Rila; Widyantoro, Dwi H.
JOIV : International Journal on Informatics Visualization Vol 7, No 4 (2023)
Publisher : Society of Visual Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62527/joiv.7.4.1608

Abstract

Event-predicate-based storyline extraction results in a chronologically ordered activity journal. The extraction results contain complex human activities, so the activity journal requires a visualization model to describe actor interactions. This paper proposes a chart to visualize the activities' flow to describe the characters' interactions in an activity journal. This chart is called a storychart. Storycharts have an actor channel that can accept single entities or teams. The actor channel allows changing the type from single to a team or vice versa and moving members to other teams. The activity channel serves as a connector to accommodate interactions between actors. The activity channel provides a visual space for the elements of what, where, and when. Event predicates are the core of what. Therefore, the storychart visualizes the event predicate using glyphs to attract the reader’s attention. The main contribution of this paper is to introduce a team channel that can visualize the identity of team members and an activity channel that can visualize the details of events. We invited participants to discover the reader’s perception of the ease of team recognition and the integrity of the meaning of the narrative visualized by the storychart. Participants involved in the evaluation were filtered by literacy score. Evaluation of storychart reading showed that readers could easily distinguish teams from single actors, and storycharts could convey the story in the activity journal with little reduction in meaning.
MENGAMANKAN FILE RAHASIA MENGGUNAKAN HYBRID KRIPTOGRAFI Permana , John Swatrahadi; Hendrana, Hendrana; Munir, Rinaldi
Jurnal Review Pendidikan dan Pengajaran Vol. 7 No. 1 (2024): Volume 7 No 1 Tahun 2024
Publisher : LPPM Universitas Pahlawan Tuanku Tambusai

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31004/jrpp.v7i1.26156

Abstract

Penyelenggara sistem elektronik mengelola sitem aplikasi mengelola file dari pengguna yang sifatnya rahasia. File yang bersifat rahasia yang dikelola menggunakan suatu sistem informasi perlu dilindungi dari ancaman kebocoran data. Salah satu metode yang dapat digunakan untuk melindungi file tersebut adalah menggunakan metode hybrid cryptography yaitu algoritma Adcanced Enryption Standart atau AES dikombinasikan dengan Rivest Shamir Adleman atau RSA. File rahasia yang diupload ke sistem aplikasi sebelum disimpan file tersebut dienkripsi menggunakan kriptografi kunci simetri AES, dengan kunci yang degenerate oleh sistem. Kunci yang degenerate oleh sistem tersebut sifatnya rahasia yang perlu diamankan. Untuk mengamankan kunci dari file rahasia yang disimpan pada database diamankan Kembali menggunakan kriptografi kunci asimetris Rivest Shamir Adlemen. Hasil penelitian menunjukkan waktu yang diperlukan untuk mengamankan file rahasia cukup singkat sehingga tidak mempengaruhi kinerja sistem secara keseluruhan. Proses enkripsi maupun dekripsi hybrid kriptografi AES dan RSA memerlukan waktu rata-rata sebesar 295,8774 bytes / micro second. Proses enkripsi lebih cepat 0,633537 kali dibandingkan dengan proses dekripsi. Metode hybrid kriptografi AES dan RSA cukup kuat untuk melindungi file berklasifikasi rahasia.