{"title":"Transliteration Correction Method using Korean Alphabet Viable Prefix","authors":"Soonho Kwon, H. Kwon","doi":"10.3745/KIPSTB.2011.18B.2.087","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.087","url":null,"abstract":"In Korean documents, there are diverse spellings of transliterated foreign loanwords. This fact diminishes the performance of information retrieval systems in that a foreign word can be recognized differently, which is to say, as two or several different words. Thus, information retrieval systems require preprocessing to correct nonstandard loanword spellings prior to searching and recognizing corresponding equivalent words. This paper proposes a method that improves precision and processing efficiency using the Korean alphabet`s viable prefix, which prunes a virtual tree from which candidate loanwords are created.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511126","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}
{"title":"Automatic Left Ventricle Segmentation Algorithm using K-mean Clustering and Graph Searching on Cardiac MRI","authors":"Hyun-Wu Jo, Hae-Yeoun Lee","doi":"10.3745/KIPSTB.2011.18B.2.057","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.057","url":null,"abstract":"To prevent cardiac diseases, quantifying cardiac function is important in routine clinical practice by analyzing blood volume and ejection fraction. These works have been manually performed and hence it requires computational costs and varies depending on the operator. In this paper, an automatic left ventricle segmentation algorithm is presented to segment left ventricle on cardiac magnetic resonance images. After coil sensitivity of MRI images is compensated, a K-mean clustering scheme is applied to segment blood area. A graph searching scheme is employed to correct the segmentation error from coil distortions and noises. Using cardiac MRI images from 38 subjects, the presented algorithm is performed to calculate blood volume and ejection fraction and compared with those of manual contouring by experts and GE MASS software. Based on the results, the presented algorithm achieves the average accuracy of 6.2mL5.6, 2.9mL3.0 and 2.1%1.5 in diastolic phase, systolic phase and ejection fraction, respectively. Moreover, the presented algorithm minimizes user intervention rates which was critical to automatize algorithms in previous researches.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116100391","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}
{"title":"A Smoke Detection Method based on Video for Early Fire-Alarming System","authors":"T. X. Truong, Jong-Myon Kim","doi":"10.3745/KIPSTB.2011.18B.4.213","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.4.213","url":null,"abstract":"This paper proposes an effective, four-stage smoke detection method based on video that provides emergency response in the event of unexpected hazards in early fire-alarming systems. In the first phase, an approximate median method is used to segment moving regions in the present frame of video. In the second phase, a color segmentation of smoke is performed to select candidate smoke regions from these moving regions. In the third phase, a feature extraction algorithm is used to extract five feature parameters of smoke by analyzing characteristics of the candidate smoke regions such as area randomness and motion of smoke. In the fourth phase, extracted five parameters of smoke are used as an input for a K-nearest neighbor (KNN) algorithm to identify whether the candidate smoke regions are smoke or non-smoke. Experimental results indicate that the proposed four-stage smoke detection method outperforms other algorithms in terms of smoke detection, providing a low false alarm rate and high reliability in open and large spaces.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129911180","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}
Myungeun Lee, Wanhyun Cho, Sun-Worl Kim, Yanjuan Chen, Soohyung Kim
{"title":"Performance Comparison Between New Level Set Method and Previous Methods for Volume Images Segmentation","authors":"Myungeun Lee, Wanhyun Cho, Sun-Worl Kim, Yanjuan Chen, Soohyung Kim","doi":"10.3745/KIPSTB.2011.18B.3.131","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.3.131","url":null,"abstract":"In this paper, we compare our proposed method with previous methods for the volumetric image segmentation using level set. In order to obtain an exact segmentation, the region and boundary information of image object are used in our proposed speed function. The boundary information is defined by the gradient vector flow obtained from the gradient images and the region information is defined by Gaussian distribution information of pixel intensity in a region-of-interest for image segmentation. Also the regular term is used to remove the noise around surface. We show various experimental results of real medical volume images to verify the superiority of proposed method.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124942497","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}
{"title":"Non-parametric Background Generation based on MRF Framework","authors":"Sang-Hyun Cho, Hang-Bong Kang","doi":"10.3745/KIPSTB.2010.17B.6.405","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.405","url":null,"abstract":"ABSTRACT Previous background generation techniques showed bad performance in complex environments since they used only temporal contexts. To overcome this problem, in this paper, we propose a new background generation method which incorporates spatial as well as temporal contexts of the image. This enabled us to obtain ‘clean’ background image with no moving objects. In our proposed method, first we divided the sampled frame into m*n blocks in the video sequence and classified each block as either static or non-static. For blocks which are classified as non-static, we used MRF framework to model them in temporal and spatial contexts. MRF framework provides a convenient and consistent way of modeling context-dependent entities such as image pixels and correlated features. Experimental results show that our proposed method is more efficient than the traditional one.Keywords:Background Generation, Background Model, Surveillance System, MRF Framework, Object Tracking 1. 서 론 1) 비디오 감시 시스템이나 모니터링 시스템과 같이 다양한 컴퓨터 비전 응용분야에서 물체 검출과 추적은 매우 중요한 요소로서 현재도 활발한 연구가 이루어지고 있는 분야이다. 많은 검출 및 추적 시스템에서 움직이는 물체가 포함되어 있지 않은 배경 영상은 물체 검출 및 추적을 위한 참조 정보로서 이용된다. 하지만 대부분의 경우, 이러한 배경 영상을 획득하는 것은 어려운 일이다.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127861685","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}
{"title":"A Dynamic Bandwidth Allocation Scheme based on Playback Buffer Level in a Distributed Mobile Multimedia System","authors":"Jin-Hwan Kim","doi":"10.3745/KIPSTB.2010.17B.6.413","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.413","url":null,"abstract":"In this paper, we propose a scheme for dynamic allocating network bandwidth based on the playback buffer levels of the clients in a distributed mobile multimedia system. In this scheme, the amount of bandwidth allocated to serve a video request depends on the buffer level of the requesting client. If the buffer level of a client is low or high temporarily, more or less bandwidth will be allocated to serve it with an objective to make it more adaptive to the playback situation of this client. By employing the playback buffer level based bandwidth allocation policy, fair services can also be provided to the clients. In order to support high quality video playbacks, video frames must be transported to the client prior to their playback times. The main objectives in this bandwidth allocation scheme are to enhance the quality of service and performance of individual video playback such as to minimize the number of dropped video frames and at the same time to provide fair services to all the concurrent video requests. The performance of the proposed scheme is compared with that of other static bandwidth allocation scheme through extensive simulation experiments, resulting in the 4-9% lower ratio of frames dropped according to the buffer level.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115063362","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}
Jae-Heung Park, Jum-Sook Lee, Y. Seo, Do-Soon Hong, Hyun-Joo Kim
{"title":"A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000","authors":"Jae-Heung Park, Jum-Sook Lee, Y. Seo, Do-Soon Hong, Hyun-Joo Kim","doi":"10.3745/KIPSTB.2010.17B.6.421","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.421","url":null,"abstract":"It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn`t have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129476738","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}
{"title":"Constructing 3D Outlines of Objects based on Feature Points using Monocular Camera","authors":"Sangho Park, Jeong-Oog Lee, D. Baik","doi":"10.3745/KIPSTB.2010.17B.6.429","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.429","url":null,"abstract":"This paper presents a method to extract 3D outlines of objects in an image obtained from a monocular vision. After detecting the general outlines of the object by MOPS(Multi-Scale Oriented Patches) -algorithm and we obtain their spatial coordinates. Simultaneously, it obtains the space-coordinates with feature points to be immanent within the outlines of objects through SIFT(Scale Invariant Feature Transform)-algorithm. It grasps a form of objects to join the space-coordinates of outlines and SIFT feature points. The method which is proposed in this paper, it forms general outlines of objects, so that it enables a rapid calculation, and also it has the advantage capable of collecting a detailed data because it supplies the internal-data of outlines through SIFT feature points.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128294998","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}
{"title":"Probabilistic Part-Of-Speech Determination for Efficient English-Korean Machine Translation","authors":"Sung-Dong Kim, Il Kim","doi":"10.3745/KIPSTB.2010.17B.6.459","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.459","url":null,"abstract":"Natural language processing has several ambiguity problems, and English-Korean machine translation especially includes those problems to be solved in each translation step. This paper focuses on resolving part-of-speech ambiguity of English words in order to improve the efficiency of English analysis, which is in part of efforts for developing practical English-Korean machine translation system. In order to improve the efficiency of the English analysis, the part-of-speech determination must be fast and accurate for being integrated with machine translation system. This paper proposes the probabilistic models for part-of-speech determination. We use Penn Treebank corpus in building the probabilistic models. In experiment, we present the performance of the part-of-speech determination models and the efficiency improvement of the machine translation system by the proposed part-of-speech determination method.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662208","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}
C. Moon, Jee-Woong Bark, Hae-Yeoun Lee, Byeong-Man Kim, Y. Shin
{"title":"LCD BLU Defects Detection System with Sidelight","authors":"C. Moon, Jee-Woong Bark, Hae-Yeoun Lee, Byeong-Man Kim, Y. Shin","doi":"10.3745/KIPSTB.2010.17B.6.445","DOIUrl":"https://doi.org/10.3745/KIPSTB.2010.17B.6.445","url":null,"abstract":"A Cold Cathode Fluorescent Lamp(CCFL) is used as a LCD Monitor`s backlight widely. The most common way to check CCFL`s defects is an examination with the naked eye. This naked eye examination can cause examination inconsistencies and industrial disasters. A shooting environment and detection algorithms are important for finding CCFL defects automatically. This paper presents CCFL defect detection algorithms using images captured under the shooting environment with sidelight which is one of the shooting environment we have suggested. The experimental result shows 4.65% of overdetection and 5.37% of unsuccessful defect detection of CCFL.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120954981","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}