• 제목/요약/키워드: Minimum Euclidean distance

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

Classification of Emotional States of Interest and Neutral Using Features from Pulse Wave Signal

  • Phongsuphap, Sukanya;Sopharak, Akara
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.682-685
    • /
    • 2004
  • This paper investigated a method for classifying emotional states by using pulse wave signal. It focused on finding effective features for emotional state classification. The emptional states considered here consisted of interest and neutral. Classification experiments utilized 65 and 60 samples of interest and neutral states respectively. We have investigated 19 features derived from pulse wave signals by using both time domain and frequency domain analysis methods with 2 classifiers of minimum distance (normalized Euclidean distanece) and ${\kappa}$-Nearest Neighbour. The Leave-one-out cross validation was used as an evaluation mehtod. Based on experimental results, the most efficient features were a combination of 4 features consisting of (i) the mean of the first differences of the smoothed pulse rate time series signal, (ii) the mean of absolute values of the second differences of thel normalized interbeat intervals, (iii) the root mean square successive difference, and (iv) the power in high frequency range in normalized unit, which provided 80.8% average accuracy with ${\kappa}$-Nearest Neighbour classifier.

  • PDF

AN ALGORITHM FOR FITTING OF SPHERES

  • Kim, Ik-Sung
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제11권1호
    • /
    • pp.37-49
    • /
    • 2004
  • We are interested in the problem of fitting a sphere to a set of data points in the three dimensional Euclidean space. In Spath [6] a descent algorithm already have been given to find the sphere of best fit in least squares sense of minimizing the orthogonal distances to the given data points. In this paper we present another new algorithm which computes a parametric represented sphere in order to minimize the sum of the squares of the distances to the given points. For any choice of initial approximations our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

  • PDF

3차원 직교 주파수분할다중화의 설계 (Design of 3-Dimensional Orthogonal Frequency Division Multiplexing)

  • 강석근
    • 방송공학회논문지
    • /
    • 제13권5호
    • /
    • pp.677-680
    • /
    • 2008
  • 본 논문에서는 3차원 신호사상기를 이용하는 직교 주파수분할다중화가 제안된다. 여기서 신호사상기는 포앵카레 구면에 위치한 신호점들로 구성된다. 성상도 상의 신호점들이 균일하게 분포되고 동일한 평균전력을 가지도록 정규화된 경우 3차원 성상도의 신호점 간 최소 유클리드 거리는 2차원 신호성상도에 비하여 훨씬 커진다. 모의실험 결과, 제안된 3차원 직교 주파수분할다중화는 기존 시스템에 비하여 훨씬 향상된 심볼 오류성능을 가지는 것을 확인할 수 있다.

홀로그래픽 데이터 저장장치를 위한 4-레벨 오류정정 변조부호 (4-level Error Correcting Modulation Codes for Holographic Data Storage System)

  • 이재훈;이재진
    • 한국통신학회논문지
    • /
    • 제39A권10호
    • /
    • pp.610-612
    • /
    • 2014
  • 멀티레벨 홀로그래픽 데이터 스토리지 시스템은 픽셀당 1비트 이상을 저장할 수 있기 때문에 용량에서 큰 이점을 갖는다. 만약 부호율이 2/3인 변조부호라면 2/3(symbol/pixel)은 4/3(bit/pixel)이고, 이것은 1pixel에 약 1.3개 bit를 담을 수 있다. 본 논문에서는 멀티레벨 홀로그래픽 데이터 저장장치에서 한 픽셀이 4-레벨을 가지는 경우, 최소 유클리디안 거리가 3과 4인 변조부호를 각각 제안하였다. 제안한 변조부호는 랜덤한 경우보다 훨씬 더 좋은 성능을 보였고, 거리가 클수록, 성능이 더 좋아지는 것을 보였다.

