• Title/Summary/Keyword: Minimum Euclidean distance

Search Result 56, Processing Time 0.025 seconds

Performance of 4-level Modulation Code for Holographic Data Storage (홀로그래픽 데이터 저장장치를 위한 4-레벨 변조 부호의 성능 비교)

  • Park, Keunhwan;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1672-1677
    • /
    • 2015
  • The multi-level holographic storage system can store more than one bit per pixel. In this paper, we introduce a 6-pixel 4-level modulation code and compare with 4-level 6/9 modulation code and 2/3 modulation code. The proposed 6-pixel modulation code has the minimum Euclidean distance 3. The 6-pixel modulation code is approximately 1dB better than the other modulation codes.

Robust Object Extraction Algorithm in the Sea Environment (해양환경에서 강건한 물표 추적 알고리즘)

  • Park, Jiwon;Jeong, Jongmyeon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.3
    • /
    • pp.298-303
    • /
    • 2014
  • In this paper, we proposed a robust object extraction and tracking algorithm in the IR image sequence acquired in the sea environment. In order to extract size-invariant object, we detect horizontal and vertical edges by using DWT and combine it to generate saliency map. To extract object region, binarization technique is applied to saliency map. The correspondences between objects in consecutive frames are defined by the calculating minimum weighted Euclidean distance as a matching measure. Finally, object trajectories are determined by considering false correspondences such as entering object, vanishing objects and false object and so on. The proposed algorithm can find trajectories robustly, which has shown by experimental results.

Performance Enhancement of Algorithms based on Error Distributions under Impulsive Noise (충격성 잡음하에서 오차 분포에 기반한 알고리듬의 성능향상)

  • Kim, Namyong;Lee, Gyoo-yeong
    • Journal of Internet Computing and Services
    • /
    • v.19 no.3
    • /
    • pp.49-56
    • /
    • 2018
  • Euclidean distance (ED) between error distribution and Dirac delta function has been used as an efficient performance criterion in impulsive noise environmentsdue to the outlier-cutting effect of Gaussian kernel for error signal. The gradient of ED for its minimization has two components; $A_k$ for kernel function of error pairs and the other $B_k$ for kernel function of errors. In this paper, it is analyzed that the first component is to govern gathering close together error samples, and the other one $B_k$ is to conduct error-sample concentration on zero. Based upon this analysis, it is proposed to normalize $A_k$ and $B_k$ with power of inputs which are modified by kernelled error pairs or errors for the purpose of reinforcing their roles of narrowing error-gap and drawing error samples to zero. Through comparison of fluctuation of steady state MSE and value of minimum MSE in the results of simulation of multipath equalization under impulsive noise, their roles and efficiency of the proposed normalization method are verified.

Classification of the Somatotypes for the Construction of Young Women's Clothing (Part 1) (청년기 여성의 의복설계를 위한 체형분류 (제1보))

  • 권숙희;김혜경
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.20 no.2
    • /
    • pp.282-297
    • /
    • 1996
  • The effective construction for ready-made clothes is one of the central concerns of both consumers and manufactuers in today's apparel industry. In order to reduce the burden of stocks and increase clothing fitness, systematic information on typical body sizes and somatotypes is essential. The purpose of this study i-: to provide basic data on young women's somatotypes for form designers and pattern makers. The subjects of the survey were 310 women of 18 to 26 years old. The study collected 84 anthropometric data for each Person. The data was analyzed by using of the multivariate method. The factor analysis was utilized in regard to the 65 items obtained from anthropometric measurement respectively. The principal component analysis was applied to the data with orthogonal rotation after extraction. The factor scores used in the factor analysis became the basis of determining the value of each variable of the cluster analysis. The cluster analysis was applied for identifying typical somatotypes. Ward's minimum variance method was applied for the purpose of extracting distance metrix by the standardized Euclidean distance. The element forming each cluster can be subdivided into several sets by crosstabulation which is obtained by the fastclus of the SAS. This research has demonstrated 3 distinctive types of silhouette contour of the trunk. Incidentally it also identified 4 of the lower body from the waistline to thigh contour respectively. The discriminant analysis showed that the most significant discriminant factor of the trunk classification were side neck point -1 scapular -1 waistiline length and waist girth. In Korea, the average somatotype of female college students tends to be tall, slim and straight. Reviewing the relationship between the classifications of three parts of body, they are related to each other to some extent but their distribution are not constant. Therefore, in view of clothing construction, a proper separation of the body surface is a necessity.

  • PDF

Automation of urine dipstick test by simultaneous scanning : A pilot study (요 스트립검사 자동화를 위한 동시 비교 스캔 기법 예비 연구)

  • Lee, Sang-Bong;Choi, Seong-Su;Lee, In-Kwang;Han, Jeong-Su;Kim, Wan-Seok;Kim, Wun-Jae;Cha, Eun-Jong;Kim, Kyung-Ah
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.3
    • /
    • pp.169-175
    • /
    • 2010
  • Urinalysis is an important clinical test to diagnose urinary diseases, and dipstick method with visual inspection is widely applied in practice. Automated optical devices recently developed have disadvantages of long measurement time, big size and heavy weight, accuracy degradation with time, etc. The present study proposed a new computer scanning technique, in which the test strip and the standard chart were simultaneously scanned to remove any environmental artifacts, followed by automated differentiation with the minimum distance algorithm, leading to significant enhancement of accuracy. Experiments demonstrated an accuracy of 100 % in that all test results were identical with the human visual inspection. The present technique only uses a personal computer with scanner and shortens the test time to a great degree. The results are also stored and accumulated for later use which can be transmitted to remote locations through a network, thus could be easily integrated to any ubiquitous health care systems.

