• Title/Summary/Keyword: Linear Interpolation

Search Result 599, Processing Time 0.022 seconds

Effect of Interval Size on Interpolation Estimates between Graduation Markers on CRT Display (CRT 표시장치에서 내삽 추정치에 대한 구간크기의 효과)

  • Ro, Jae-Ho
    • Journal of Industrial Technology
    • /
    • v.9
    • /
    • pp.67-77
    • /
    • 1989
  • This study is concerned with the accuracy, the pattern of error with which subjects can interpolate the location of a pointer or a target between two graduation markers with various size on CRT display. Stimuli were graphic images on CRT with a linear, end-marked, ungraduated scales having a target for t base-line sizes. The location of a target is estimated in units over the range 1-99. Smallest error of estimates was at the near ends and middle of the base-line. The median error was less 2 units, modal error was 1, and most error(;99.6%) was within 10. Subjects had a more tendency to overestimate than to underestimate at the left-part of base-line in all siges, and an opposite tendency at the right-part. A proper size to minimize the interpolation error exists such that size 500. It is suggested that interpolation of fifths and even tenths will give a reguired accuracy for certain situations, and relative location and base-line size has a relevant attribute to interpolate.

  • PDF

Three Dimensional Shape Morphing of Triangular Net (삼각망의 3 차원 형상 모핑)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.1
    • /
    • pp.160-170
    • /
    • 2008
  • Shape morphing is the process of transforming a source shape, through intermediate shapes, into a target shape. Two main problems to be considered in three dimensional shape morphing are vertex correspondence and path interpolation. In this paper, an approach which uses the linear interpolation of the Laplacian coordinates of the source and target meshes is introduced for the determination of more plausible path when two topologically identical shapes are morphed. When two shapes to be morphed are different in shape and topology, a new method which combines shape deformation theory based on Laplacian coordinate and mean value coordinate with distance field theory is proposed for the efficient treatment of vertex correspondence and path interpolation problems. The validity and effectiveness of the suggested method was demonstrated by using it to morph large and complex polygon models including male and female whole body models.

조사구간 윈도우 변형을 이용한 PIV에서 보간법 평가

  • Kim, Byeong-Jae;Seong, Hyeong-Jin
    • 한국가시화정보학회:학술대회논문집
    • /
    • 2006.12a
    • /
    • pp.25-35
    • /
    • 2006
  • We have evaluated the performances of the following six interpolation schemes used for window deformation in particle image velocimetry (PIV): the linear, quadratic, B-spline, cubic, sinc, Lagrange interpolations. Artificially generated images comprised of particles of diameter in a range $1.1{\leq}d_p\leq10.0$ pixel were investigated. Three particle diameters were selected for detailed evaluation: $d_p$=2.2, 3.3, 4.4 pixel with a constant particle concentration 0.02 $particle/pixel^2$. Two flow patterns were considered: uniform and shear flows. The mean and random errors, and the computation times of the interpolation schemes were determined and compared.

  • PDF

Neural Network Modeling for the Superheated, Saturated and Compressed Region of Steam Table (증기표의 과열, 포화 및 압축영역의 신경회로망 모델링)

  • Lee, Tae-Hwan;Park, Jin-Hyun
    • Journal of the Korean Society of Mechanical Technology
    • /
    • v.20 no.6
    • /
    • pp.872-878
    • /
    • 2018
  • Steam tables including superheated, saturated and compressed region were simultaneously modeled using the neural networks. Pressure and temperature were used as two inputs for superheated and compressed region. On the other hand Pressure and dryness fraction were two inputs for saturated region. The outputs were specific volume, specific enthalpy and specific entropy. The neural network model were compared with the linear interpolation model in terms of the percentage relative errors. The criterion of judgement was selected with the percentage relative error of 1%. In conclusion the neural networks showed better results than the interpolation method for all data of superheated and compressed region and specific volume of saturated region, but similar for specific enthalpy and entropy of saturated region.

A Study on the Optimization of color in Digital Printing (디지털 인쇄에 있어서 컬러의 최적화에 관한 연구)

  • Kim, Jae-Hae;Lee, Sung-Hyung;Cho, Ga-Ram;Koo, Chul-Whoi
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.26 no.1
    • /
    • pp.51-64
    • /
    • 2008
  • In this paper, an experiment was done where the input(scanner, digital still camera) and monitor(CRT, LCD) device used the linear multiple regression and the GOG (Gain-Offset-Gamma) characterization model to perform a color transformation. Also to color conversion method of the digital printer it used the LUT(Look Up Table), 3dimension linear interpolation and a tetrahedron interpolation method. The results are as follows. From color reappearance of digital printing case of monitor, the XYZ which it converts in linear multiple regression of input device it multiplied the inverse matrix, and then it applies the inverse GOG model and after color converting the patch of the result most which showed color difference below 5 at monitor RGB value. Also, The XYZ which is transmitted from the case input device which is a printer it makes at LAB value to convert an extreme, when the LAB value which is converted calculating the CMY with the LUT and tetrahedral interpolations the color conversion which considers the black quantity was more accurate.

  • PDF

