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

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

Cluster-Based Quantization and Estimation for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • 제14권4호
    • /
    • pp.215-221
    • /
    • 2016
  • We consider a design of a combined quantizer and estimator for distributed systems wherein each node quantizes its measurement without any communication among the nodes and transmits it to a fusion node for estimation. Noting that the quantization partitions minimizing the estimation error are not independently encoded at nodes, we focus on the parameter regions created by the partitions and propose a cluster-based quantization algorithm that iteratively finds a given number of clusters of parameter regions with each region being closer to the corresponding codeword than to the other codewords. We introduce a new metric to determine the distance between codewords and parameter regions. We also discuss that the fusion node can perform an efficient estimation by finding the intersection of the clusters sent from the nodes. We demonstrate through experiments that the proposed design achieves a significant performance gain with a low complexity as compared to the previous designs.

Mahalanobis Taguchi System을 이용한 자동차 승차감 만족도를 고려한 설계조건 선정에 관한 연구 (Selecting Optimal Design Condition based on Automobile Ride Satisfaction Using Mahalanobis Taguchi System)

  • 홍정의
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2009년도 추계학술대회
    • /
    • pp.99-107
    • /
    • 2009
  • Mahalanobis Taguchi-System (MTS) has been used in different diagnostic applications to make quantitative decisions by constructing a multivariate system using data analytic methods without any assumption regarding statistical distribution. MTS performs Taguchi's fractional factorial design based on the Mahahlanobis distance as a performance metric. In this study, MTS used for analyzing automotive ride satisfaction, which measured as a CSR(Customer Satisfaction Rating). The automobile which has a good CSR score treated as a normal group for constructing Mahalanobis space. The results of this research show that two attribute (Impact Hardness and Memory Shake) have a minus gain value and can be removed from further analysis. With the linear regression model, the difference of CSR between using all 6 attributes and just using significant 4 attributes compared.

  • PDF

Power-aware Ad hoc On-Demand Distance Vector Routing for prolonging network lifetime of MANETs

  • 황춘송;;이영희
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2002년도 추계학술발표논문집 (중)
    • /
    • pp.1317-1320
    • /
    • 2002
  • We present in this paper a new version of AODV that incorporates with "Minimizing Maximum node cost" by formulating that metric as a cost function of residual energy of nodes. An additional parameter is added to the cost function to consider the routing performance along with power-efficiency. The motivation of adding that new parameter is originated from the trace off between power-saving behaviors and routing performance.

  • PDF

Mahalanobis Taguchi System을 이용한 자동차 브레이크 성능 만족도를 고려한 설계조건 선정에 관한 연구 (Selecting Optimal Design Condition Based on Automobile Brake Feeling Using Mahalanobis Taguchi System)

  • 홍정의;권홍규
    • 산업경영시스템학회지
    • /
    • 제30권1호
    • /
    • pp.41-47
    • /
    • 2007
  • Mahalanobis Taguchi-System (MTS) is a pattern information technology, which has been used in different diagnostic ap plications to make quantitative decisions by constructing a multivariate system using data analytic methods without any as sumption regarding statistical distribution. MTS performs Taguchi's fractional factorial design based on the Mahalanobis distance as a performance metric In this work, MTS used for analyzing automotive brake feeling system, which measured as a brake feel index (BFI) from 9 attributes. The automobile which has a good BFI score treated as a normal group for constructing Mahalanobis space. The results of this research show that two attributes (Pre load & Max deceleration) have a minus gain value and can be removed from further analysis. The difference of MD value between using all 9 attributes and just using significant attribute compared.

A Study of Machine Learning based Face Recognition for User Authentication

  • Hong, Chung-Pyo
    • 반도체디스플레이기술학회지
    • /
    • 제19권2호
    • /
    • pp.96-99
    • /
    • 2020
  • According to brilliant development of smart devices, many related services are being devised. And, almost every service is designed to provide user-centric services based on personal information. In this situation, to prevent unintentional leakage of personal information is essential. Conventionally, ID and Password system is used for the user authentication. This is a convenient method, but it has a vulnerability that can cause problems due to information leakage. To overcome these problem, many methods related to face recognition is being researched. Through this paper, we investigated the trend of user authentication through biometrics and a representative model for face recognition techniques. One is DeepFace of FaceBook and another is FaceNet of Google. Each model is based on the concept of Deep Learning and Distance Metric Learning, respectively. And also, they are based on Convolutional Neural Network (CNN) model. In the future, further research is needed on the equipment configuration requirements for practical applications and ways to provide actual personalized services.

