• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.45-53
• /
• 1999

Geographic Information System(GIS) which facilitates efficient storage and retrieval of geographic information is very useful tools. It is of extreme importance to develop automated vectorizing system as input method for GIS, because it takes a large amount of time and effort in constructing a GIS. In all kinds of map processed by GIS, contour line map specially takes a large amount of effort. In this paper we have considered an optimal thinning algorithm for the contour line vectorizing in the GIS. Based on the experimental results, it has been proved that thinning algorithm using the connection value is most excellent algorithm in the similarity and connectivity.

• Annual Conference on Human and Language Technology
• /
• 2002.10e
• /
• pp.129-136
• /
• 2002

고성능의 질의응답 시스템을 구현하기 위해서는 사용자의 질의 유형의 난이도에 관계없이 의도를 파악할 수 있는 질의유형 분류기가 필요하다. 본 논문에서는 문서 범주화 기법을 이용한 질의 유형 분류기를 제안한다. 본 논문에서 제안하는 질의 유형 분류기의 분류 과정은 다음과 같다. 우선, 사용자 질의에 포함된 어휘, 품사, 의미표지와 같은 다양한 정보를 이용하여 사용자 질의로부터 자질들을 추출한다. 이 과정에서 질의의 구문 특성을 반영하기 위해서 슬라이딩 윈도 기법을 이용한다. 또한, 다량의 자질들 중에서 유용한 것들만을 선택하기 위해서 카이 제곱 통계량을 이용한다. 추출된 자질들은 벡터 공간 모델로 표현되고, 문서 범주화 기법 중 하나인 지지 벡터 기계(support vector machine, SVM)는 이 정보들을 이용하여 질의 유형을 분류한다. 본 논문에서 제안하는 시스템은 질의 유형 분류 문제에지지 벡터 기계를 이용한 자동문서 범주화 기법을 도입하여 86.4%의 높은 분류 정확도를 보였다. 또한 질의 유형 분류기를 통계적 방법으로 구축함으로써 lexico-syntactic 패턴과 같은 규칙을 기술하는 수작업을 배제할 수 있으며, 응용 영역의 변화에 대해서도 안정적인 처리와 빠른 이식성을 보장한다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.784-791
• /
• 2004

In this study, we deal with face recognition using fuzzy-based Fisherface method. The well-known Fisherface method is more insensitive to large variation in light direction, face pose, and facial expression than Principal Component Analysis method. Usually, the various methods of face recognition including Fisherface method give equal importance in determining the face to be recognized, regardless of typicalness. The main point here is that the proposed method assigns a feature vector transformed by PCA to fuzzy membership rather than assigning the vector to particular class. In this method, fuzzy membership degrees are obtained from FKNN(Fuzzy K-Nearest Neighbor) initialization. Experimental results show better recognition performance than other methods for ORL and Yale face databases.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1693-1702
• /
• 1999

This paper proposes the use of an adaptive Wiener filter for edge-preserving image filtering. Images are partitioned into a set of blocks of pixels which is divided into five subsets of blocks according to their edge contents and orientations. Each subset of blocks is used to define a covariance matrix, from which a Wiener filter is derived. Five covariance matrices and Wiener filters are thus obtained. An image-block classifier using the five sets of covariance matrices of the class is designed to classify each incoming block of pixels according to its edge content in the presence of noise. Experimental results are included to verify the usefulness of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.5
• /
• pp.25-32
• /
• 2011

In this paper, we propose a subspace search-based detector (SSD) with low-complexity to achieve near optimal performance for multiple-input multiple-output systems. As an effective solution to reduce the prohibitive computational complexity of the optimal maximum likelihood detector, a partial candidate symbol vector is generated through a partitioned search space but not the entire search space. In addition, based on a partial candidate symbol vector, an ensemble candidate symbol vector generation considering the whole search space is introduced to produce a near optimal solution. As a result, the proposed SSD achieves near-maximum-likelihood performance while having a significantly reduced computational complexity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.254-259
• /
• 2013