시공간 블록부호(STBC)가 결합된 TCM 디코더 설계에 관한 연구 (A Study on Design of a Low Complexity TCM Decoder Combined with Space-Time Block Codes)

  • 박철현;정윤호;이서구;김근회;김재석
    • 한국통신학회논문지
    • /
    • 제29권3A호
    • /
    • pp.324-330
    • /
    • 2004
  • 본 논문에서는 STBC (space tine block codes)의 채널 정보를 이용하여 TCM(Trellis Coded Modulation) 복호기의 연산량을 감소시키는 복호 방법을 제안하였고 이를 하드웨어로 설계 및 검증한 결과를 제시한다. 제안한 방법은 바이어스 포인트 설정을 이용하여 부집합에 n개의 시그널 포인트가 존재할 경우 실제 TCM 복호기에서 연산되는 가지 값을 부집합에서 1개의 시그널 포인트만 필요로 한다. 그러므로 바이어스 포인트 설정을 사용하여 가장 가까운 시그널 포인트를 미리 찾아내어 연산량을 l/n로 줄일 수 있다. 16QAM 8subset 경우에 AED (absolute euclidean distance)연산을 하게 되면 곱셈은 37%, 가감산 41%, 비교는 25%의 연산량 감소 효과가 있다. 또한 본 논문에서는 제안된 STBC와 TCM이 결합된 복호기의 하드웨어 합성 결과를 제시한다. 논리 합성 결과 약 87.6K개의 게이트가 요구됨을 확인하였다.

화상인식을 이용한 시각장애인용 보행보조장치 (Ambulatory Aid Device for the Visually Handicapped Person Using Image Recognition)

  • 박상준;신동원
    • 제어로봇시스템학회논문지
    • /
    • 제12권6호
    • /
    • pp.568-572
    • /
    • 2006
  • This paper presents the device of recognizing image of the studded paving blocks, transmitting, the information by vibration to a visually handicapped person. Usually the blind uses the walking stick to recognize the studded paving block. This research uses a PCA (Principal Component Analysis) based image processing approach for recognizing the paving blocks. We classify the studded paving blocks into 5 classes, that is, vertical line block, right-declined line block, left-declined line block, dotted block and flat block. The 8 images for each of 5 classes are captured for each block by 112*120 pixels, then the eigenvectors are obtained in magnitude order of eigenvectors by using principal component analysis. The principal components for images can be calculated using projection of transformation matrix composed of eigenvectors. The classification has been executed using Euclidean's distance, so the block having minimum distance with a image is chosen as matched one. The result of classification is transmitted to the blind by electric vibration signals with different magnitudes and frequencies.

농촌지역의 공공시설 및 도로 상황을 반영한 도로 우회계수 산정 (Calculation of Road Circuity Factors Considering Public Facilities and Road Condition in Rural Area)

  • 전정배;박미정;윤성수;서교;김은자
    • 농촌계획
    • /
    • 제23권2호
    • /
    • pp.55-65
    • /
    • 2017
  • This study is to estimate the circuity factors which can be used to assess for public facilities accessibility and analyze traffic in the area. We set the range of the administrative districts by Si Gun Gu unit and Eup Myeon Dong unit (more subdivided unit than Si Gun Gu unit). The average circuity factor in Si Gun Gu unit is 1.364 (maximum 2.953 and minimum 1.711). The region indicated the highest value of circuity factor is wando-gun in jeollanam-do, which area consists of 4 island and is connected to the bridges. Having to use the bridges for using public facilities hinders its accessibility. In the case of Eup Myeon Dong unit, the average circuity factor is 1.353 (maximum 2.950 and minimum 1.154). The region indicated the highest value of circuity factor is buksan-myeon in chuncheon-si, Gangwon-do. This region also has to use bridges for using public facilities because there is the largest lake, called Soyangho. This circuity factor is used to analyze the location of public facilities and assess vulnerability of accessibility. And also the factor can be applied to some policies, such as rural public service planning based on spatial big data.