트렐리스 부호화된 MDPSK-OFDM의 다중 위상차 검파 (Multiple Phase Differential Detection of Trellis-coded MDPSK-OFDM)

  • Kim, Chong-Il
    • 융합신호처리학회 학술대회논문집
    • /
    • 한국신호처리시스템학회 2003년도 하계학술대회 논문집
    • /
    • pp.217-221
    • /
    • 2003
  • In this paper, the Viterbi decoder containing new branch metrics of the squared Euclidean distance with multiple order phase differences is introduced in order to improve the bit error rate (BER) in the differential detection of the trellis-coded MDPSK-OFDM. The proposed Viterbi decoder is conceptually same as the multiple Phase differential detection method that uses the branch metric with multiple phase differences. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency. Also, the proposed algorithm can be used in the single carrier modulation.

  • PDF

워핑(Warping) 기법을 이용한 심전도 신호 자동 분할 (Automated ECG Signal Segmentation by Warping Method)

  • 신승원;김경섭;윤태호;이정환;김동준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 제38회 하계학술대회
    • /
    • pp.1918-1919
    • /
    • 2007
  • In this study, dynamic time warping(DTW) is utilized especially for automatically segmenting ECG(Electrocardiogram) signal to extract a periodic time information. For the possible medical application for diagnosing the abnormalities of ECG, the relative metric distance of the warped ECG signals are computed to decide whether the abrupt variations of ECG signal occur or not.

  • PDF

SQRI법에 의한 CRT 디스플레이의 화질 평가 (Image quality evaluation of CRT Displays using SQRI method)

  • 조경미;김정희;남궁지나;김현수
    • 한국광학회지
    • /
    • 제11권2호
    • /
    • pp.85-90
    • /
    • 2000
  • CRT디스플레이의 화질 평가에는 위도, 콘트라스트, addressability, 시청거리 등의 다양한 물리적 특성치가 사용된다. 그러나, 최종적인 CRT디스플레이 화질의 비교·평가는 물리적 특성치가 아닌 실제 사용자가 느끼는 화질 즉, 주관적 인지 화질에 의해 이루어진다. 본 논문에서는 4종류 CRT모니터의 SQRI(SQuare Root Integral) 값과 다수의 피험자에 의한 주관적 화질 평가 점수와의 상관성이 비교되었다. 그리고, 이러한 SQRI법의 주관적 화질 평가 척도로서의 타당성을 바탕으로 모니터의 다양한 물리적 특성치가 주관적 화질에 미치는 영향이 검토되었다.

  • PDF

비측량용 사진기에 의한 수렴사진의 정확도에 관한 연구 (A Study on the Accuracy of Convergent Photographs Using Non-Metric Camera)

  • 유복모;권현;유기윤
    • 한국측량학회지
    • /
    • 제7권2호
    • /
    • pp.63-68
    • /
    • 1989
  • 본 연구는 근거리 사진측량에 있어서 비측량용 사진기를 이용한 수렴사진에 대한 수학적 정확도 예측모델을 개발하고, 촬영거리와 수렴각의 변화에 따른 위치오차를 분석함으로써 정확도 예측모델의 타당성을 입증하였다. 본 연구에서 개발한 정확도 예측모델을 이용하여 주어진 촬영조건하에서 대상물에 대한 정확도를 예측할 수 있었으며, 또한 대상물의 평면 및 높이에 관한 요구되는 정확도에 따른 합리적인 촬영방법을 제안하였다.

  • PDF

Nearest Neighbor Based Prototype Classification Preserving Class Regions

  • Hwang, Doosung;Kim, Daewon
    • Journal of Information Processing Systems
    • /
    • 제13권5호
    • /
    • pp.1345-1357
    • /
    • 2017
  • A prototype selection method chooses a small set of training points from a whole set of class data. As the data size increases, the selected prototypes play a significant role in covering class regions and learning a discriminate rule. This paper discusses the methods for selecting prototypes in a classification framework. We formulate a prototype selection problem into a set covering optimization problem in which the sets are composed with distance metric and predefined classes. The formulation of our problem makes us draw attention only to prototypes per class, not considering the other class points. A training point becomes a prototype by checking the number of neighbors and whether it is preselected. In this setting, we propose a greedy algorithm which chooses the most relevant points for preserving the class dominant regions. The proposed method is simple to implement, does not have parameters to adapt, and achieves better or comparable results on both artificial and real-world problems.