A newly developed fall recognition algorithm using gravity weighted 3-axis accelerometer data as the input of HMM (Hidden Markov Model) is introduced. Five types of fall feature parameters including the sum vector magnitude(SVM) and a newly-defined gravity-weighted sum vector magnitude(GSVM) are applied to a HMM to evaluate the accuracy of fall recognition. A GSVM parameter shows the best accuracy of falls which is 100% of sensitivity and 97.96% of specificity, and comparing with SVM, the results archive more improved recognition rate, 5.2% of sensitivity and 4.5% of specificity. GSVM shows higher recognition rate than SVM due to expressing falls characteristics well, whereas SVM expresses the only momentum.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.10 no.4
• /
• pp.9-16
• /
• 2010

In the health monitoring of civil engineering structures, the optimal sensor placement has a major influence on the quality of the results. This paper considers the problem of locating sensors with the aim of maximizing the data information so that structural parameters or damage of structures can be assessed. An proposed technique using a genetic algorithm is introduced to find the optimal placement of sensors. The sensitivity on modal vectors by structural parameters and the orthogonality of modal vectors have been taken as the fitness function of the genetic algorithm. A simple tower structure is used for example analyses to investigate the feasibility and applicability of the proposed approach. The example analyses show the way how the modal sensitivity and the modal orthogonality in the fitness function have influence on the optimal sensor placement. It is shown that the present method using the proposed fitness function can provide the reliable results.

• The Korean Journal of Applied Statistics
• /
• v.26 no.6
• /
• pp.903-913
• /
• 2013

Social network services generate a considerable amount of social data every day on personal feelings or thoughts. This social data provides changing patterns of information production and consumption but are also a tool that reflects social phenomenon. We analyze negative emotional words from daily blogs to detect the change in blooger sentiment using multivariate control charts. We used the all the blogs produced between 1 January 2008 and 31 December 2009. Hotelling's T-square control chart control chart is commonly used to monitor multivariate quality characteristics; however, it assumes that quality characteristics follow multivariate normal distribution. The performance of a multivariate control chart is affected by this assumption; consequently, we introduce the support vector data description and its extension (K-control chart) suggested by Sun and Tsung (2003) and they are applied to detect the chage in blogger sentiment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.25-36
• /
• 2008

Eye localization means localization of the center of the pupils, and is necessary for face recognition and related applications. Most of eye localization methods reported so far still need to be improved about robustness as well as precision for successful applications. In this paper, we propose a robust eye localization method using multi-scale Gabor feature vectors without big computational burden. The eye localization method using Gabor feature vectors is already employed in fuck as EBGM, but the method employed in EBGM is known not to be robust with respect to initial values, illumination, and pose, and may need extensive search range for achieving the required performance, which may cause big computational burden. The proposed method utilizes multi-scale approach. The proposed method first tries to localize eyes in the lower resolution face image by utilizing Gabor Jet similarity between Gabor feature vector at an estimated initial eye coordinates and the Gabor feature vectors in the eye model of the corresponding scale. Then the method localizes eyes in the next scale resolution face image in the same way but with initial eye points estimated from the eye coordinates localized in the lower resolution images. After repeating this process in the same way recursively, the proposed method funally localizes eyes in the original resolution face image. Also, the proposed method provides an effective illumination normalization to make the proposed multi-scale approach more robust to illumination, and additionally applies the illumination normalization technique in the preprocessing stage of the multi-scale approach so that the proposed method enhances the eye detection success rate. Experiment results verify that the proposed eye localization method improves the precision rate without causing big computational overhead compared to other eye localization methods reported in the previous researches and is robust to the variation of post: and illumination.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.67-72
• /
• 2003

In this paper, we study the enhancement of VQ (Vector Quantization) design for text dependent speaker recognition. In a concrete way, we present the non-Iterative method which makes a vector quantization codebook and this method Is nut Iterative learning so that the computational complexity is epochally reduced. The proposed semi-noniterative VQ design method contrasts with the existing design method which uses the iterative learning algorithm for every training speaker. The characteristics of a semi-noniterative VQ design is as follows. First, the proposed method performs the iterative learning only for the reference speaker, but the existing method performs the iterative learning for every speaker. Second, the quantization region of the non-reference speaker is equivalent for a quantization region of the reference speaker. And the quantization point of the non-reference speaker is the optimal point for the statistical distribution of the non-reference speaker In the numerical experiment, we use the 12th met-cepstrum feature vectors of 20 speakers and compare it with the existing method, changing the codebook size from 2 to 32. The recognition rate of the proposed method is 100% for suitable codebook size and adequate training data. It is equal to the recognition rate of the existing method. Therefore the proposed semi-noniterative VQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal.