• Journal of the Korean Statistical Society
• /
• 제24권2호
• /
• pp.349-360
• /
• 1995

This paper deals with the robustness properties of the minimum disparity estimation in linear regression models. The estimators defined as statistical quantities whcih minimize the blended weight Hellinger distance between a weighted kernel density estimator of the residuals and a smoothed model density of the residuals. It is shown that if the weights of the density estimator are appropriately chosen, the estimates of the regression parameters are robust.

• Smart Structures and Systems
• /
• 제20권5호
• /
• pp.637-640
• /
• 2017

The adoption of cladding panels as dissipation device is a sort of passive control "ante litteram" for residential and commercial buildings. This paper gives details on the current technology outlining the difference between buffer panels and cladding panels. The discussion of robustness and resilience of the resulting system is afforded. It is shown that the strength of such solution, originally related to economy and light weight, is mainly associated with the respect of the main robustness requisites, as well as the short time it requires for removal and replacement (resilience).

• 인터넷정보학회논문지
• /
• 제17권2호
• /
• pp.11-17
• /
• 2016

이 논문에서는 델타함수와 상호 정보 에너지(cross information-potential with the delta functions, CIPD)에 기반한 블라인드 등화 알고리즘의 최적 가중치를 유도하고 충격성 잡음에 대해 가지는 강인성에 대해 분석하였다. CIPD 알고리즘의 입력에 대한 크기조절 기능이 정상상태 가중치를 충격성 잡음으로부터 안정되게 유지하는 주된 역할을 하는 것으로 분석되었으며 시뮬레이션 결과를 통하여, CIPD 알고리즘의 정상상태 가중치는 MSE 성능기준의 최적해를 가지면서도, 충격성 잡음에서 MSE에 기반한 LMS 알고리즘과 달리, 안정된 값을 유지함을 보였다.

• 한국음향학회지
• /
• 제38권6호
• /
• pp.716-723
• /
• 2019

음악 검색을 서비스하기 위해서는 핑거프린트 정합 정확도가 중요하다. 본 논문에서는 파워 가중치를 이용하여 오디오 핑거프린트 정합 성능을 제고하고자 한다. 파워 가중치는 핑거프린트 비트 추출 과정에서 유실되는 정보를 이용하여 구한 핑거프린트 비트의 예측 강인도이다. 기존 파워 마스크 방법은 저장 공간을 줄이기 위해서 이진화를 통해서 강인한 비트와 연약한 비트로 나눈다. 본 논문에서는 정합 성능을 향상시키기 위해서 실수 값 형태의 파워 가중치를 사용하는 방법을 제안한다. 또한 시간축 방향으로 연관성이 강한 파워 가중치의 특성을 이용하여 압축하여 저장공간을 줄일 수 있도록 한다. 공개된 음악 데이터셋에서 실험을 수행하여, 제안된 파워 웨이트가 오디오 핑거프린트 정합성능을 제고함을 확인하였다.

• 대한기계학회논문집A
• /
• 제26권10호
• /
• pp.2073-2081
• /
• 2002

In product design and manufacturing, axiomatic design provides a systematic approach for the decision-making process. Two axioms have been defined such as the Independence Axiom and the Information Axiom. The Information Axiom states that the best design among those that satisfy the independence axiom is the one with the least information content. In other words, the best design is the one that has the highest probability of success. On the other hand, the Taguchi robust design is used in the two-step process; one is "reduce variability," and the other is "adjust the mean on the target." The two-step can be interpreted as a problem that has two FRs (functional requirements). Therefore, the Taguchi method should be used based on the satisfaction of the Independence Axiom. Common aspects exist between the Taguchi method and Axiomatic Design in that a robust design is induced. However, different characteristics are found as well. The Taguchi method does not have the design range, and the probability of success may not be enough to express robustness. Our purpose is to find the one that has the highest probability of success and the smallest variation. A new index is proposed to satisfy these conditions. The index is defined by multiplication of the robustness weight function and the probability density function. The robustness weight function has the maximum at the target value and zero at the boundary of the design range. The validity of the index is proved through various examples.gh various examples.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.486-489
• /
• 2002

This paper proposes a tabu search (TS) algorithm to optimal weight selection in design of robust H$_{\infty}$ power system stabilize. (PSS), In H$_{\infty}$ control design, the weight selection and the representation of system uncertainties are the major difficulties. To cope with these problems, TS is employed to automatically search for the optimal weights. On the other hand, the normalized coprime factorization (NCF) is used. The H$_{\infty}$ controller can be directly developed without ${\gamma}$-iteration. Also, the pole-zero cancellation phenomena are prevented. The performance and robustness of the proposed PSS under different loading conditions are investigated in comparison with a robust tuned PSS by examining the case of a single machine infinite bus (SMIB) system. The simulation results illustrate the effectiveness and robustness of the proposed PSS.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권2호
• /
• pp.81-86
• /
• 2016

Term weighting is a popular technique that effectively weighs the term features to improve accuracy in document classification. While several successful term weighting algorithms have been suggested, none of them appears to perform well consistently across different data domains. In this paper we propose several reasonable methods to combine different term weight vectors to yield a robust document classifier that performs consistently well on diverse datasets. Specifically we suggest two approaches: i) learning a single weight vector that lies in a convex hull of the base vectors while minimizing the class prediction loss, and ii) a mini-max classifier that aims for robustness of the individual weight vectors by minimizing the loss of the worst-performing strategy among the base vectors. We provide efficient solution methods for these optimization problems. The effectiveness and robustness of the proposed approaches are demonstrated on several benchmark document datasets, significantly outperforming the existing term weighting methods.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.256-267
• /
• 2017

An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.

• Communications for Statistical Applications and Methods
• /
• 제11권1호
• /
• pp.153-160
• /
• 2004

In recent years, the size of data set which we usually handle is enormous, so a lot of outliers could be included in data set. Therefore the robust procedures that automatically handle outliers become very importance issue. We consider the robust estimation problem of location parameter in the univariate case. In this paper, we propose a new method for defining robustness weights for the weighted mean based on the median distance of observations and compare its performance with several existing robust estimators by a simulation study. It turns out that the proposed method is very competitive.

• ETRI Journal
• /
• 제16권1호
• /
• pp.35-43
• /
• 1994

In this paper, the robustness of the artificial neural networks to noise is demonstrated with a multilayer perceptron, and the reason of robustness is due to the statistical orthogonality among hidden nodes and its hierarchical information extraction capability. Also, the misclassification probability of a well-trained multilayer perceptron is derived without any linear approximations when the inputs are contaminated with random noises. The misclassification probability for a noisy pattern is shown to be a function of the input pattern, noise variances, the weight matrices, and the nonlinear transformations. The result is verified with a handwritten digit recognition problem, which shows better result than that using linear approximations.