Claim Missing Document
Check
Articles

Found 40 Documents
Search

Restorasi Citra Kabur dengan Algoritma Lucy-Richardson dan Perbandingannya dengan Penapis Wiener Rinaldi Munir
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2006
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Restorasi citra bertujuan merekonstruksi citra yang mengalami degradasi menjadi citra yang menyerupai citra aslinya. Restorasi citra dilakukan dengan meleawatkan citra masukan pada penapis. Salah satu penapis yang bekerja dengan metode iteratif adalah algoritma Lucy-Richardson. Prinsip iteratif algoritma ini adalah estimasi ke-(n+1) dari citra restorasi adalah estimasi dari hasil iterasi ke-n dikali dengan sebuah citra koreksi. Iterasi dapat dilakukan sampai citra hasil restorasi yang diperoleh sudah memenuhi kriteria fidelitas. Makalah ini memaparkan restorasi citra dengan algoritma Lucy-Richardson. Eksperimen dengan algoritma ini dilakukan dengan menggunakan kakas MATLAB. Sebagai pembanding dilakukan restorasi citra menggunakan penapis Wiener. Hasil-hasil eksperimen dianalisis untuk melihat perbandingan hasil kedua penapis ini.Kata kunci: restorasi citra, degradasi, algoritma Lucy-Richardson, iteratif, MATLAB.
Penerapan Sistem Kriptografi Kunci-Publik untuk Membentuk Skema Public-Key Watermarking, Mungkinkah? Rinaldi Munir; Bambang Riyanto; Sarwono Sutikno
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2006
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Skema public-key watermarking mempunyai aplikasi riil untuk memverifikasi watermark di dalam dokumen multimedia yang tersebar di seluruh dunia. Public-key watermarking dapat dianggap sebagai teknologi watermarking generasi kedua. Konsep public-key watermarking banyak mengadopsi konsep di dalam sistem kriptografi kunci-publik. Sistem kriptografi kunci-publik dapat digunakan untuk membentuk fragile public-key watermarking, namun tidak cocok diterapkan untuk mendapatkan robust public-key watermarking. Sistem kriptografi kunci-publik dapat menjadi inspirasi untuk membentuk skema public-key wateramrking. Makalah ini mempresentasikan penggunaan kriptografi kunci publik untuk menghasilkan skema public-key watermarking.Kata kunci: watermark, multimedia, public-key watermarking, fragile, robust, public-key cryptography.
Sistem Pengidentifikasi Otomatis Keterkaitan Topik antar Paragraf dalam Dokumen Ekspositori Rila Mandala; Andreas Prasetia; Rinaldi Munir; Harlili Harlili
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2004
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

This paper conducted on identifying topical coherency between paragraphs of anexpository text. Expository text is a kind of texts which is intended for publicity such asjournal, news etc. Many expository texts consist of long sequences of paragraphs with verylittle structural demarcation, while others consist of sequences of paragraph which stilldiscuss the same topic. This paper uses Similarity Coefficient to identify topical coherencybetween paragraphs. Similarity coefficient measures lexical similarity between adjacentparagraphs, with assumption that the more similar two adjacent paragraphs are, the morelikely it is that the current topic continues. Pengidentifikasi Keterkaitan Topik Antar Paragraf(PKTAP) is a software for identifying topical coherency between paragraphs of an expositorytext, which is developed based on this method. Topical coherency identification made byPKTAP is compared against judgments made by human readers. The result shows that thereaders have a high tendency to agree with PKTAP.Keywords: expository text, topical coherency, similarity coefficient
Sistem Penganalisis Sintaks Otomatis dengan Metode Generalized-LR Parsing Rila Mandala; Antonius Sigit; Rinaldi Munir; Harlili Harlili
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2004
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

