• 제목/요약/키워드: metric distance

검색결과 257건 처리시간 0.026초

An Exploratory Study on Donor Location Strategies in Data Fusion

  • Kim, Jonathan S.;Cho, Sung-Bin
    • Management Science and Financial Engineering
    • /
    • 제14권2호
    • /
    • pp.1-12
    • /
    • 2008
  • This study explores several donor location strategies and discusses experiment results, which contributes to the saving of time and effort required in designing data fusion processes. In particular, three concepts are introduced. The Mahalanobis distance is applied to locate the nearest neighbors more effectively; which incorporates the covariance structure of attributes. The ideal point helps reduce the dimensionality problem that arises in conjoint-type experiments. The correspondence analysis is used to derive the coordinates from non-metric attributes. The Monte Carlo simulation results show that the proposed donor location strategies provide better fusion performance, compared to the currently-in-use methods.

마하라노비스 다구찌(Mahalanobis Taguchi) 시스템을 이용한 박판 성형 공정의 최적화 (Optimization of Sheet Metal Forming Process Using Mahalanobis Taguchi System)

  • 김경모
    • 한국기계가공학회지
    • /
    • 제15권1호
    • /
    • pp.95-102
    • /
    • 2016
  • Wrinkle, spring-back, and fracture are major defects frequently found in the sheet metal forming process, and the reduction of such defects is difficult as they are affected by uncontrollable factors, such as variations in properties of the incoming material and process parameters. Without any countermeasures against these issues, attempts to reduce defects through optimal design methods often lead to failure. In this research, a new multi-attribute robust design methodology, based on the Mahalanobis Taguchi System (MTS), is presented for reducing the possibilities of wrinkle, spring-back, and fracture. MTS performs experimentation, based on the orthogonal array under various noise conditions, uses the SN ratio of the Mahalanobis distance as a performance metric. The proposed method is illustrated through a robust design of the sheet metal forming process of a cross member of automotive body.

퍼지 컬러 모델의 비퍼지화 방법과 거리 척도의 제안 (A Note on the Defuzzification Method and Distance Metric of Fuzzy Color Model)

  • Kim, Dae-Won;Lee, Kwang H.
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (2)
    • /
    • pp.40-42
    • /
    • 2001
  • Most people have to deal with color and color problems occasionally. There are many strange things about color and color vision that most people do not notice. Even though color seems intuitive and simple it is not. In this paper, we modeled the color using fuzzy set theory. The proposed fuzzy color model is based on the Munsell color space. We defined several fuzzy color terminologies, and proposed a extended center of gravity defuzzification mthod for fuzzy color set. Finally, three distance measures between fuzzy colors were also formulated.

  • PDF

Instance Based Learning Revisited: Feature Weighting and its Applications

  • Song Doo-Heon;Lee Chang-Hun
    • 한국멀티미디어학회논문지
    • /
    • 제9권6호
    • /
    • pp.762-772
    • /
    • 2006
  • Instance based learning algorithm is the best known lazy learner and has been successfully used in many areas such as pattern analysis, medical analysis, bioinformatics and internet applications. However, its feature weighting scheme is too naive that many other extensions are proposed. Our version of IB3 named as eXtended IBL (XIBL) improves feature weighting scheme by backward stepwise regression and its distance function by VDM family that avoids overestimating discrete valued attributes. Also, XIBL adopts leave-one-out as its noise filtering scheme. Experiments with common artificial domains show that XIBL is better than the original IBL in terms of accuracy and noise tolerance. XIBL is applied to two important applications - intrusion detection and spam mail filtering and the results are promising.

  • PDF

Hierarchical Mesh Segmentation Based on Global Sharp Vertices

  • Yoo, Kwan-Hee;Park, Chan;Park, Young-Jin;Ha, Jong-Sung
    • International Journal of Contents
    • /
    • 제5권4호
    • /
    • pp.55-61
    • /
    • 2009
  • In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.

Synthesis and Evaluation of Prosodically Exaggerated Utterances

  • 윤규철
    • 말소리와 음성과학
    • /
    • 제1권3호
    • /
    • pp.73-85
    • /
    • 2009
  • This paper introduces the technique of synthesizing and evaluating human utterances with exaggerated or atypical prosody. Prosody exaggeration can be implemented by manipulating either the fundamental frequency (F0) contour, the segmental durations, or the intensity contour of an utterance. Of these three prosodic elements, two or more can be exaggerated at the same time. The algorithms of synthesis and evaluation were suggested. Learner utterances exaggerated in each of the three prosodic features were evaluated with respect to their original native versions in terms of the differences in their F0 contours, the segmental durations, and the intensity contours. The measure of differences was the Euclidean distance metric between the matching points in their F0 and intensity contours. The measure was calculated after the exaggerated learner utterances were aligned by the segments and rendered identical to their native version in terms of their segmental durations. For the evaluation of the segmental durations, no prior modifications were made in durations and the same measure was used. The results from the pilot experiment suggest the viability of this measure in the evaluation of learner utterances with atypical prosody with respect to their native versions.

  • PDF

