• 한국멀티미디어학회논문지
• /
• 제14권6호
• /
• pp.711-718
• /
• 2011

얼굴인식과 같이 클래스의 수가 변하는 분류 문제에는 학습이 필요하지 않은 k-최근접이웃 분류기가 적합하다. 최근 학습 데이터의 분포를 반영하여 거리 척도를 학습하는 방법은 k 최근접이웃 분류기의 획기적 성능향상을 보고하였다. 거리척도학습 방법은 적용 분야에 따라 성능 개선 정도가 다르다. 본 논문에서는 얼굴인식에 대하여 주요 거리척도학습 방법의 성능을 비교한다. 공개 얼굴 데이터베이스에 대한 실험 결과는 성능 및 계산시간 측면에서 주성분 분석 기반의 마하라노비스 거리척도가 얼굴인식 문제에서는 여전히 좋은 선택이 될 수 있음을 보여준다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제6권1호
• /
• pp.91-107
• /
• 2002

This paper presents two new self-scaling variable-metric algorithms. The first is based on a known two-parameter family of rank-two updating formulae, the second employs an initial scaling of the estimated inverse Hessian which modifies the first self-scaling algorithm. The algorithms are compared with similar published algorithms, notably those due to Oren, Shanno and Phua, Biggs and with BFGS (the best known quasi-Newton method). The best of these new and published algorithms are also modified to employ inexact line searches with marginal effect. The new algorithms are superior, especially as the problem dimension increases.

• 말소리와 음성과학
• /
• 제10권4호
• /
• pp.19-29
• /
• 2018

The present study investigated whether there are differences in articulation rate by gender, age, and individual speakers in a spontaneous speech corpus produced by 40 Seoul Korean speakers. This study measured their articulation rates using a second-per-syllable metric and a syllable-per-second metric. The findings are as follows. First, in spontaneous Seoul Korean speech, there was a gender difference in articulation rates only in age group 10-19, among whom men tended to speak faster than women. Second, individual speakers showed variability in their rates of articulation. The tendency for some speakers to speak faster than others was variable. Finally, there were metric differences in articulation rate. That is, regarding the coefficients of variation, the values of the second-per-syllable metric were much higher than those for the syllable-per-second metric. The articulation rate for the syllable-per-second metric tended to be more distinct among individual speakers. The present results imply that data gathered in a corpus of Seoul Korean spontaneous speech may reflect speaker-specific differences in articulatory movements.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.118-121
• /
• 1998

In this paper, we propose another paradigm(QNBP) to be capable of overcoming Limitations of the traditional backpropagation(SDBP). QNBPis based on the method of Quasi -Newton(variable metric) with the nomalized direction vectors and computes step size through the linear search. Simulation results showed that QNBP was definitely superior to both the stochasitc SDBP and the deterministic SDBP in terms of accuracy and rate of convergence and might sumount the problem of local minima. and there was no different between DFP+SR1 and BFGS+SR1 combined algrothms in QNBP.

• Nonlinear Functional Analysis and Applications
• /
• 제27권3호
• /
• pp.621-640
• /
• 2022

The aim of this study is to establish some mean convergence theorems for double array of fuzzy random variables in metric space endowed with a convex combination operation under various assumptions.

• 대한수학회지
• /
• 제55권2호
• /
• pp.447-469
• /
• 2018

Types (over parameters) in the theory of atomless random variable structures correspond precisely to (conditional) distributions in probability theory. Moreover, the logic (resp. metric) topology on the type space corresponds to the topology of weak (resp. strong) convergence of distributions. In this paper, we study metrics between types. We show that type spaces under $d^{\ast}-metric$ are isometric to Wasserstein spaces. Using optimal transport theory, two formulas for the metrics between types are given. Then, we give a new proof of an integral formula for the Wasserstein distance, and generalize some results in optimal transport theory.

• 디지털융복합연구
• /
• 제1권1호
• /
• pp.45-67
• /
• 2003

Developing user success metric will make it possible to evaluate the effectiveness of different electronic government systems and will help produce empirical data relating user success to task performance in electronic government environments. The purpose of this study is that combining output-oriented and interaction-oriented variables together into a single model might explain more of the variance in the dependent variable user success in a electronic government than either type of variable could have explained alone. The hypothesized reason is that user success is the result of the reciprocal effects of the properties of the information system and several facets of psychological functioning. Thus, the complex interplay between the system and the user in certain situational contorts may produce different degrees of user success with electronic governments.

• 한국통신학회논문지
• /
• 제29권12A호
• /
• pp.1333-1339
• /
• 2004

IS-95와 IMT-2000 시스템에서 사용되고 있는 여러 종류의 길쌈 부호기를 부호율 1/2, 구속장 3인 길쌈 부호기로 한정하여, neural network의 LVQ(Learning Vector Quantization)과 PVSL(Prototype Vector Selecting Logic)을 적용하여 비터비 복호기에서 사용되는 PM(Path Metric)과 BM(Branch Metric) 메모리 수와 산술$.$비교 연산량을 줄임으로써 시스템의 단순화와 순방향 복호를 가능하게 한다. 구속장의 확장성 여부와 관계없이 간단한 응용으로 기존의비터비 복호기에 적용할 수 있는 새로운 비터비 복호기의 구조와 적용 알고리즘을 제시하고, 제시된 비터비 복호기의 합리성을 VHDL 시뮬레이션으로 검증 후, 기존의 복호기와의 성능을 비교 분석한다.

• 충청수학회지
• /
• 제26권2호
• /
• pp.421-426
• /
• 2013

We give a series of discrete random variables which converges to a random variable whose distribution function is the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs (RNT) distribution. We show this using the correspondence theorem that if the moments coincide then their corresponding distribution functions also coincide.

• 한국정보통신학회논문지
• /
• 제16권10호
• /
• pp.2143-2149
• /
• 2012

DVB-S2에 적용되는 Shannon의 채널 용량 한계에 근접한 LDPC 부호는 복호화의 낮은 복잡도와 좋은 거리 특성으로 오류마루 현상인 나타나지 않고, 완성 병렬 처리가 가능하다. 하지만 구현상에 있어서 큰 블록 사이즈 및 많은 반복 횟수 때문에 복호과정에서 고속화가 어렵다. 이에 본 논문에서는 HSS(Horizontal Shuffle Scheduling) 방식을 연구하여 최적의 반복횟수를 제시한다. 고속 복호를 위한 복호과정의 한 방법으로 HSS 방식은 체크 노드를 중심으로 체크 노드가 업데이트 되는 과정에서 비트 노드도 같이 업데이트 되기 때문에 한 번의 반복이 끝났을 때 비트노드는 여러 번 반복한 효과를 가지게 된다. 결국 기존에 제시된 반복횟수보다 HSS 방식을 적용하였을 때 더 적은 반복 횟수로 동일한 성능을 얻을 수 있다. HSS 방식을 적용하여 시뮬레이션 한 결과, 각각의 부호화율에서 동일한 성능으로 최소 30% ~ 최대 50% 만큼 반복횟수를 줄일 수 있음을 확인하였다.