The main problem of difficulties in natural language processing is ambiguity. Almostin all level of natural language processing there are ambiguities, including in syntax level.LR-Parser is an efficient method that often be used in developing a programming languagecompiler for parsing, but unfortunately it can not be used for parsing natural languageprocessing because it can not handle the ambiguity. This paper uses Generalized-LR Parsing,a modified-LR-Parsing method that can handle ambiguity, for parsing a sentence in BahasaIndonesia. Generalized-LR Parsing use a graph-structured stack to cope the ambigutiyproblem. It can successfully produce all parsing-trees for an ambiguous sentence in BahasaIndonesia.Keywords: natural language processing, syntax analysis, ambiguity, Generalized LRParsing,parsing-tree
Sistem Stemming Otomatis untuk Kata dalam Bahasa Indonesia Rila Mandala; Erry Koryanti; Rinaldi Munir; Harlili Harlili
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2004
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Stemming is a process to restore words to its base form, by stripping each word fromits derivational and affixes. A stemming process has an important role for machinetranslationand other computational lingustics area. In Malaysian there is a stemmingalgorithm that has been developed and tested for application in information retrieval which isknown as Othman algorithm. There are several differences of Bahasa Indonesia’smorphology and Malay’s morphology, so The Othman algorithm can not be applied directlyin bahasa Indonesia. Furthermore, the accuracy of Othman algorithm also is not good. Thispaper proposes some modifications from Othman algorithm. The modifications includes,various stemming procedures, rule of affixes, and dictionary of root words. Experiments showthat Our modification method has a better accuracy in stemming Bahasa Indonesia’s words.Keywords: stemming, word-lemmatization, affix-stripping
Penerapan Secret Sharing Scheme pada Joint Ownership Watermarking untuk Citra Digital Made Windu Antara Kesiman; Rinaldi Munir
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2004
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Digital watermarking merupakan metode untuk menyisipkan suatu informasi, yangbiasanya disebut sebagai watermark, pada suatu data digital penampung. Masalah yangdihadapi pada metode digital watermarking saat ini adalah semua metode yang telah adahanya mampu menangani perlindungan hak cipta dari satu pemilik saja. Solusi yangkemudian ditawarkan untuk menangani masalah kepemilikan bersama suatu citra digitaladalah dengan menerapkan secret sharing scheme pada digital image watermarking.Makalah ini membahas tentang penerapan secret sharing scheme pada joint ownershipwatermarking yang meliputi protokol-protokol dan metode-metode untuk proses penyisipan(embedding) watermark serta protokol-protokol untuk proses pendeteksian kepemilikan(detection) watermark. Robustness watermark diuji dengan melakukan beberapa prosesmanipulasi terhadap citra digital yang telah mengandung watermark, kemudian dilakukanproses pendeteksian kepemilikan watermark terhadap citra digital tersebut. Hasil ujimenunjukkan, watermark cukup robust terhadap beberapa proses manipulasi citra digital,seperti perubahan brightness, kontras, scaling, flipping, rotasi, printscreen, serta kompresiJPEG 2000. Namun watermark masih rentan terhadap proses cropping dan penyisipanwatermark ganda pada citra digital.Kata Kunci: hak cipta, secret sharing scheme, joint ownership watermarking, citra digital,robustness
ALGORITMA ENKRIPSI CITRA DIGITAL DENGAN KOMBINASI DUA CHAOS MAP DAN PENERAPAN TEKNIK SELEKTIF TERHADAP BIT-BIT MSB Rinaldi Munir
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2012
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Di dalam makalah ini dipresentasikan sebuah algoritma enkripsi citra berbasis chaos dan penggunaan teknik enkripsi selektif untuk meminimumkan volume komputasi. Dua buah pemetaan chaos digunakan, yaitu Arnold Cat Map dan Logistic Map. Sebelum dienkripsi, citra diacak dengan Arnold Cat Map, selanjutnya teknik enkripsi selektif diterapkan dengan memilih hanya empat bit MSB dari setiap pixel untuk di-XOR-kan dengan keystream yang dibangkitkan dari Logistic Map. Hasil ekperimen memperlihatkan penggunaan kedua fungsi chaos tersebut dapat menghasilkan efek confusion dan diffusion, dan penggunaan teknik enkripsi selektif hanya memproses 50% dari keseluruhan data citra. Citra hasil enkripsi memperlihatkan histogram yang terdistribusi relatif uniform sehingga menyulitkan penyerang melakukan analisis statistik untuk menemukan kunci atau plain-image. Sensitifitas chaos memperlihatkan bahwa algoritma ini aman dari exhaustive-key search attack.
Eksperimen Steganalisis dengan Metode Visual Attack pada Citra Hasil EzStego Berformat GIF Rinaldi Munir
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2016
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

