• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.315-316
• /
• 2011

일반적으로 영상에서 얼굴 영상을 검출하고 인식하는 알고리즘은 패턴 인식 연구에 있어서 인간과 컴퓨터의 상호작용의 연구라는 면에서 아주 중요한 문제로 연구되어 왔다. 본 논문에서는 고유얼굴을 이용하여 유클리디언 거리법과 퍼지기법의 인식률을 비교해보고자 한다. PCA(Principal Component Analysis) 방식은 우수한 인식 결과를 보장하는 얼굴인식 기법중의 하나이며, 얼굴 영상을 이용하여 공분산 행렬을 계산하고, 공분산 행렬을 통해 생성된 저차원의 벡터, 즉 고유얼굴(Eigenface)을 이용하여 가중치를 계산하고, 이 가중치를 기준으로 인식을 수행하는 기법이다. 이를 기반으로 하여, 본 논문에서는 전처리 과정, 고유얼굴 과정, 유클리디언 거리법 및 퍼지 소속도 함수 설계 과정, 신경망 학습과정, 인식과정으로 구성된 5단계의 얼굴 인식 알고리즘을 제안한다.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.781-788
• /
• 2011

A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.

• Annual Conference on Human and Language Technology
• /
• 2001.10d
• /
• pp.487-493
• /
• 2001

본 논문에서는 Bayes 정리를 적용한 통계기반 동형이의어 분별 시스템에 대한 외부실험 결과를 분석하여, 정확률 향상을 위한 의미범주 가중치 및 인접 어절에 대한 거리 가중치 모델을 제시한다. 의미 분별된 사전 뜻풀이말 코퍼스(120만 어절)에서 구축된 의미정보를 이용한 통계기반 동형이의어 분별 시스템을 사전 뜻풀이말 문장에 출현하는 동형이의어 의미 분별에 적용한 결과 상위 고빈도 200개의 동형이의어에 대해 평균 98.32% 정확률을 보였다. 내부 실험에 사용된 200개의 동형이의어 중 49개(체언 31개, 용언 18개)를 선별하여 이들 동형이의어를 포함하고 있는 50,703개의 문장을 세종계획 품사 부착 코퍼스(350만 어절)에서 추출하여 외부 실험을 하였다. 분별하고자 하는 동형이의어의 앞/뒤 5어절에 대해 의미범주 및 거리 가중치를 부여한 실험 결과 기존 통계기반 분별 모델 보다 2.93% 정확률이 향상되었다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.4
• /
• pp.444-450
• /
• 2014

Most researches on word sense disambiguation have used static sized context regardless of sentence patterns. This paper proposes to use dynamic sized context considering sentence patterns and distance between words for word sense disambiguation. We evaluated our system 12 words in 32,735sentences with Sejong POS and sense tagged corpus, and dynamic sized context showed 92.2% average accuracy for predicates, which is better than accuracy of static sized context.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.29-37
• /
• 1998

In weighted random pattern testing it is an important issue to find the optimal weight sets for achieving a high fault coverage using a small number of weighted random patterns. In this paper, a new weight set optimization algorithm is developed, which can generate the optimal weight sets in an efficient way using the sampling probabilities of deterministic tests patterns. In addition, the simulation based method of finding the proper maximum Hamming distance is presented. Experimental results for ISCAS 85 benchmark circuits prove the effectiveness of the new weight set optimization algorithm and the method of finding the proper maximum Hamming distance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.7-13
• /
• 2010

For swiftness and economic feasibility of parcel delivery, optimal location of mail exchanging centers considering not only section delivery distance but also some weights like the number of delivery vehicles are necessary. In this paper, a mechanism with section delivery distance and vehicle number for locating of mail distribution centers which connect some mail centers of major cities in Republic Korea by applying GOSST theory is proposed. This mechanism for locating mail exchange centers can make the total delivery distance of postal matters less than not only present method which assigns Daejun as mail exchange center, but also Steiner tree method which does not consider weights like number of delivery vehicles. The mechanism is good for protecting the environment as well as rapid and economic delivery. In experiment, the proposed mechanism could curtail total delivery distance by 2.52 percentages compared with Steiner tree method and by 6.66 percentages compared with present method. The mechanism may be used in electric power transmission routing, distribution line topology design, power relay station locating where various voltages and other weights should be considered.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.12
• /
• pp.1793-1803
• /
• 2010

The weighting method and goal programming require weighting factors or target values to obtain a Pareto optimal solution. However, it is difficult to define these parameters, and a Pareto solution is not guaranteed when the choice of the parameters is incorrect. Recently, the Mahalanobis Taguchi System (MTS) has been introduced to minimize the Mahalanobis distance (MD). However, the MTS method cannot obtain a Pareto optimal solution. We propose a function called the skewed Mahalanobis distance (SMD) to obtain a Pareto optimal solution while retaining the advantages of the MD. The SMD is a new distance scale that multiplies the skewed value of a design point by the MD. The weighting factors are automatically reflected when the SMD is calculated. The SMD always gives a unique Pareto optimal solution. To verify the efficiency of the SMD, we present two numerical examples and show that the SMD can obtain a unique Pareto optimal solution without any additional information.

• Journal of the Korea Convergence Society
• /
• v.12 no.7
• /
• pp.53-60
• /
• 2021

LOD-based recommender systems usually leverage the data available within LOD datasets, such as DBpedia, in order to recommend items(movies, books, music) to the end users. These systems use a semantic similarity algorithm that calculates the degree of matching between pairs of Linked Data resources. In this paper, we proposed a new approach to measuring semantic distance in an LOD-based recommender system by assigning weights converted from user ratings to links in the LOD graph. The semantic distance measurement model proposed in this paper is based on a processing step in which a graph is personalized to a user through weight calculation and a method of applying these weights to LDSD. The Experimental results showed that the proposed method showed higher accuracy compared to other similar methods, and it contributed to the improvement of similarity by expanding the range of semantic distance measurement of the recommender system. As future work, we aim to analyze the impact on the model using different methods of LOD-based similarity measurement.

• Journal of the Korean Geotechnical Society
• /
• v.26 no.1
• /
• pp.5-19
• /
• 2010

Geo-layer information is important to determine pile length and estimate residual settlement in the construction site. An overall spatial distribution of geo-layers in the entire construction site can be predicted using drill-log information. In this study, the geo-layer distribution at Song-do area was estimated by kriging and inverse distance weighting methods, and a cross validation was adopted to verify the reliability of estimation results. The analysis results indicate that the best fitted theoretical variogram model to the experimental variogram does not always provide the most reliable estimation in the kriging method. The proper $\alpha$ value of inverse distance weighting method must be determined by types of geo-layer, because the $\alpha$ value is affected by types of geo-layer. Results of the kriging method show more reliable results than those of inverse distance weighting method, and the structure of geo-layer distribution could be evaluated by variogram in the kriging method.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.474-483
• /
• 2004

In this paper, we present a new Practical implementation of a person verification system using the profile of 3-dimensional(3D) face images based on weighted Hausdorff distance(WHD) used depth information. The approach works on finding the nose tip have protrusion shape on the face using iterative selection method to use a fiducial feint and extract the profile image from vertical 3D data for the nose tip. Hausdorff distance(HD) is one of usually used measures for object matching. This works analyze the conventional HD and WHD, which the weighted factor is depth information. The Ll measure for comparing two feature vectors were used, because it is simple and robust. In the experimental results, the WHD method achieves recognition rate of 94.3% when the ranked threshold is 5.