홀로그래픽 데이터 저장장치에서의 멀티레벨 변조부호 (Multilevel Modulation Codes for Holographic Data Storage)

  • 정성권;이재진
    • 전자공학회논문지
    • /
    • 제52권9호
    • /
    • pp.13-18
    • /
    • 2015
  • 멀티레벨 홀로그래픽 데이터 저장장치는 한 픽셀에 1비트 이상을 저장할 수 있기 때문에 용량에 대한 큰 장점을 갖는다. 본 논문에서는 (1) 레벨의 수, (2) 코드워드 내에서 픽셀의 수, (3) 최소 유클리디안 거리에 따른 코드워드들의 개수를 보여준다. 픽셀당 레벨의 수의 증가는 용량을 증가시키지만 노이즈 마진이 감소함에 따라 많은 에러를 발생시킨다. 코드워드에서 픽셀개수의 증가는 코드율을 증가시키며 용량을 늘리지만, 코드의 인코더와 디코더의 복잡도를 증가시킨다. 코드의 최소 거리 증가는 검출 에러를 줄이지만 코드율을 감소시킨다. 위와 같이 시스템 디자인은 항상 장 단점을 가지고 있지만, 시스템의 요구사항을 위해 주어진 상황에서 효과적인 방법을 찾아야 한다. 그러므로 본 논문에서 조사된 코드워드의 수는 효과적인 코드 디자인을 위한 가이드라인을 제시한다.

피복구성학적 인체계측과 집낙구조분석 ( I ) (Anthropometry for clothing construction and cluster analysis ( I ))

  • 김구자
    • 한국의류학회지
    • /
    • 제10권3호
    • /
    • pp.37-48
    • /
    • 1986
  • The purpose of this study was to analyze 'the natural groupings' of subjects in order to classify highly similar somatotype for clothing construction. The sample for the study was drawn randomly out of senior high school boys in Seoul urban area. The sample size was 425 boys between age 16 and 18. Cluster analysis was more concerned with finding the hierarchical structure of subjects by three dimensional distance of stature. bust girth and sleeve length. The groups forming a partition can be subdivided into 5 and 6 sets by the hierarchical tree of the given subjects. Ward's Minimum Variance Method was applied after extraction of distance matrix by the Standardized Euclidean Distance. All of the above data was analyzed by the computer installed at Korea Advanced Institute of Science and Technology. The major findings, take for instance, of 16 age group can be summarized as follows. The results of cluster analysis of this study: 1. Cluster 1 (32 persons means $18.29\%$ of the total) is characterized with smaller bust girth than that of cluster 5, but stature and sleeve length of the cluster 1 are the largest group. 2. Cluster 2 (18 Persons means $10.29\%$ of the total) is characterized with the group of the smallest stature and sleeve length, but bust girth larger than that of cluster 3. 3. Cluster 3(35persons means $20\%$ of the total) is classified with the smallest group of all the stature, bust girth and sleeve length. 4. Cluster 4(60 persons means $34.29\%$ of the total) is grouped with the same value of sleeve length with the mean value of 16 age group, but the stature and bust girth is smaller than the mean value of this age group. 5. Cluster 5(30 persons means $17.14\%$ of the total) is characterized with smaller stature than that of cluster 1, and with larger bust girth than that of cluster 1, but with the same value of the sleeve length with the mean value of the 16 age group.

  • PDF

Automatic Object Segmentation and Background Composition for Interactive Video Communications over Mobile Phones

  • Kim, Daehee;Oh, Jahwan;Jeon, Jieun;Lee, Junghyun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제1권3호
    • /
    • pp.125-132
    • /
    • 2012
  • This paper proposes an automatic object segmentation and background composition method for video communication over consumer mobile phones. The object regions were extracted based on the motion and color variance of the first two frames. To combine the motion and variance information, the Euclidean distance between the motion boundary pixel and the neighboring color variance edge pixels was calculated, and the nearest edge pixel was labeled to the object boundary. The labeling results were refined using the morphology for a more accurate and natural-looking boundary. The grow-cut segmentation algorithm begins in the expanded label map, where the inner and outer boundary belongs to the foreground and background, respectively. The segmented object region and a new background image stored a priori in the mobile phone was then composed. In the background composition process, the background motion was measured using the optical-flow, and the final result was synthesized by accurately locating the object region according to the motion information. This study can be considered an extended, improved version of the existing background composition algorithm by considering motion information in a video. The proposed segmentation algorithm reduces the computational complexity significantly by choosing the minimum resolution at each segmentation step. The experimental results showed that the proposed algorithm can generate a fast, accurate and natural-looking background composition.

  • PDF