Di dalam makalah ini dipresentasikan hasil-hasil eksperimen steganalisis pada citra berformat GIF yang telah disisipi pesan. Penyisipan pesan menggunakan algoritma EzStego dan algoritma modifikasinya. Metode steganalisis yang digunakan adalah Visual Attack. Eksperimen dilakukan dengan bermacam ukuran dan tipe pesan, baik pesan normal maupun pesan acak, dan pada beberapa macam citra tipikal. Dari berbagai eksperimen diperoleh hasil pengamatan bahwa artefak yang terbentuk akibat penyisipan memiliki karakteristik yang berbeda, bergantung pada tipe pesan, ukuran, dan cara penyisipan (acak atau sekuensial).
ORBITAL TRAJECTORY SIMULATION ON TWIN STARS SYSTEM IN IFS FRACTAL MODEL BASED ON HYBRID ANIMATION METHOD Tedjo Darmanto; Iping Supriana Suwardi; Rinaldi Munir
Jurnal Ilmu Komputer dan Informasi Vol 8, No 2 (2015): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (415.197 KB) | DOI: 10.21609/jiki.v8i2.304

Abstract

IFS (Iterated Function Systems) is a method to model fractal object based on affine transformation functions. The star-like object rotation effect in the IFS fractal model could be exhibited by using metamorphical method, as a replacement to the affine rotation method on a non metamorphic animation. The advantage of a metamorphic animation method over the metamorphic animation method is that the object's relative position to the fixed point as an absolute centroid is absolute. Therefore, the rotational effect can be exhibited at any positions. In addition, it can also be combined with rotational effect of the local centroid itself around the absolute centroid as a fixed point by the primitive rotational operation to form an interesting behavior of orbital trajectory Based on the hybrid of both animation methods, the animation simulation could be done on orbital trajectory on a twin stars rotating to each other as a system. Both objects are rotated in the same angular direction, but started in the opposite position around two closely different fixed points. So, the orbital trajectory yielded forms an elliptical path. The two similar objects can be created efficiently by cloning-scaling technique. In general, the animation method can be modeled as an animation framework.
The Balinese Unicode Text Processing Imam Habibi; Rinaldi Munir
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 1 (2006): January
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.19

Abstract

In principal, the computer only recognizes numbers as the representation of a character. Therefore, there are many encoding systems to allocate these numbers although not all characters are covered. In Europe, every single language even needs more than one encoding system. Hence, a new encoding system known as Unicode has been established to overcome this problem. Unicode provides unique id for each different characters which does not depend on platform, program, and language. Unicode standard has been applied in a number of industries, such as Apple, HP, IBM, JustSystem, Microsoft, Oracle, SAP, Sun, Sybase, and Unisys. In addition, language standards and modern information exchanges such as XML, Java, ECMA Script (JavaScript), LDAP, CORBA 3.0, and WML make use of Unicode as an official tool for implementing ISO/IEC 10646. There are four things to do according to Balinese script: the algorithm of transliteration, searching, sorting, and word boundary analysis (spell checking). To verify the truth of algorithm, some applications are made. These applications can run on Linux/Windows OS platform using J2SDK 1.5 and J2ME WTK2 library. The input and output of the algorithm/application are character sequence that is obtained from keyboard punch and external file. This research produces a module or a library which is able to process the Balinese text based on Unicode standard. The output of this research is the ability, skill, and mastering of 1. Unicode standard (21-bit) as a substitution to ASCII (7-bit) and ISO8859-1 (8-bit) as the former default character set in many applications. 2. The Balinese Unicode text processing algorithm. 3. An experience of working with and learning from an international team that consists of the foremost experts in the area: Michael Everson (Ireland), Peter Constable (Microsoft US), I Made Suatjana, and Ida Bagus Adi Sudewa.