• Title/Summary/Keyword: 여현오차

Search Result 7, Processing Time 0.023 seconds

The Study on Table Deflection by Stationary State and Feedrate at Loaded (하중 적재시 정지상태 및 이송시 하중에 따른 테이블 처짐에 관한 연구)

  • Lee Seung Soo;Kim Min Ju;Kim Soon Kyung;Seo Sang Ha;Jeon Eon Chan
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.13 no.6
    • /
    • pp.41-47
    • /
    • 2004
  • This study is aimed to measure the deflection of loaded table on machine tool. The deflection rate is measured then the table is in a stationary state and is moved. In conclusion we have found that the more load increases, the more the table deflections. Also, we have found that the deflection rate increases in accordance with the speed of movement. Therefore, we have concluded that inspection of machine tool should be done considering the weight of load and the speed of movement. However, since the condition of accuracy test for domestic brand of machine tool is defined as unloaded case, measures should be explored only for loaded case.

Transform Coding of Error Signals in Polygonal Approximation to Contour (윤곽선 다각근사화시 오차신호에 대한 변환 부호화 기법)

  • 민병석;김승종;정제창;최병욱
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1997.11a
    • /
    • pp.55-62
    • /
    • 1997
  • 본 논문에서는 윤곽선의 다각근사화시 발생하는 오차신호를 표본화하고 표본화된 신호를 부호화하기 위한 새로운 변환을 제안한다. 제안하는 방법은 다각근사화시 발생하는 윤곽선의 단편들이 완만한 곡선의 형태를 갖고 양 끝점이 0이라는 특징을 고려해서 르장드르 다항식에 기반한 새로운 변환을 제안한다. 제안한 방법은, 기존의 방법인 이산여현변환, 이산정현변환 등과 변환부호화 이득면에서 비교해 볼 때 우수한 결과를 얻었다.

  • PDF

A fast DCT algorithm with reduced propagation error in the fixed-point compuitation (고정 소수점 연산시 오차의 전파를 줄이는 고속 이산 여현 변환 알고리즘)

  • 정연식;이임건;최영호;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2365-2371
    • /
    • 1998
  • Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

  • PDF

A new transform coding for contours in object-based image compression (객체지향 영상압축에 있어서 윤곽선에 대한 새로운 변환 부호화)

  • 민병석;정제창;최병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.4
    • /
    • pp.1087-1099
    • /
    • 1998
  • In the content-based image coding, where each object in the scene is encoded independently, the shape, texture and motion information are very important factors. Though the contours representing the shape of an object occupy a great amount of data in proportion to the whole information, they strongly affect the subjective image quaility. Therefore, the distortion of contour coding has to be minimized as much as possible. In this paper, we propose a new method for the contour coding in which the contours are approximated to polygon and the eorror signal occurring from polygonal approximation are transformed with new basis functions. Considering the facts that confour segments occurring from polygonal approximation are smooth curves and error signals have two zero-ending points, we design new basis functions based on the Legendre polynomial and then transform the error signals with them. When applied to synthetic images such as circles, ellipses and etc., the proposed method provides, in overall, outstanding results in respect to the transform coding gain compared with DCT and DST. And in the case when applied to natural images, the proposed method gives better image quality over DCT and comparable results with DST.

  • PDF

A Simple Human Visual Weighted Hadamard Transform Image Coding (단순한 시각적 하중에 의한 아다마르 영상부호화)

  • Hwang, Jae-Jeong;Lee, Moon-Ho
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.4
    • /
    • pp.98-105
    • /
    • 1989
  • Various models incorporating Human Visual System (HVS) with the Hadamard transform (HT) represented by Walsh functions are considered. Using the exact frequency components of HT basis functions, the optimum modulation transfer function (MTF) which has a higher peak frequency than DCT schemes is obtimum modulation transfer function (MTF) which has a higher peak frequency than DCT schemes is obtained analytically and visually. The main criterion, for error measurement, is errors at the block boundaries which is an important factor in transform coding. The scheme which has no inverse HVS is proposed. It causes some degradation of image data but it is insignigicant. Crossing area of 4 blocks is equalized by the HVS weighting coefficients. The HVS weighted coding results in perceptually higher quality images compared with the unweighted scheme.

  • PDF

Face Recognition Using a Phase Difference for Images (영상의 위상 차를 이용한 얼굴인식)

  • Kim, Seon-Jong;Koo, Tak-Mo;Sung, Hyo-Kyung;Choi, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.81-87
    • /
    • 1998
  • This paper proposes an efficient face recognition system using phase difference between the face images. We use a Karhunen-Loeve transform for image compression and reconstruction, and obtain the phase difference by using normalized inner product of the two compressed images. The proposed system is rotation and light-invariant due to using the normalized phase difference, and somewhat shift-invariant due to applying the cosine function. The faster recognition than the conventional system and incremental training is possible in the proposed system. Simulations are conducted on the ORL images of 40 persons, in which each person has 10 facial images, and the result shows that the faster recognition than conventional recognizer using convolution network under the same recognition error rate of 8% does.

  • PDF

Identification of Nonstationary Time Varying EMG Signal in the DCT Domain and a Real Time Implementation Using Parallel Processing Computer (DCT 평면에서의 비정상 시변 근전도 신호의 인식과 병렬처리컴퓨터를 이용한 실시간 구현)

  • Lee, Young-Seock;Lee, Jin;Kim, Sung-Hwan
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.4
    • /
    • pp.507-516
    • /
    • 1995
  • The nonstationary identifier in the DCT domain is suggested in this study for the identification of AR parameters of above-lesion upper-trunk electromyographic (EMG) signals as a means of developing a reliable real time signal to control functional electrical stimulation (FES) in paraplegics to enable primitive walking. As paraplegic shifts his posture from one attitude to another, there is transition period where the signal is clearly nonstationary. Also as muscle fatigues, nonstationarities become more prevalent even during stable postures. So, it requires a develpment of time varying nonstationary EMG signal identifier. In this paper, time varying nonstationary EMG signals are transformed into DCT domain and the transformed EMG signals are modeled and analyzed in the transform domain. In the DCT domain, we verified reduction of condition number and increment of the smallest eigenvalue of input correlation matrix that influences numerical properties and mean square error were compared with SLS algorithm, and the proposed algorithm is implemented using IMS T-805 parallel processing computer for real time application.

  • PDF