New Non-linear Inverse Quantization Algorithm and Hardware Architecture for Digital Audio Codecs (디지털 오디오 코덱을 위한 새로운 비선형 역 양자화 알고리즘과 하드웨어 구조)

  • Moon, Jong-Ha;Baek, Jae-Hyun;SunWoo, Myung-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.12-18
    • /
    • 2008
  • This paper This paper proposes a new inverse-quantization(IQ) table interpolation algorithm, specialized Digital Signal Processor(DSP) instructions and hardware architecture for digital audio codecs. Non-linear inverse quantization algorithm is representatively used in both MPEG-1 Layer-3 and MPEG-2/4 Advanced Audio Coding(AAC). The proposed instructions are optimized for the non-linear inverse quantization. The proposed algorithm can minimize operational complexity which reduces total computational load. Performance comparisons show a significant improvement of average error. The proposed instructions and hardware architecture can reduce 20% of the instruction counts and minimize computational loads of IQ algorithms effectively compared with existing IQ table interpolation algorithms. Proposed algorithm can implement commercial DSPs.

Image Magnification Technique using Improved Surface Characteristics Estimation Method (개선된 곡면 특성 추정 기법을 이용하는 영상 확대 기법)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.1
    • /
    • pp.95-101
    • /
    • 2017
  • In natural images, there is generally locality, and the values of adjacent pixels are similar. It is possible to estimate the curved surface characteristics of the original image using adjacent pixels having similar pixel values. In this paper, after precisely estimating the characteristics of the curved surface existing in the image, interpolation values are obtained so as to faithfully reflect the estimated characteristics of the curved surface, We propose an effective image enlarging method that generates an enlarged image using the obtained interpolation values. The image enlarged by the proposed method maintains the curved surface characteristics of the original image, and thus the image quality of the enlarged image is improved. Experimental results show that the image quality of the proposed method is superior to that of the conventional techniques.

A new approach for B-spline surface interpolation to contours (윤곽선들의 B-spline 곡면 보간을 위한 새로운 방식)

  • Park Hyungjun;Jung Hyung Bae;Kim Kwangsoo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.474-479
    • /
    • 2003
  • This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

  • PDF

Discrete Ordinates Interpolation Method Applied to Irregular Three-Dimensional Geometries (불규칙한 3차원 형상에 응용된 구분종좌표보간법)

  • Cha, Ho-Jin;Song, Tae-Ho
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.6
    • /
    • pp.814-821
    • /
    • 2000
  • The Discrete Ordinates Interpolation Method (DOIM) is tested in three-dimensional enclosures. The radiative transfer equation (RTE) is solved for a linear source term and the DOIM is formulated for a gray medium. Several interpolation methods can be applied to the DOIM scheme. Among them, the interpolation method applicable to an unstructured grid system is discussed. In a regular hexahedron enclosure, radiative wall heat fluxes are calculated and compared with exact solutions. The enclosure has an absorbing, emitting and nonscattering medium and a constant temperature distribution. These results are obtained with varying optical depths (xD = 0.1, 1.0, 10.0). Also, the same calculations are performed in an irregular hexahedron enclosure. The DOIM is applied to an unstructured grid system as well as a structured grid system for the same regular hexahedron enclosure. They are compared with the exact solutions and the computational efficiencies are discussed. When compared with the analytic solutions, results of the DOIM are in good agreement for three-dimensional enclosures. Furthermore, the DOIM can be easily applied to the unstructured grid system, which proves the reliability and versatility of the DOIM.

Interpolation-based Precoding Approximation Algorithm for Low Complexity in Multiuser MIMO-OFDM Systems (다중 사용자 MIMO-OFDM 시스템에서 계산양 감소를 위한 선형 보간법 기반 프리코딩 근사화 기법)

  • Lim, Dong-Ho;Kim, Bong-Seok;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11A
    • /
    • pp.1027-1037
    • /
    • 2010
  • In this paper, we propose the linear interpolation-based BD (Block Diagonalization) precoding approximation algorithm for low complexity in downlink multiuser MIMO-OFDM (Multiple-input Multiple-output Orthogonal Frequency Division Multiplexing) systems. In the case of applying the general BD precoding algorithm to multiuser MIMO-OFDM systems, the computational complexity increases in proportional to the number of subcarriers. The proposed interpolation-based BD precoding approximation algorithm can be achieved similar SER performance with general BD algorithm and can decrease the computational complexity. It is proved that proposed algorithm can achieve the significantly decreased computational complexity by computer simulation.