• Title/Summary/Keyword: euclidean distance

Search Result 557, Processing Time 0.026 seconds

Polar-Natural Distance and Curve Reconstruction

  • Kim, Hyoung-Seok;Kim, Ho-Sook
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.9-14
    • /
    • 2015
  • We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.

Near-Optimum Blind Decision Feedback Equalization for ATSC Digital Television Receivers

  • Kim, Hyoung-Nam;Park, Sung-Ik;Kim, Seung-Won;Kim, Jae-Moung
    • ETRI Journal
    • /
    • v.26 no.2
    • /
    • pp.101-111
    • /
    • 2004
  • This paper presents a near-optimum blind decision feedback equalizer (DFE) for the receivers of Advanced Television Systems Committee (ATSC) digital television. By adopting a modified trellis decoder (MTD) with a trace- back depth of 1 for the decision device in the DFE, we obtain a hardware-efficient, blind DFE approaching the performance of an optimum DFE which has no error propagation. In the MTD, the absolute distance is used rather than the squared Euclidean distance for the computation of the branch metrics. This results in a reduction of the computational complexity over the original trellis decoding scheme. Compared to the conventional slicer, the MTD shows an outstanding performance improvement in decision error probability and is comparable to the original trellis decoder using the Euclidean distance. Reducing error propagation by use of the MTD in the DFE leads to the improvement of convergence performance in terms of convergence speed and residual error. Simulation results show that the proposed blind DFE performs much better than the blind DFE with the slicer, and the difference is prominent at the trellis decoder following the blind DFE.

  • PDF

New Approach of Evaluating Poomsae Performance with Inertial Measurement Unit Sensors (관성센서를 활용한 새로운 품새 경기력 평가 방법 연구)

  • Kim, Young-Kwan
    • Korean Journal of Applied Biomechanics
    • /
    • v.31 no.3
    • /
    • pp.199-204
    • /
    • 2021
  • Objective: The purpose of this study was to present a new idea of methodology to evaluate Poomsae performance using inertial measurement unit (IMU) sensors in terms of signal processing techniques. Method: Ten collegian Taekwondo athletes, consisting of five Poomsae elite athletes (age: 21.4 ± 0.9 years, height: 168.4 ± 11.3 cm, weight: 65.0 ± 10.6 kg, experience: 12 ± 0.7 years) and five breaking demonstration athletes (age: 21.0 ± 0.0 years, height: 168.4 ± 4.7 cm, weight: 63.8 ± 8.2 kg, experience: 13.0 ± 2.1 years), voluntarily participated in this study. They performed three different black belt Poomsae such as Goryeo, Geumgang, and Taebaek Poomsae repeatedly twice. Repeated measured motion data on the wrist and ankle were calculated by the methods of cosine similarity and Euclidean distance. Results: The Poomsse athletes showed superior performance in terms of temporal consistency at Goryeo and Taebaek Poomsae, cosine similarity at Geumgang and Taebaek Poomsae, and Euclidian distance at Geumgang Poomsae. Conclusion: IMU sensor would be a useful tool for monitoring and evaluating within-subject temporal variability of Taekwondo Poomsae motions. As well it distinguished spatiotemporal characteristics among three different Poomsae.

Non-parametric approach for the grouped dissimilarities using the multidimensional scaling and analysis of distance (다차원척도법과 거리분석을 활용한 그룹화된 비유사성에 대한 비모수적 접근법)

  • Nam, Seungchan;Choi, Yong-Seok
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.4
    • /
    • pp.567-578
    • /
    • 2017
  • Grouped multivariate data can be tested for differences between two or more groups using multivariate analysis of variance (MANOVA). However, this method cannot be used if several assumptions of MANOVA are violated. In this case, multidimensional scaling (MDS) and analysis of distance (AOD) can be applied to grouped dissimilarities based on the various distances. A permutation test is a non-parametric method that can also be used to test differences between groups. MDS is used to calculate the coordinates of observations from dissimilarities and AOD is useful for finding group structure using the coordinates. In particular, AOD is mathematically associated with MANOVA if using the Euclidean distance when computing dissimilarities. In this paper, we study the between and within group structure by applying MDS and AOD to the grouped dissimilarities. In addition, we propose a new test statistic using the group structure for the permutation test. Finally, we investigate the relationship between AOD and MANOVA from dissimilarities based on the Euclidean distance.

Distance Functions to Detect Changes in Data Streams

  • Bud Ulziitugs;Lim, Jong-Tae
    • Journal of Information Processing Systems
    • /
    • v.2 no.1
    • /
    • pp.44-47
    • /
    • 2006
  • One of the critical issues in a sensor network concerns the detection of changes in data streams. Recently presented change detection schemes primarily use a sliding window model to detect changes. In such a model, a distance function is used to compare two sliding windows. Therefore, the performance of the change detection scheme is greatly influenced by the distance function. With regard to sensor nodes, however, energy consumption constitutes a critical design concern because the change detection scheme is implemented in a sensor node, which is a small battery-powered device. In this paper, we present a comparative study of various distance functions in terms of execution time, energy consumption, and detecting accuracy through simulation of speech signal data. The simulation result demonstrates that the Euclidean distance function has the highest performance while consuming a low amount of power. We believe our work is the first attempt to undertake a comparative study of distance functions in terms of execution time, energy consumption, and accuracy detection.

