发布求助
文献互助 智能选刊 最新文献

Jurnal Ilmu Komputer dan Informasi最新文献

筛选
英文 中文
CHARACTER IMAGE SEGMENTATION OF JAVANESE SCRIPT USING CONNECTED COMPONENT METHOD 基于连通分量法的爪哇文字图像分割
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-07-08 DOI: 10.21609/JIKI.V12I2.677
Yuna Sugianela, N. Suciati
{"title":"CHARACTER IMAGE SEGMENTATION OF JAVANESE SCRIPT USING CONNECTED COMPONENT METHOD","authors":"Yuna Sugianela, N. Suciati","doi":"10.21609/JIKI.V12I2.677","DOIUrl":"https://doi.org/10.21609/JIKI.V12I2.677","url":null,"abstract":"Automation of Javanese script translation is needed to make it easier for people to understand the meaning of ancient Javanese script. By using Javanese script image as input, the translation system generally consists of character segmentation, character recognition, and combining the recognized characters as a meaningful word. The segmentation which obtains region of interest of each character, is an important process in the translation system. In the previous research, segmentation using projection profile method can separate each character well. The method can overcome characters overlapping, but it still produces truncated characters. In this study, we proposed a new segmentation to reduce the truncated character. The first step of the proposed method is pre-processing that consists of converting input into binary image and cleaning noises. The next step is to determine the connected component labels, which further perform as candidate of characters. Some of the candidates are still represented by more than one labels, so that we need a process to merge the connected component labels that have centroid distance less than threshold. We evaluate the proposed method using Intersection over Union (IoU). The evaluation shows the best accuracy 93,26%.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"83 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87871623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING 随着时间的推移学习单词相关性以进行时间排序
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-07-08 DOI: 10.21609/JIKI.V12I2.745
Dinda Sigmawaty, M. Adriani
{"title":"LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING","authors":"Dinda Sigmawaty, M. Adriani","doi":"10.21609/JIKI.V12I2.745","DOIUrl":"https://doi.org/10.21609/JIKI.V12I2.745","url":null,"abstract":"Queries and ranking with temporal aspects gain significant attention in field of Information Retrieval. While searching for articles published over time, the relevant documents usually occur in certain temporal patterns. Given a query that is implicitly time sensitive, we develop a temporal ranking using the important times of query by drawing from the distribution of query trend relatedness over time. We also combine the model with Dual Embedding Space Model (DESM) in the temporal model according to document timestamp. We apply our model using three temporal word embeddings algorithms to learn relatedness of words from news archive in Bahasa Indonesia: (1) QT-W2V-Rank using Word2Vec (2) QT-OW2V-Rank using OrthoTrans-Word2Vec (3) QT-DBE-Rank using Dynamic Bernoulli Embeddings. The highest score was achieved with static word embeddings learned separately over time, called QT-W2V-Rank, which is 66% in average precision and 68% in early precision. Furthermore, studies of different characteristics of temporal topics showed that QT-W2V-Rank is also more effective in capturing temporal patterns such as spikes, periodicity, and seasonality than the baselines.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88748584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Group Decision Support System based on AHP-TOPSIS for Culinary Recommendation System 基于AHP-TOPSIS的餐饮推荐群体决策支持系统
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-07-08 DOI: 10.21609/JIKI.V12I2.729
Ratih Kartika Dewi
{"title":"Group Decision Support System based on AHP-TOPSIS for Culinary Recommendation System","authors":"Ratih Kartika Dewi","doi":"10.21609/JIKI.V12I2.729","DOIUrl":"https://doi.org/10.21609/JIKI.V12I2.729","url":null,"abstract":"This paper proposes the integration of AHP and TOPSIS to generate the ranking results of culinary recommendation for a group of users to provide better recommendation results. Formerly, Group Decision Support System (GDSS) for culinary recommendations has been developed with the TOPSIS method. TOPSIS has low algorithm complexity, so it is suitable to be applied in mobile devices. However, GDSS with TOPSIS has its disadvantages, TOPSIS have not been able to facilitate the preferences of each user inside a group so the recommendation result always consist only on dominant user. TOPSIS method produces unchanging rankings, because this method recommends a food menu based on the 1 dominant user so that the ranking is always consistent. Meanwhile, this study aims to integrate AHP for weighting criteria from each user and TOPSIS for ranking culinary recommendations. Based on rank consistency testing results that conducted in 6 different user groups, unlike the previous research, AHP-TOPSIS shows inconsistency ranking, which means that changes in user preferences affect the recommendation results that are generated by application. The AHP-TOPSIS method proved can be accommodated the computation of various preferences of each user in GDSS culinary recommendation","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83500617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Iterated Region for Interactive Image Segmentation on Dental Panoramic Radiograph 基于迭代区域的口腔全景x光片交互式图像分割
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.613
Biandina Meidyani, Lailly S. Qolby, A. Fajrin, A. Arifin, D. A. Navastara
{"title":"Iterated Region for Interactive Image Segmentation on Dental Panoramic Radiograph","authors":"Biandina Meidyani, Lailly S. Qolby, A. Fajrin, A. Arifin, D. A. Navastara","doi":"10.21609/jiki.v12i1.613","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.613","url":null,"abstract":"Image Segmentation is a process to separate between foreground and background. Segmentation process in low contrast image such as dental panoramic radiograph image is not easily determined. Image segmentation accuracy determines the success or failure of the final analysis process. The process of segmentation can occur ambiguity. This ambiguity is due to an ambiguous area if it is not selected as a region so it may have occurred cluster errors. To solve this ambiguity, we proposed a new region merging by iterated region merging process on dental panoramic radiograph image. The proposed method starts from the user marking and works iteratively to label the surrounding regions. In each iteration, the minimal gray-levels value is merged so the unknown regions significantly reduced. This experiment shows that the proposed method is effective with an average of ME and RAE of 0.04% and 0.06%.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"72 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89511592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GOOD PERFORMANCE IMAGES ENCRYPTION USING SELECTIVE BIT T-DES ON INVERTED LSB STEGANOGRAPHY 利用选择性位t-des对反向LSB隐写进行图像加密
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.646
C. A. Sari, E. H. Rachmawanto, Edi Jaya Kusuma
{"title":"GOOD PERFORMANCE IMAGES ENCRYPTION USING SELECTIVE BIT T-DES ON INVERTED LSB STEGANOGRAPHY","authors":"C. A. Sari, E. H. Rachmawanto, Edi Jaya Kusuma","doi":"10.21609/jiki.v12i1.646","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.646","url":null,"abstract":"Transmitting image through the internet needs to be secured because of risk to be stolen. Security techniques that can be used for securing data especially image are cryptography and steganography. Combine these techniques can provide double protection in image security. In this research, we proposed the used of T-DES encryption with a selective bit to improve the time performance because time aspect is one of the important aspects of data transmission process. Four MSB of the secret image will be selected, then it will be encrypted using T-DES. After that, this encrypted results will be combined with other 4 LSB. This encryption scheme result will be embedded into a cover image using inverted LSB because inverted LSB can produce high imperceptible value. From 6 testing images which encrypted using proposed scheme present that proposed encryption scheme is twice faster than classic triple DES and slightly faster than double DES. While the embedding scheme can produce PSNR value above 40 dB with the range between 51 dB to 61 dB as well as SSIM which close to 1. This result denoted that proposed scheme generated good quality of stego images.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"44 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83118718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Shared Memory Architecture for Simulating Sediment-Fluid Flow by OpenMP 用OpenMP模拟泥沙流动的共享内存体系结构
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.635
P. H. Gunawan, A. Utomo
{"title":"Shared Memory Architecture for Simulating Sediment-Fluid Flow by OpenMP","authors":"P. H. Gunawan, A. Utomo","doi":"10.21609/jiki.v12i1.635","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.635","url":null,"abstract":"Simulation of fluid flow using Shallow water equations (SWE) and sediment movement below it using Exner equation is given. Both of the equations will be combined using splitting technique, in which SWE would be computed using Harten-Lax-van Leer and Einfeldt (HLLE) numerical flux, then Exner would be computed semi-implicitly. This paper elaborates the steps of constructing SWE-Exner model. To show the agreement of the scheme, two problems will be elaborated: (1) comparison between analytical solution and numerical solution, and (2) parallelism using OpenMP for Transcritical over a granular bump. The first problem is going to tell the discrete $L^{1}$-, $L^{2}$-, and $L^{infty}$-norm error of the scheme, and the second one will show the simulation result, speedup, and efficiency of the scheme, which is around $56.44%$.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89203744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
TABLING WITH INTERNED TERMS ON CONTEXTUAL ABDUCTION 关于情境绑架的实习术语
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.569
Muhammad Okky Ibrohim, A. Saptawijaya
{"title":"TABLING WITH INTERNED TERMS ON CONTEXTUAL ABDUCTION","authors":"Muhammad Okky Ibrohim, A. Saptawijaya","doi":"10.21609/jiki.v12i1.569","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.569","url":null,"abstract":"Abduction (also called abductive reasoning) is a form of logical inference which starts with an observation and is followed by finding the best explanations. In this paper, we improve the tabling in contextual abduction technique with an advanced tabling feature of XSB Prolog, namely tabling with interned terms. This feature enables us to store the abductive solutions as interned ground terms in a global area only once so that the use of table space to store abductive solutions becomes more efficient. We implemented this improvement to a prototype, called as TABDUAL+INT. Although the experiment result shows that tabling with interned terms is relatively slower than tabling without interned terms when used to return first solutions from a subgoal, tabling with interned terms is relatively faster than tabling without interned terms when used to returns all solutions from a subgoal. Furthermore, tabling with interned terms is more efficient in table space used when performing abduction both in artificial and real world case, compared to tabling without interned terms.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"105 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89156912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Interactive Image Segmentation using Neighborhood Spatial Information and Statistical Grey Level on Dental Panoramic Radiograph 基于邻域空间信息和统计灰度的口腔全景x线图像交互式分割
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.622
Shabrina Choirunnisa, Ari Firmanto, Agus Zaenal
{"title":"Interactive Image Segmentation using Neighborhood Spatial Information and Statistical Grey Level on Dental Panoramic Radiograph","authors":"Shabrina Choirunnisa, Ari Firmanto, Agus Zaenal","doi":"10.21609/jiki.v12i1.622","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.622","url":null,"abstract":" In dental panoramic radiographs, grey-level intensity information has been widely used for object segmentation in digital image. However, low contrast in the radiograph image causes high ambiguity  that can cause the inconsistency of classification result. Since the grey-level intensity of background and object is almost similar, so in order to improve the segmentation result, the spatial distance on neighborhod region is applied.  In this paper, we proposed a novel strategy to measure the distance using neighborhod spatial information and statistical grey level technique for image segmentation. The proposed method starts by calculating adjacency matrix and measured spatial distance on neighborhood region. Since the value of both distances are not in the same range, then the normalization is needed. The distances merging is approached by tuning the weight using several constant values. The experiment results show that our proposed merging strategy has better segmentation result based on Relative Foreground Area Error value.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"58 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84561253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DETECTION OF DISEASE ON CORN PLANTS USING CONVOLUTIONAL NEURAL NETWORK METHODS 卷积神经网络方法在玉米病害检测中的应用
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/JIKI.V12I1.695
Ardi Hidayat, U. Darusalam, I. Irmawati
{"title":"DETECTION OF DISEASE ON CORN PLANTS USING CONVOLUTIONAL NEURAL NETWORK METHODS","authors":"Ardi Hidayat, U. Darusalam, I. Irmawati","doi":"10.21609/JIKI.V12I1.695","DOIUrl":"https://doi.org/10.21609/JIKI.V12I1.695","url":null,"abstract":"Deep Learning is still an interesting issue and is still widely studied. In this study Deep Learning was used for the diagnosis of corn plant disease using the Convolutional Neural Network (CNN) method, with a total dataset of 3.854 images of diseases in corn plants, which consisted of three types of corn diseases namely Common Rust, Gray Leaf Spot, and Northern Leaf Blight. With an accuracy of 99%, in detecting disease in corn plants.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83808441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
KOPYOR COCONUT DETECTION USING SOUND-BASED DYNAMIC TIME WARPING METHOD Kopyor椰子检测基于声音的动态时间规整方法
Jurnal Ilmu Komputer dan Informasi Pub Date : 2019-03-01 DOI: 10.21609/jiki.v12i1.631
Radon Dhelika, F. A. Nugroho, M. Bayu, Alfian Kamil
{"title":"KOPYOR COCONUT DETECTION USING SOUND-BASED DYNAMIC TIME WARPING METHOD","authors":"Radon Dhelika, F. A. Nugroho, M. Bayu, Alfian Kamil","doi":"10.21609/jiki.v12i1.631","DOIUrl":"https://doi.org/10.21609/jiki.v12i1.631","url":null,"abstract":"Kopyor coconut is a coconut that has genetic abnormalities which cause the coconut meat to have a unique texture and is detached from the coconut shell. Its uniqueness attracts many enthusiasts resulting in a high economic value, 4-5 times that of the ordinary coconut. From its external appearance, kopyor coconut does not differ with ordinary coconut and this poses a challenge in the detection stage. To date, both farmers and sellers use a traditional approach by listening to the sound of whisk from kopyor coconut to detect them. Unfortunately, this approach relies heavily on experience and expertise of the person. Therefore, a new detection approach is proposed based on sound recognition using Mel Frequency Cepstrum Coefficient (MFCC) as the method for feature extraction and Dynamic Time Warping (DTW) as the method for feature matching. Objects that will be detected are kopyor coconuts and ordinary coconut which has grown mature. By implementing both methods, a program has been developed to detect kopyor coconut with an accuracy of 93.8%.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"139 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88995834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书