• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.483-488
• /
• 2016

In this paper, we propose a prototype-based classification learning by using the nearest-neighbor rule. The nearest-neighbor is applied to segment the class area of all the training data with hyperspheres, and a hypersphere must cover the data from the same class. The radius of a hypersphere is computed by the mid point of the two distances to the farthest same class point and the nearest other class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that cover all the training data. The proposed prototype selection method is designed by a greedy algorithm and applicable to process a large-scale training set in parallel. The prediction rule is the nearest-neighbor rule and the new training data is the set of prototypes. In experiments, the generalization performance of the proposed method is superior to existing methods.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.1002-1013
• /
• 1996

The segmentation of characters is an important step in the automatic recognition of handwritten text. This paper proposes the segmenting method of off-line handwritten Hangul. The suggested approach is based on the structural characteristics of Hangul. The first step extracts the local features. connected component and strokes from the imput word. In the second step we identify the class of strokes. The third segmenting step specifies WRC(White Run Column) before consonant or horizontal vowel. If the segment is longer than threshold, the system estimates segmenting columns using the consonant-vowel information and column features, and then finds a cornered boundary along the strokes within the estimated segmenting columns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1689-1701
• /
• 2019

In recent years, personal videos have been shared online due to the popular uses of portable devices, such as smartphones and action cameras. A recent report predicted that 80% of the Internet traffic will be video content by the year 2021. Several studies have been conducted on the detection of main video events to manage a large scale of videos. These studies show fairly good performance in certain genres. However, the methods used in previous studies have difficulty in detecting events of personal video. This is because the characteristics and genres of personal videos vary widely. In a research, we found that adding a dataset with the right perspective in the study improved performance. It has also been shown that performance improves depending on how you extract keyframes from the video. we selected frame segments that can represent video considering the characteristics of this personal video. In each frame segment, object, location, food and audio features were extracted, and representative vectors were generated through a CNN-based recurrent model and a fusion module. The proposed method showed mAP 78.4% performance through experiments using LSVC data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2551-2561
• /
• 2014

Several algorithms have been developed to detect AFIB(Atrial Fibrillation) which either rely on the linear and frequency analysis. But they are more complex than time time domain algorithm and difficult to get the consistent rule of irregular RR interval rhythm. In this study, we propose algorithm for optimal value detection of irregular RR interval for AFIB classification based on linear analysis. For this purpose, we detected R wave, RR interval, from noise-free ECG signal through the preprocessing process and subtractive operation method. Also, we set scope for segment length and detected optimal value and then classified AFIB in realtime through liniar analysis such as absolute deviation and absolute difference. The performance of proposed algorithm for AFIB classification is evaluated by using MIT-BIH arrhythmia and AFIB database. The optimal value indicate ${\alpha}=0.75$, ${\beta}=1.4$, ${\gamma}=300ms$ in AFIB classification.

• Information Systems Review
• /
• v.22 no.4
• /
• pp.75-92
• /
• 2020

As population and generation structures change, more and more customers tend to avoid facing relation due to the development of information technology and spread of smart phones. This phenomenon consists with efficiency and immediacy, which are the consumption patterns of modern customers who are used to information technology, so offline network-oriented distribution companies actively try to switch their sales and services to untact patterns. Recently, untact services are boosted in various fields, but beauty products are not easy to be recommended through untact services due to many options depending on skin types and conditions. There have been many studies on recommendations and development of recommendation systems in the online beauty field, but most of them are the ones that develop recommendation algorithm using survey or social data. In other words, there were not enough studies that classify segments based on user information such as skin types and product preference. Therefore, this study classifies customer segments using machine learning technique K-prototypesalgorithm based on customer information and search log data of mobile application, which is one of untact services in the beauty field, based on which, untact marketing strategy is suggested. This study expands the scope of the previous literature by classifying customer segments using the machine learning technique. This study is practically meaningful in that it classifies customer segments by reflecting new consumption trend of untact service, and based on this, it suggests a specific plan that can be used in untact services of the beauty field.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.697-702
• /
• 2005

The focused crawler is a topic-driven document-collecting crawler that was suggested as a promising alternative of maintaining up-to-date web document Indices in search engines. A major problem inherent in previous focused crawlers is the liability of missing highly relevant documents that are linked from off-topic documents. This problem mainly originated from the lack of consideration of structural information in a document. Traditional weighting method such as TFIDF employed in document classification can lead to this problem. In order to improve the performance of focused crawlers, this paper proposes a scheme of locality-based document segmentation to determine the relevance of a document to a specific topic. We segment a document into a set of sub-documents using contextual features around the hyperlinks. This information is used to determine whether the crawler would fetch the documents that are linked from hyperlinks in an off-topic document.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.253-260
• /
• 1999

In this paper, we suggest a new direct method for mage segmentation using texture and color information combined through a multivariate linear discriminant algorithm. The color texture is computed in nin 3${\times}$3 masks obtained from each 3${\times}$3${\times}$3 spatio-spectral neighborhood in the image using the classical haralick and Pressman texture features. Among these 9${\times}$28 texture features the best set was extracted from a training set. The resulting set of 10 features were used to segment an image into four different regions. The resulting segmentation was Compared to classical color and texture segmentation methods using both box classifiers and maximum likelihood classification. It compared favourably on the test image from a Fastred-Lightgreen stained prostatic histological tissue section based on visual inspection. The classification accuracy of 97.5% for the new method obtained on the training data was also among the best of the tested methods. If these results hold for a larger set of images, this method should be a useful tool for segmenting images where both color and texture are relevant for the segmentation process.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.59-67
• /
• 2008

In this paper we propose an algorithm to extract the license plate regions from Korean car images. The idea of this paper is that we first find the four digits in the input car image and then segment the plate region using the digit information. Out method has advantage of segmenting simultaneously the plate regions and four digits regions. The first step finds and groups the connected components with proper sizes as candidate digits. The second step applies an serial alignment condition to find out probable 4-digits. In the third step, we recognize the candidate digits and assign the confidence values to each of them. The final step extracts the license plate region which has the highest confidence value. We used the Perfect Metrics classification algorithm to estimate the confidence. In our experiment, we got 97.23% and 95.45% correct detection rates, 0.09% and 0.11% false detection rates for 4,600 daytime and 264 nighttime images, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.802-814
• /
• 1993

This paper propose an algorithm for preprocessing of character recognition, which classify characters into Hangeul and Hanja. In this study, we use the 9 structural chacteristics of Hanja which isn't affected by deformation of size and style of characters and rates based on character size to classify characters. Firstly, we process the blocking to segment each characters. Secondly, on this segmented characters, we apply algorithm proposed in this paper to classify Hangeul and Hanja. Finally, we classify characters into Hangeul and Hanja, respectively. An experiment with 2350 Hangeul and 4888 Hanja printed Gothic and Mincho style of KS-C 5601 are carried out. We experiment on typeface sample book, newspapers, academic society's papers, magazines, textbooks and documents written out word processor to obtain the classifying rates of 98.8%, 92%, 96%, 98% and 98%, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.1-6
• /
• 2004

there needs a new Geographic information system development Technology of the abstraction, encapsulation, modulation and hierarchy using Graphic representation of object modeling Technique. The method is based on composite object of Graphic data with the hierarchy concepts and abstraction of Graphic information in order to improve data abstraction of the graphic data file and described concept of multiple inheritance and classification that supports a wide variety of graphic class such as mesh unit, layer. segment and so on. in simple case of software development using SPICE model and object modeling techniques. this thesis suggested object representation of Graphic data which can reduce software development life cycle and the cost of software maintenance.