2-D object recognition using distance transform on morphological skeleton (형태학적 골격에서의 거리 변환을 이용한 2차원 물체 인식)

  • 권준식;최종수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.7
    • /
    • pp.138-146
    • /
    • 1996
  • In this paper, w epropose a new mehtod to represent the shape and to recognize the object. The shape description and the matching is implemented by using the distance transform on the morphological skeleton. The employed distance transform is the chamfer (3,4) distance transform, because the chamfer distance transform (CDT) has an approximate value to the euclidean distance. The 2-D object can be represented by means of the distribution of the distance transform on the morphological skeleton, the number of skeletons, the sum of the CDT, and the other features are employed as the mtching parameters. The matching method has the invariant features (rotation, translation, and scaling), and then the method is used effectively for recognizing the differently-posed objects and/or marks of the different shape and size.

  • PDF

An Efficient Method for Minimum Distance Problem Between Shapes Composed of Circular Arcs and Lines (원호와직선으로 구성된 도형간의 효율적인 최소거리 계산방법)

  • 김종민;김민환
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.5
    • /
    • pp.848-860
    • /
    • 1994
  • Generally, to get the minimum distance between two arbitrary shapes that are composed of circular arcs and lines, we must calculate distances for all the possible pairs of the components from two given shapes. In this paper, we propose an efficient method for the minimum distance problem between two shapes by using their structural features after extracting the reduced component lists which are essential to calculate the minimum distance considering the relationship of shape location. Even though the reduced component lists may contain all the components of the shapes in the worst case, in the average we can reduce the required computation much by using the reduced component lists. This method may be efectively applied to calculating the minimum distance between two shapes which are generated by the CAD tool, like in the nesting system.

  • PDF

An Efficient Signature Recognition Based on Histogram Using Statistical Characteristics (통계적 속성을 이용한 히스토그램 기반 효율적인 서명인식)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.5
    • /
    • pp.701-709
    • /
    • 2010
  • This paper presents an efficient signature recognition method by using the hybrid similarity criterion, which is in inverse proportion to distance and in proportion to correlation between the images. The distance is applied to express the spacial property of image, and the correlation is also applied to express the statistical property. The proposed criterion provides the robust recognition to both the geometrical variations such as position, size, and rotation and the shape variation. The normalized cross-correlation(NCC), which is calculated by considering 4 directions based on the histogram of binary image, is applied to express rapidly and accurately the similarity between the images. The proposed method has been applied to the problem for recognizing the 20 truck images of 288*288 pixels and the 105(3 persons * 35 images) signature images of 256*256 pixels, respectively. The experimental results show that the proposed method has a superior recognition performance that appears the image characters well. Especially, the hybrid criterion of NCC and ordinal distance has a superior recognition performance to the hybrid criterion using city-block or Euclidean distance.

On the plane geometry using taxicab distance function (택시거리함수를 이용한 평면기하에 관한 연구)

  • Kwak, Kyung-Min;Baik, Seung-Min;Choi, Woo-Seok;Choi, Jun-Bum;Ko, Il-Seog;Kim, Byung-Hak
    • Communications of Mathematical Education
    • /
    • v.24 no.3
    • /
    • pp.659-689
    • /
    • 2010
  • Taxicab distance function is a practical distance notion which gives us information of real world pathway distance that really taxi can go through. As one of the non-Euclidean geometry, this study of an ideal city with all roads running horizontal or vertical, was introduced by the Russian Mathematician H. Minkowski and synthetically reported by the E. F. Kraus in 1986. After that, there were many reports and papers on this topic and still being researched. At this point of view, our research about taxicab geometry provides its differences from Euclidean plane geometry, and considers about several theorems on plane geometry using the taxicab distance function.

A cautionary note on the use of Cook's distance

  • Kim, Myung Geun
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.3
    • /
    • pp.317-324
    • /
    • 2017
  • An influence measure known as Cook's distance has been used for judging the influence of each observation on the least squares estimate of the parameter vector. The distance does not reflect the distributional property of the change in the least squares estimator of the regression coefficients due to case deletions: the distribution has a covariance matrix of rank one and thus it has a support set determined by a line in the multidimensional Euclidean space. As a result, the use of Cook's distance may fail to correctly provide information about influential observations, and we study some reasons for the failure. Three illustrative examples will be provided, in which the use of Cook's distance fails to give the right information about influential observations or it provides the right information about the most influential observation. We will seek some reasons for the wrong or right provision of information.