응용문제에서 보로노이 다이어그램과 파워 다이어그램의 사용성 비교 (Using Voronoi Diagram and Power Diagram in Application Problems)

  • 김동욱
    • 산업경영시스템학회지
    • /
    • 제35권4호
    • /
    • pp.235-243
    • /
    • 2012
  • The Voronoi diagram of spheres and power diagram have been known as powerful tools to analyze spatial characteristics of weighted points, and these structures have variety range of applications including molecular spatial structure analysis, location based optimization, architectural design, etc. Due to the fact that both diagrams are based on different distance metrics, one has better usability than another depending on application problems. In this paper, we compare these diagrams in various situations from the user's viewpoint, and show the Voronoi diagram of spheres is more effective in the problems based on the Euclidean distance metric such as nearest neighbor search, path bottleneck locating, and internal void finding.

전역 조명 알고리즘에서의 조화 평균 거리 계산의 분석 (Analysis of Harmonic Mean Distance Calculation in Global Illumination Algorithms)

  • 차득현;임인성
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제16권2호
    • /
    • pp.186-200
    • /
    • 2010
  • 전역 조명(global illumination) 효과를 사실적으로 렌더링하기 위해서는 복잡한 경로를 통해 입사하는 빛의 정보 해당하는 직접 조명 및 간접 조명을 정확하게 계산해주어야 한다. 이 과정에서 주어진 물체 표면 지점에 대해 계산되는 간접 조명 정보는 주변 환경의 기하적인 형태에 큰 영향을 받게 된다. 조화 평균 거리(harmonic mean distance)는 3차원 공간상에서 주어진 한 지점에서 보이는 물체들과의 거리를 나타내는 척도로 많이 사용되는 수학적 도구로서, 광휘 캐시(irradiance/radiance cache)나 환경 폐색(ambient occlusion) 등의 렌더링 효과를 생성하는데 주요하게 사용된다. 본 논문에서는 대표적인 고품질 전역 조명 렌더링 알고리즘인 최종 수집(final gathering) 방법 및 포톤 매핑(photon mapping) 기법을 통해 다양한 환경에서 계산되는 조화 평균 거리에 대한 근사값의 정확성에 대해 분석한다. 이러한 분석 결과를 기반으로 효과적인 조화 평균 거리 계산의 근사화 기법 개발에 있어서 고려해야 할 점들과 방향을 제시한다.

이동 방향 정보를 이용한 DTN 라우팅: TAILWIND (TAILWIND: Mobility information based Routing for Delay Tolerant Network)

  • 조서익;김선현;문수훈;한승재
    • 정보과학회 논문지
    • /
    • 제42권3호
    • /
    • pp.408-412
    • /
    • 2015
  • 기지국 중심의 네트워크에서 기지국에 집중되는 traffic의 과부하는 피할 수 없는 문제이다. traffic 과부하를 완화시킬 수 있는 하나의 대안으로 traffic 부하를 노드로 분산시키는 peer-to-peer DTN이 있다. 메시지 전달 성공률을 향상시키고 메시지 overhead를 낮추기 위해, 기존의 flooding 기반 DTN 라우팅에서 이용하지 않았던 노드의 이동정보를 이용하여 새로운 라우팅을 제안한다. 제안하는 라우팅 scheme에서, 노드의 이동정보에 기반한 metric은 각 노드가 목적지까지 얼마나 근접하게 이동할 것인지에 따라 계산된다. 메시지는 메시지를 복사하고자 하는 노드의 목적지까지 예상 근접 거리보다 더 가까운 값을 가지는 주변노드들에게 복사된다. 시뮬레이션을 통해 random mobility model과 실제 mobility trace를 이용하여 이동정보를 이용하지 않은 기존 라우팅과의 성능을 비교한다. 성능 분석 결과, 제안하는 라우팅이 기존의 라우팅들 보다 10~30% 더 적게 메시지를 복사하면서 성공적으로 목적지까지 전달하는 것을 보여준다.

한국 프로바둑기사 포석 인식을 위한 선형판별분석과 주성분분석 비교 (Comparison of LDA and PCA for Korean Pro Go Player's Opening Recognition)

  • 이병두
    • 한국게임학회 논문지
    • /
    • 제13권4호
    • /
    • pp.15-24
    • /
    • 2013
  • 적어도 2,500년 전에 기원된 바둑은 세상에서 가장 오래된 보드 게임 중의 하나이다. 아직까지 포석 바둑에 대한 이론적 연구는 여전히 미흡하다. 본 연구는 특정 프로기사의 포석을 갖고 훈련용 포석으로부터 얻어낸 클래스로의 인식을 위해 전통적인 선형판별분석 알고리즘을 적용하였다. 상위 10위권 한국 프로기사의 포석을 갖고 클래스-독립 선형판별분석과 클래스-종속 선형판별분석을 수행하였다. 실험 결과 클래스-독립 LDA는 평균 14%의 인식률을, 클래스-종속 LDA는 평균 12%의 인식률을 각각 보였다. 또한 연구 결과 일반적인 상식과 달리 PCA가 LDA보다 더 우월하고, 유클리디언 거리 측정 방식이 결코 LDA보다 뒤지지 않는다는 새로운 사실이 밝혀졌다.