Articles
<![CDATA[Optimasi K-Means Clustering Menggunakan Particle Swarm Optimization pada Sistem Identifikasi Tumbuhan Obat Berbasis Citra ]]>
<![CDATA[Franki Yusuf Bisilisin]]>;
<![CDATA[Yeni Herdiyeni]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Jurnal Ilmu Komputer & Agri-Informatika Vol. 3 No. 1 (2014) ]]>
Publisher : <![CDATA[Departemen Ilmu Komputer - IPB University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1151.464 KB)
|
DOI: 10.29244/jika.3.1.37-46
<![CDATA[Teknologi identifikasi pada penelitian ini diperlukan untuk mempercepat proses identifikasi spesies tumbuhan obat berupa data citra digital. Penelitian ini membangun sistem identifikasi tumbuhan obat menggunakan teknik clustering. Teknik clustering digunakan untuk mengelompokkan data citra sesuai dengan spesies tumbuhan obat. Penelitian ini bertujuan melakukan optimasi k-means clustering menggunakan metode particle swarm optimization (PSO). Metode PSO digunakan untuk mengatasi kelemahan pada metode clustering tradisional yaitu pemilihan pusat cluster awal dan solusi lokal. Proses ekstraksi fitur menggunakan fuzzy local binary pattern (FLBP) untuk merepresentasikan tekstur dari citra. Implementasi program menggunakan bahasa pemrograman C++. Analisis clustering dilakukan untuk 30 spesies tumbuhan obat yang ada di Indonesia dengan jumlah 48 citra masing-masing spesies. Pengukuran kualitas clustering menggunakan nilai quantization error dan akurasi. Hasil yang diperoleh menunjukkan metode PSO mampu meningkatkan kinerja dari metode k-means clustering dalam proses identifikasi tumbuhan obat.Kata kunci: fuzzy local binary pattern, k-means clustering, particle swarm optimization, tumbuhan obat]]>
<![CDATA[Estimasi Spektrum Reflectance Citra Daun Jati Belanda Menggunakan Transformasi Wavelet ]]>
<![CDATA[I Gede Arta Wibawa]]>;
<![CDATA[Yeni Herdiyeni]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Jurnal Ilmu Komputer & Agri-Informatika Vol. 4 No. 1 (2015) ]]>
Publisher : <![CDATA[Departemen Ilmu Komputer - IPB University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (373.132 KB)
|
DOI: 10.29244/jika.4.1.22-28
<![CDATA[Jati belanda (Guazuma ulmifolia) adalah salah satu tanaman yang berkhasiat sebagai antioksidan karena pengaruh senyawa aktif yang terkandung di dalamnya. Cahaya pantulan (reflectance) dapat digunakan untuk mengetahui kualitas senyawa aktif pada daun jati belanda. Penelitian ini membahas tentang estimasi spektrum reflectance citra digital daun jati belanda menggunakan model reflectance daun tanaman obat dengan menerapkan transformasi wavelet. Bahan yang digunakan adalah daun tanaman obat dan daun jati belanda. Transformasi wavelet digunakan untuk merepresentasikan reflectance daun tanaman obat. Model polinomial diterapkan untuk mengekspansi ciri citra digital. Model reflectance terbaik dari penerapan transformasi wavelet dan model polinomial digunakan untuk mengestimasi reflectance dari daun jati belanda. Evaluasi spektrum reflectance asli dengan spektrum keluaran model estimasi reflectance menggunakan kriteria kesalahan terkecil dan kemiripan terbesar. Kata kunci: jati belanda, model polinomial, reflectance, wavelet]]>
<![CDATA[Parallel Technique for Medicinal Plant Identification System using Fuzzy Local Binary Pattern ]]>
<![CDATA[Ngakan Nyoman Kutha Krisnawijaya]]>;
<![CDATA[Yeni Herdiyeni]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Journal of ICT Research and Applications Vol. 11 No. 1 (2017) ]]>
Publisher : <![CDATA[LPPM ITB ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.5614/itbj.ict.res.appl.2017.11.1.5
<![CDATA[As biological image databases are growing rapidly, automated species identification based on digital data becomes of great interest for accelerating biodiversity assessment, research and monitoring. This research applied high performance computing (HPC) to a medicinal plant identification system. A parallel technique for medicinal plant image processing using Fuzzy Local Binary Pattern (FLBP) is proposed. The FLBP method extends the Local Binary Pattern (LBP) approach by employing fuzzy logic to represent texture images. The main goal of this research was to measure the efficiency of using the proposed parallel technique for medicinal plant image processing and evaluation in order to find out whether this approach is reasonable for handling large data sets. The parallel processing technique was designed in a message-sending model. 30 species of Indonesian medical plants were analyzed. Each species was represented by 48 leaf images. Performance evaluation was measured using the speed-up, efficiency, and isoefficiency of the parallel computing technique. Preliminary results show that HPC worked well in reducing the execution time of medical plant identification. In this work, parallel processing of training images was 7.64 times faster than with sequential processing, with efficiency values greater than 0.9. Parallel processing of testing images was 6.73 times faster than with sequential processing, with efficiency values over 0.9. The system was able to identify images with an accuracy of 68.89%.]]>
<![CDATA[Application of Recursive Algorithm on Shamir's Scheme Reconstruction for Cheating Detection and Identification ]]>
<![CDATA[Rafika Husnia Munfa'ati]]>;
<![CDATA[Sugi Guritman]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Jambura Journal of Mathematics Vol 4, No 1: January 2022 ]]>
Publisher : <![CDATA[Department of Mathematics, Universitas Negeri Gorontalo ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1267.787 KB)
|
DOI: 10.34312/jjom.v4i1.12001
<![CDATA[Information data protection is necessary to ward off and overcome various fraud attacks that may be encountered. A secret sharing scheme that implements cryptographic methods intends to maintain the security of confidential data by a group of trusted parties is the answer. In this paper, we choose the application of recursive algorithm on Shamir-based linear scheme as the primary method. In the secret reconstruction stage and since the beginning of the share distribution stage, these algorithms have been integrated by relying on a detection parameter to ensure that the secret value sought is valid. Although the obtained scheme will be much simpler because it utilizes the Vandermonde matrix structure, the security aspect of this scheme is not reduced. Indeed, it is supported by two detection parameters formulated from a recursive algorithm to detect cheating and identify the cheater(s). Therefore, this scheme is guaranteed to be unconditionally secure and has a high time efficiency (polynomial running time).]]>
<![CDATA[Modeling Singular Value Decomposition and K-Means of Core Image in Clasification of Potential Nickel ]]>
<![CDATA[Agung Prajuhana Putra]]>;
<![CDATA[Agus Buono]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2015 ]]>
Publisher : <![CDATA[Institute of Advanced Engineering and Science ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[Exploration is a main process in the nickel mining activities. One of the most important steps in exploration is obtain soil samples (cores) to determine the potential of nickel in the soil. Laboratory testing is a way to know how much the nickel content on the core. This research aims to utilize the core image of the statistical characteristics of color and texture, Biplot analysis using SVD, K-Means and identification using SVM method with RBF kernel and polynomial to determine the potential of nickel.DOI: http://dx.doi.org/10.11591/telkomnika.v13i3.7197]]>
<![CDATA[Similarity Measurement for Speaker Identification Using Frequency of Vector Pairs ]]>
<![CDATA[Inggih Permana]]>;
<![CDATA[Agus Buono]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014 ]]>
Publisher : <![CDATA[Institute of Advanced Engineering and Science ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.11591/ijeecs.v12.i8.pp6205-6210
<![CDATA[Similarity measurement is an important part of speaker identification. This study has modified the similarity measurement technique performed in previous studies. Previous studies used the sum of the smallest distance between the input vectors and the codebook vectors of a particular speaker. In this study, the technique has been modified by selecting a particular speaker codebook which has the highest frequency of vector pairs. Vector pair in this case is the smallest distance between the input vector and the vector in the codebook. This study used Mel Frequency Cepstral Coefficient (MFCC) as feature extraction, Self Organizing Map (SOM) as codebook maker and Euclidean as a measure of distance. The experimental results showed that the similarity measuring techniques proposed can improve the accuracy of speaker identification. In the MFCC coefficients 13, 15 and 20 the average accuracy of identification respectively increased as much as 0.61%, 0.98% and 1.27%.]]>
<![CDATA[Pattern Generation for Three Dimensional Cutting Stock Problem ]]>
<![CDATA[Mutia Atika]]>;
<![CDATA[Bib Paruhum Silalahi]]>;
<![CDATA[Fahren Bukhari]]>
<![CDATA[ JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 6, No 4 (2022): October ]]>
Publisher : <![CDATA[Universitas Muhammadiyah Mataram ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.31764/jtam.v6i4.9933
<![CDATA[We consider the problem of three-dimensional cutting of a large block that is to be cut into some small block pieces, each with a specific size and request. Pattern generation is an algorithm that has been used to determine cutting patterns in one-dimensional and two-dimensional problems. The purpose of this study is to modify the pattern generation algorithm so that it can be used in three-dimensional problems, and can determine the cutting pattern with the minimum possible cutting residue. The large block will be cut based on the length, width, and height. The rest of the cuts will be cut back if possible to minimize the rest. For three-dimensional problems, we consider the variant in which orthogonal rotation is allowed. By allowing the remainder of the initial cut to be rotated, the dimensions will have six permutations. The result of the calculation using the pattern generation algorithm for three-dimensional problems is that all possible cutting patterns are obtained but there are repetitive patterns because they suggest the same number of cuts. ]]>
<![CDATA[Confidence Intervals for the Mean Function of a Compound Cyclic Poisson Process in the Presence of Power Function Trend ]]>
<![CDATA[Faisal Muhammad]]>;
<![CDATA[I Wayan Mangku]]>;
<![CDATA[Bib Paruhum Silalahi]]>
<![CDATA[ CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 7, No 3 (2022): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI ]]>
Publisher : <![CDATA[Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.18860/ca.v7i3.15989
<![CDATA[We consider the problem of estimating the mean function of a compound cyclic Poisson process in the presence of power function trend. The objectives of this paper are: (i) to construct confidence interval for the mean function of a compound cyclic Poisson process with significance level , (ii) to prove that the probability that the mean function contained in the confidence interval converges to , and (iii) to observe, using simulation study, that the probabilities of the mean function contained in the confidence intervals for bounded length of observation interval. The main results are a confidence interval for the mean function and a theorem about convergence of the probability that the mean function contained in confidence interval. The simulation study shows that the probability that the mean function contained in the confidence interval is in accordance with the theorem. The contribution of this study is to provide information for users regarding confidence interval for the mean function of a compound cyclic Poisson process in the presence of power function trend.]]>
<![CDATA[Algoritme Sweep dan Particle Swarm Optimization dalam Optimisasi Rute Kendaraan dengan Kapasitas ]]>
<![CDATA[Bib Paruhum Silalahi]]>;
<![CDATA[Khoerul Fatihin]]>;
<![CDATA[Prapto Tri Supriyo]]>;
<![CDATA[Sugi Guritman]]>
<![CDATA[ Jurnal Matematika Integratif Vol 16, No 1: April 2020 ]]>
Publisher : <![CDATA[Department of Matematics, Universitas Padjadjaran ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1267.18 KB)
|
DOI: 10.24198/jmi.v16.n1.27474.29-40
<![CDATA[Masalah rute kendaraan dengan kapasitas (capacitated vehicle routing problem) adalah variasi dari masalah rute kendaraan (vehicle routing problem). Pada masalah rute kendaraan dengan kapasitas, kendaraan yang digunakan untuk distribusi produk memiliki batas daya angkut. Menentukan solusi optimal dari masalah rute kendaraan dan perluasannya adalah NP-Hard. Oleh karena itu untuk menyelesaikan masalah rute kendaraan dengan kapasitas ini banyak dikembangkan algoritme heuristik. Dalam paper ini, untuk mencari solusi masalah rute kendaraan dengan kapasitas, digunakan gabungan dua algoritme heuristik. Penyelesaian masalah dimulai dengan pembentukan kelompok (clustering) menggunakan algoritme sweep, kemudian setiap kelompok hasil algoritme sweep dioptimalkan menggunakan algoritme particle swarm optimization. ]]>
<![CDATA[Kasus-kasus Buruk Penggunaan Metode Titik Interior pada Optimisasi Linear ]]>
<![CDATA[Bib Paruhum Sialalahi]]>
<![CDATA[ Jurnal Matematika Integratif Vol 10, No 1: April, 2014 ]]>
Publisher : <![CDATA[Department of Matematics, Universitas Padjadjaran ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (419.536 KB)
|
DOI: 10.24198/jmi.v10.n1.10180.9-18
<![CDATA[Metode titik interior adalah suatu metode dengan waktu polinomial dalam menyelesaikan masalah optimisasi linear. Metode titik interior sering menggunakan central path sebagai panduan menuju solusi optimalnya. Pada paper ini diberikan suatu teorema yang menyatakan bahwasanya kendala redundan dapat mengubah pusat analitik central path yang sekaligus mengubah central path. Dengan bantuan teorema ini ditampilkan suatu kasus dimana metode titik interior berunjuk kerja buruk dengan adanya kendala redundan. Kemudian disajikan suatu masalah optimisasi linear yang memiliki central path dengan pola zigzag. Pola zigzag pada central path juga mengakibatkan metode titik interior bekerja lebih lama dalam menuju solusi optimal.]]>
