• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2511-2520
• /
• 2018

In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.205-214
• /
• 2006

Texts in images have significant and detailed information about the scenes, and if we can automatically detect and recognize those texts in real-time, it can be used in various applications. In this paper, we propose a new text detection method that can find texts from the various camera-captured images and propose a text segmentation method from the detected text regions. The detection method proposes color variance as a detection feature in RGB color space, and the segmentation method suggests an improved K-means color clustering in RGB color space. We have tested the proposed methods using various kinds of document style and natural scene images captured by digital cameras and mobile-phone camera, and we also tested the method with a portion of ICDAR[1] contest images.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.993-997
• /
• 2009

Clustering is well known method and that can be used in statistical machine translation. In this paper we propose a corpus clustering method using syntactic structure and POS information of dependency grammar. And using this cluster language model as additional feature to phrased-based statistical machine translation system to improve translation Quality.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.97-107
• /
• 1997

Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.4
• /
• pp.107-115
• /
• 2008

Accurate extraction of traversable region is a critical issue for autonomous navigation of unmanned ground vehicle(UGV). This paper introduces enhanced extraction of traversable region by combining scene clustering with 3D world modeling using CCD(Charge-Coupled Device)/IR(Infra Red) image. Scene clustering is developed with K-means algorithm based on CCD and IR image. 3D world modeling is developed by fusing CCD and IR stereo image. Enhanced extraction of traversable regions is obtained by combining feature of extraction with a clustering method and a geometric characteristic of terrain derived by 3D world modeling.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.163-177
• /
• 2021

Many methods of discovering social networking communities or clustering of features are based on the network structure or the content network. This paper proposes a community discovery method based on topic models using a time factor and an unsupervised clustering method. Online community discovery enables organizations and businesses to thoroughly understand the trend in users' interests in their products and services. In addition, an insight into customer experience on social networks is a tremendous competitive advantage in this era of ecommerce and Internet development. The objective of this work is to find clusters (communities) such that each cluster's nodes contain topics and individuals having similarities in the attribute space. In terms of social media analytics, the method seeks communities whose members have similar features. The method is experimented with and evaluated using a Vietnamese corpus of comments and messages collected on social networks and ecommerce sites in various sectors from 2016 to 2019. The experimental results demonstrate the effectiveness of the proposed method over other methods.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.4
• /
• pp.105-115
• /
• 1998

In this paper, we propose a document clustering and retrieval tool which allows users to manage their emotion based document access. This system name is ECRAS(Emotion based Clustering and Retrieval Agent System). Our system extract S emotion feature which like HAPPY, SAD, ANGRY, FEAR, DISGUST from various document. And, our system have retrieve documents for user query base on emotion feature.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.247-250
• /
• 2000

This paper proposes a finger crease pattern identification algorithm utilizing a clustering method. The algorithms has been developed for the use of biometric person identification system. Since the finger crease pattern may be well-imaged utilizing low cost imaging devices such as low-end CCD camera with LED lighting, the feasibility of commercialization of the algorithm and the system utilizing the algorithm may be well justified if the finger crease pattern is a reasonable choice for the biometric feature. In this paper, we exploit this possibility and show the potential of using the finger crease pattern as a feature for biometric person identification.

• Journal of Biomedical Engineering Research
• /
• v.16 no.2
• /
• pp.121-128
• /
• 1995

Information about retinal blood vessels can be used in grading disease severity or as part of the process of automated diagnosis of diseases with ocular menifestations. In this paper, we address the problem of detecting retinal blood vessels and optic disk (papilla) in eye-fundus images. We introduce an algorithm for feature extraction based on Fuzzy Clustering algorithm (fuzzy c-means). A method of finding the optic disk (papilla) is proposed in the eye-fundus images. Additionally, the inrormations such as position and area of the optic disk are extracted. The results are compared to those obtained from other methods. The automatic detection of retinal blood vessels and optic disk in the eye-rundus images could help physicians in diagnosing ocular diseases.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.58-64
• /
• 2007

In pattern recognition field, there are many optimization problems having exponential search spaces. To solve of sequential search algorithms seeking sub-optimal solutions have been used. The algorithms have limitations of stopping at local optimums. Recently lots of researches attempt to solve the problems using genetic algorithms. This paper explains the huge search spaces of typical problems such as feature selection, classifier ensemble selection, neural network pruning, and clustering, and it reviews the genetic algorithms for solving them. Additionally we present several subjects worthy of noting as future researches.