Location Estimation System based on Majority Sampling Data (머저리티 샘플링 데이터 기반 위치 추정시스템)

  • Park, Geon-Yeong;Jeon, Min-Ho;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2523-2529
    • /
    • 2014
  • Location estimation service can be provided outdoors using various location estimation system based on GPS. However, location estimation system is based on existing indoor resources as GPS cannot be used because of insufficient visible satellites and weak signals. The fingerprinting technique that uses WLAN signal, in particular, is good to use indoors because it uses RSSI provided by AP to estimate location. However, its accuracy may vary depending on how accurate data the offline stage used where the fingerprinting map is built. The study sampled various data at the stage that builds the fingerprinting map and suggested a location estimation system that enhances its precision by saving the data of high frequency among them to improve this problem. The suggested location estimation system based on majority sampling data estimates location by filtering RSSI data of the highest frequency at the client and server to be saved at a map, building the map and measuring a similar distance. As a result of the test, the location estimation precision stood at minimum 87.5 % and maximum 90.4% with the margin of error at minimum 0.25 to 2.72m.

Efficient Processing of k-Farthest Neighbor Queries for Road Networks

  • Kim, Taelee;Cho, Hyung-Ju;Hong, Hee Ju;Nam, Hyogeun;Cho, Hyejun;Do, Gyung Yoon;Jeon, Pilkyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.10
    • /
    • pp.79-89
    • /
    • 2019
  • While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.

Prediction of Soil-Water Characteristic Curve and Relative Permeability of Jumunjin Sand Using Pore Network Model (공극 네트워크 모델을 이용한 주문진표준사의 함수특성곡선 및 상대투수율 예측에 관한 연구)

  • Suh, Hyoung Suk;Yun, Tae Sup;Kim, Kwang Yeom
    • Journal of the Korean Geotechnical Society
    • /
    • v.32 no.1
    • /
    • pp.55-62
    • /
    • 2016
  • This study presents the numerical results of soil-water characteristic curve for sandy soil by pore network model. The Jumunjin sand is subjected to the high resolution 3D X-ray computed tomographic imaging and its pore structure is constructed by the web of pore body and pore channel. The channel radius, essential to the computation of capillary pressure, is obtained based on the skeletonization and Euclidean Distance transform. The experimentally obtained soil-water characteristic curve corroborates the numerically estimated one. The pore channel radius defined by minimum radii of pore throat results in the slightly overestimation of air entry value, while the overall evolution of capillary pressure resides in the acceptable range. The relative permeability computed by a series of suggested models runs above that obtained by pore network model at high degree of saturation.

A Minimun-diameter Spanning Tree with Bounded Degrees (제한된 분지수를 가지는 최소지름 신장트리)

  • 안희갑;신찬수
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.78-85
    • /
    • 2004
  • Given a set S of n points in the plane, a minimum-diameter spanning tree(MDST) for the set might have a degree up to n-1. This might cause the degradation of the network performance because the node with high degree should handle much more requests than others relatively. Thus it is important to construct a spanning tree network with small degree and diameter. This paper presents an algorithm to construct a spanning tree for S satisfying the following four conditions: (1) the degree is controled as an input, (2) the tree diameter is no more than constant times the diameter of MDST, (3) the tree is monotone (even if arbitrary point is fixed as a root of the tree) in the sense that the Euclidean distance from the root to any node on the path to any leaf node is not decreasing, and (4) there are no crossings between edges of the tree. The monotone property will play a role as an aesthetic criterion in visualizing the tree in the plane.

Performance of an ML Modulation Classification of QAM Signals with Single-Sample Observation (단일표본관측을 이용한 직교진폭변조 신호의 치운 변조분류 성능)

  • Kang Seog Geun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.63-68
    • /
    • 2005
  • In this paper, performance of a maximum-likelihood modulation classification for quadrature amplitude modulation (QAM) is studied. Unlike previous works, the relative classification performance with respect to the available modulations and performance limit with single-sample observation are presented. For those purposes, all constellations are set to have the same minimum Euclidean distance between symbols so that a smaller constellation is a subset of the larger ones. And only one sample of received waveform is used for multiple hypothesis test. As a result, classification performance is improved with increase in signal-to-noise ratio in all the experiments. Especially, when the true modulation format used in the transmitter is 4 QAM, almost perfect classification can be achieved without any additional information or observation samples. Though the possibility of false classification due to the symbols shared by subset constellations always exists, correct classification ratio of $80{\%}$ can be obtained with the single-sample observation when the true modulation formats are 16 and 64 QAM.