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

The Kips Transactions:partb最新文献

筛选
英文 中文
Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects 分割连接蛇形提取多目标边界算法的实验分析
The Kips Transactions:partb Pub Date : 2012-04-01 DOI: 10.3745/KIPSTB.2012.19B.4.221
Guo Cui, JaeYong Hwang, Jong-Whan Jang
{"title":"Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects","authors":"Guo Cui, JaeYong Hwang, Jong-Whan Jang","doi":"10.3745/KIPSTB.2012.19B.4.221","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.4.221","url":null,"abstract":"The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can`t split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123098630","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
Audio Segmentation and Classification Using Support Vector Machine and Fuzzy C-Means Clustering Techniques 基于支持向量机和模糊c均值聚类技术的音频分割与分类
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.019
N. T. Nguyen, Myeongsu Kang, C. Kim, Jong-Myon Kim
{"title":"Audio Segmentation and Classification Using Support Vector Machine and Fuzzy C-Means Clustering Techniques","authors":"N. T. Nguyen, Myeongsu Kang, C. Kim, Jong-Myon Kim","doi":"10.3745/KIPSTB.2012.19B.1.019","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.019","url":null,"abstract":"The rapid increase of information imposes new demands of content management. The purpose of automatic audio segmentation and classification is to meet the rising need for efficient content management. With this reason, this paper proposes a high-accuracy algorithm that segments audio signals and classifies them into different classes such as speech, music, silence, and environment sounds. The proposed algorithm utilizes support vector machine (SVM) to detect audio-cuts, which are boundaries between different kinds of sounds using the parameter sequence. We then extract feature vectors that are composed of statistical data and they are used as an input of fuzzy c-means (FCM) classifier to partition audio-segments into different classes. To evaluate segmentation and classification performance of the proposed SVM-FCM based algorithm, we consider precision and recall rates for segmentation and classification accuracy for classification. Furthermore, we compare the proposed algorithm with other methods including binary and FCM classifiers in terms of segmentation performance. Experimental results show that the proposed algorithm outperforms other methods in both precision and recall rates.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132768794","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
A Reinforcement Learning Approach to Collaborative Filtering Considering Time-sequence of Ratings 一种考虑评级时间序列的协同过滤强化学习方法
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.031
Jungkyu Lee, B. Oh, Jihoon Yang
{"title":"A Reinforcement Learning Approach to Collaborative Filtering Considering Time-sequence of Ratings","authors":"Jungkyu Lee, B. Oh, Jihoon Yang","doi":"10.3745/KIPSTB.2012.19B.1.031","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.031","url":null,"abstract":"In recent years, there has been increasing interest in recommender systems which provide users with personalized suggestions for products or services. In particular, researches of collaborative filtering analyzing relations between users and items has become more active because of the Netflix Prize competition. This paper presents the reinforcement learning approach for collaborative filtering. By applying reinforcement learning techniques to the movie rating, we discovered the connection between a time sequence of past ratings and current ratings. For this, we first formulated the collaborative filtering problem as a Markov Decision Process. And then we trained the learning model which reflects the connection between the time sequence of past ratings and current ratings using Q-learning. The experimental results indicate that there is a significant effect on current ratings by the time sequence of past ratings.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058280","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
Interval-based Audio Integrity Authentication Algorithm using Reversible Watermarking 基于可逆水印的间隔音频完整性认证算法
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.009
D. Yeo, Hae-Yeoun Lee
{"title":"Interval-based Audio Integrity Authentication Algorithm using Reversible Watermarking","authors":"D. Yeo, Hae-Yeoun Lee","doi":"10.3745/KIPSTB.2012.19B.1.009","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.009","url":null,"abstract":"Many audio watermarking researches which have been adapted to authenticate contents can not recover the original media after watermark removal. Therefore, reversible watermarking can be regarded as an effective method to ensure the integrity of audio data in the applications requiring high-confidential audio contents. Reversible watermarking inserts watermark into digital media in such a way that perceptual transparency is preserved, which enables the restoration of the original media from the watermarked one without any loss of media quality. This paper presents a new interval-based audio integrity authentication algorithm which can detect malicious tampering. To provide complete reversibility, we used differential histogram-based reversible watermarking. To authenticate audio in parts, not the entire audio at once, the proposed algorithm processes audio by dividing into intervals and the confirmation of the authentication is carried out in each interval. Through experiments using multiple kinds of test data, we prove that the presented algorithm provides over 99% authenticating rate, complete reversibility, and higher perceptual quality, while maintaining the induced-distortion low.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133796880","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
Particle Filter Localization Using Noisy Models 基于噪声模型的粒子滤波定位
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.027
Incheol Kim, Seung-Yeon Kim, HyeSuk Kim
{"title":"Particle Filter Localization Using Noisy Models","authors":"Incheol Kim, Seung-Yeon Kim, HyeSuk Kim","doi":"10.3745/KIPSTB.2012.19B.1.027","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.027","url":null,"abstract":"One of the most fundamental functions required for an intelligent agent is to estimate its current position based upon uncertain sensor data. In this paper, we explain the implementation of a robot localization system using Particle filters, which are the most effective one of the probabilistic localization methods, and then present the result of experiments for evaluating the performance of our system. Through conducting experiments to compare the effect of the noise-free model with that of the noisy state transition model considering inherent errors of robot actions, we show that it can help improve the performance of the Particle filter localization to apply a state transition model closely approximating the uncertainty of real robot actions.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116789986","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
Photomosaic Algorithm with Adaptive Tilting and Block Matching 自适应倾斜和块匹配的Photomosaic算法
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.001
S. Seo, Ki-Wong Kim, Sunmyeng Kim, Hae-Yeoun Lee
{"title":"Photomosaic Algorithm with Adaptive Tilting and Block Matching","authors":"S. Seo, Ki-Wong Kim, Sunmyeng Kim, Hae-Yeoun Lee","doi":"10.3745/KIPSTB.2012.19B.1.001","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.001","url":null,"abstract":"Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487571","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
Gathering Common-word and Document Reclassification to improve Accuracy of Document Clustering 收集共词和文档重分类以提高文档聚类的准确性
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.053
Joon-Choul Shin, Cheolyoung Ock, Eung-Bong Lee
{"title":"Gathering Common-word and Document Reclassification to improve Accuracy of Document Clustering","authors":"Joon-Choul Shin, Cheolyoung Ock, Eung-Bong Lee","doi":"10.3745/KIPSTB.2012.19B.1.053","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.053","url":null,"abstract":"Clustering technology is used to deal efficiently with many searched documents in information retrieval system. But the accuracy of the clustering is satisfied to the requirement of only some domains. This paper proposes two methods to increase accuracy of the clustering. We define a common-word, that is frequently used but has low weight during clustering. We propose the method that automatically gathers the common-word and calculates its weight from the searched documents. From the experiments, the clustering error rates using the common-word is reduced to 34% compared with clustering using a stop-word. After generating first clusters using average link clustering from the searched documents, we propose the algorithm that reevaluates the similarity between document and clusters and reclassifies the document into more similar clusters. From the experiments using Naver JiSikIn category, the accuracy of reclassified clusters is increased to 1.81% compared with first clusters without reclassification.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124175989","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
Query Expansion based on Word Graph using Term Proximity 基于词邻近度的词图查询扩展
The Kips Transactions:partb Pub Date : 2012-02-29 DOI: 10.3745/KIPSTB.2012.19B.1.037
Kye-Hun Jang, Kyung-Soon Lee
{"title":"Query Expansion based on Word Graph using Term Proximity","authors":"Kye-Hun Jang, Kyung-Soon Lee","doi":"10.3745/KIPSTB.2012.19B.1.037","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.037","url":null,"abstract":"The pseudo relevance feedback suggests that frequent words at the top documents are related to initial query. However, the main drawback associated with the term frequency method is the fact that it relies on feature independence, and disregards any dependencies that may exist between words in the text. In this paper, we propose query expansion based on word graph using term proximity. It supplements term frequency method. On TREC WT10g test collection, experimental results in MAP(Mean Average Precision) show that the proposed method achieved 6.4% improvement over language model.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122426766","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
Korean Compound Noun Decomposition and Semantic Tagging System using User-Word Intelligent Network 基于用户词智能网络的韩语复合名词分解与语义标注系统
The Kips Transactions:partb Pub Date : 2012-02-01 DOI: 10.3745/KIPSTB.2012.19B.1.063
Yong-Hoon Lee, Cheolyoung Ock, Eung-Bong Lee
{"title":"Korean Compound Noun Decomposition and Semantic Tagging System using User-Word Intelligent Network","authors":"Yong-Hoon Lee, Cheolyoung Ock, Eung-Bong Lee","doi":"10.3745/KIPSTB.2012.19B.1.063","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.1.063","url":null,"abstract":"We propose a Korean compound noun semantic tagging system using statistical compound noun decomposition and semantic relation information extracted from a lexical semantic network(U-WIN) and dictionary definitions. The system consists of three phases including compound noun decomposition, semantic constraint, and semantic tagging. In compound noun decomposition, best candidates are selected using noun location frequencies extracted from a Sejong corpus, and re-decomposes noun for semantic constraint and restores foreign nouns. The semantic constraints phase finds possible semantic combinations by using origin information in dictionary and Naive Bayes Classifier, in order to decrease the computation time and increase the accuracy of semantic tagging. The semantic tagging phase calculates the semantic similarity between decomposed nouns and decides the semantic tags. We have constructed 40,717 experimental compound nouns data set from Standard Korean Language Dictionary, which consists of more than 3 characters and is semantically tagged. From the experiments, the accuracy of compound noun decomposition is 99.26%, and the accuracy of semantic tagging is 95.38% respectively.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129225871","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
Integrity Authentication Algorithm of JPEG Compressed Images through Reversible Watermarking 基于可逆水印的JPEG压缩图像完整性认证算法
The Kips Transactions:partb Pub Date : 2012-02-01 DOI: 10.3745/KIPSTB.2012.19B.2.083
Hyun-Wu Jo, D. Yeo, Hae-Yeoun Lee
{"title":"Integrity Authentication Algorithm of JPEG Compressed Images through Reversible Watermarking","authors":"Hyun-Wu Jo, D. Yeo, Hae-Yeoun Lee","doi":"10.3745/KIPSTB.2012.19B.2.083","DOIUrl":"https://doi.org/10.3745/KIPSTB.2012.19B.2.083","url":null,"abstract":"Multimedia contents can be copied and manipulated without quality degradation. Therefore, they are vulnerable to digital forgery and illegal distribution. In these days, with increasing the importance of multimedia security, various multimedia security techniques are studied. In this paper, we propose a content authentication algorithm based on reversible watermarking which supports JPEG compression commonly used for multimedia contents. After splitting image blocks, a specific authentication code for each block is extracted and embedded into the quantized coefficients on JPEG compression which are preserved against lossy processing. At a decoding process, the watermarked JPEG image is authenticated by extracting the embedded code and restored to have the original image quality. To evaluate the performance of the proposed algorithm, we analyzed image quality and compression ratio on various test images. The average PSNR value and compression ratio of the watermarked JPEG image were 33.13dB and 90.65%, respectively, whose difference with the standard JPEG compression were 2.44dB and 1.63%.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126036008","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信