• Title/Summary/Keyword: Data Interpolation

Search Result 1,024, Processing Time 0.022 seconds

The Study of Performance Improvement of the 3-Cup Anemometer using Interpolation Methods (Interpolation을 이용한 3-CUP Anemometer의 성능 개선에 관한 연구)

  • 이성신;정택식;구법모
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.672-675
    • /
    • 2001
  • In this paper, we propose that the calculation method for accurate wind speed using interpolation methods, and the finding method for accurate wind direction using interpolation polynomial, so we make better performance for 3-Cup Anemometer by the proposed methods. We embody the 3-Cup Anemometer with photo sensor to measure wind direction and wind speed. In order to more accurate wind speed and wind direction, we present the methods to overcome the limitations of system memory and of the sensor measurement error by 8 bit gray code (as substitute 360 degrees for 256 degrees data).

  • PDF

The Generation of Free-Form Surface using Scattered Data Interpolation (분산 데이터 보간을 이용한 자유 형태 곡면 생성방법)

  • Lee, A-Ri;Park, Cheol-Ho;Sim, Jae-Hong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2504-2511
    • /
    • 1999
  • This paper proposes the scattered data interpolation as an efficient method that is designed for free-form surface. Data interpolation is an essential method of designing for various objects. For the generating free-form surface of complexity construction, the existing method had problems to represent flat area and sharp corner edge, in presenting objects with computing the weight of control points. For solving this problem, we proposes the generating method of new approximation surfaces, using scattered data interpolation. This method obtains B-Spline basis function which calculates main curvature, having optimized value in variable area, on given control points and changed objects, and then computes the changing rate the approximating data, using it's value. We also present this method that generates smoother free-form surface, using the scattered data interpolation with minimum weight.

  • PDF

Development of Kinematic Ephemeris Generator for Korea Pathfinder Lunar Orbiter (KPLO)

  • Song, Min-Sup;Park, Sang-Young;Kim, Youngkwang;Yim, Jo Ryeong
    • Journal of Astronomy and Space Sciences
    • /
    • v.37 no.3
    • /
    • pp.199-208
    • /
    • 2020
  • This paper presents a kinematic ephemeris generator for Korea Pathfinder Lunar Orbiter (KPLO) and its performance test results. The kinematic ephemeris generator consists of a ground ephemeris compressor and an onboard ephemeris calculator. The ground ephemeris compressor has to compress desired orbit propagation data by using an interpolation method in a ground system. The onboard ephemeris calculator can generate spacecraft ephemeris and the Sun/Moon ephemeris in onboard computer of the KPLO. Among many interpolation methods, polynomial interpolation with uniform node, Chebyshev interpolation, Hermite interpolation are tested for their performances. As a result of the test, it is shown that all the methods have some cases that meet requirements but there are some performance differences. It is also confirmed that, the Chebyshev interpolation shows better performance than other methods for spacecraft ephemeris generation, and the polynomial interpolation with uniform nodes yields good performance for the Sun/Moon ephemeris generation. Based on these results, a Kinematic ephemeris generator is developed for the KPLO mission. Then, the developed ephemeris generator can find an approximating function using interpolation method considering the size and accuracy of the data to be transmitted.

A Study on the Data Analysis of Fire Simulation in Underground Utility Tunnel for Digital Twin Application (디지털트윈 적용을 위한 지하공동구 화재 시뮬레이션의 데이터 분석 연구)

  • Jae-Ho Lee;Se-Hong Min
    • Journal of the Society of Disaster Information
    • /
    • v.20 no.1
    • /
    • pp.82-92
    • /
    • 2024
  • Purpose: The purpose of this study is to find a solution to the massive data construction that occurs when fire simulation data is linked to augmented reality and the resulting data overload problem. Method: An experiment was conducted to set the interval between appropriate input data to improve the reliability and computational complexity of Linear Interpolation, a data estimation technology. In addition, a validity verification was conducted to confirm whether Linear Interpolation well reflected the dynamic changes of fire. Result: As a result of application to the underground common area, which is the study target building, it showed high satisfaction in improving the reliability of Interpolation and the operation processing speed of simulation when data was input at intervals of 10 m. In addition, it was verified through evaluation using MAE and R-Squared that the estimation method of fire simulation data using the Interpolation technique had high explanatory power and reliability. Conclusion: This study solved the data overload problem caused by applying digital twin technology to fire simulation through Interpolation techniques, and confirmed that fire information prediction and visualization were of great help in real-time fire prevention.

Image Data Interpolation Based on Adaptive Triangulation

  • Xu, Huan-Chun;Lee, Jung-Sik;Hwang, Jae-Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.696-702
    • /
    • 2007
  • This paper proposes a regional feature preserving adaptive interpolation algorithm for natural images. The algorithm can be used in resolution enhancement, arbitrary rotation and other applications of still images. The basic idea is to first scan the sample image to initialize a 2D array which records the edge direction of all four-pixel squares, and then use the array to adapt the interpolation at a higher resolution based on the edge structures. A hybrid approach of switching between bilinear and triangulation-based interpolation is proposed to reduce the overall computational complexity. The experiments demonstrate our adaptive interpolation and show higher PSNR results of about max 2 dB than other traditional interpolation algorithms.

End-milling Force Estimation by Fractal Interpolation (프랙탈 보간에 의한 엔드밀링 절삭력 예측)

  • Jeong, Jin-Seok;Chin, Do-Hun;Yoon, Moon-Chul
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.5 no.1
    • /
    • pp.7-12
    • /
    • 2006
  • Recently, the fractal interpolation methods have been widely introduced and used to estimate and analyze various theoretical and experimental data. Because of the chaotic behaviors of dynamic cutting force data, some method for end-milling force analysis must be used. The fractal analysis used in this paper is fractal linear interpolation and fractal dimension. Also, several methods for computing fractal dimensions have been used in which the fractal dimension of the typical dynamic end-milling force was calculated according to number of data points that are generally lower than 200 data points sampled. This fractal analysis shows a possible prediction of end-milling force that has some dynamic chatter property or stationary property in endmilling operation.

  • PDF

CONSTRUCTION OF POSITIVE INTERPOLATION FUNCTIONS FOR DIFFUSION TENSOR

  • Shim, Hong-Tae
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.563-570
    • /
    • 2007
  • There has been a considerable research interest in medical communities for neuronal fiber tracking with magnetic resonance diffusion tensor imaging(DTI). DTI data have abundant structural boundaries that need to be preserved during interpolation to facilitate fiber tracking. Sigmoid function has been used in recent papers but the sigmoid function still is not good enough to be served as an positive interpolation in mathematical point of view. In this paper, we construct and provide two families positive cardinal interpolation functions.

Comparisons of Various DEM Interpolation Techniques

  • Kim, Tae-Jung
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • pp.163-168
    • /
    • 1998
  • Extracting a Digital Elevation Model (DEM) from spaceborne imagery is important for cartographic applications of remote sensing data. The procedure for such DEM generation can be divided into stereo matching, sensor modelling and DEM interpolation. Among these, DEM interpolation contributes significantly to the completeness and accuracy of a DEM and, yet, this technique is often considered "trivial". However, na\ulcornere DEM interpolation may result in a less accurate and sometimes meaningless DEM. This paper reports the performance analysis of various DEM interpolation techniques. Using a manually derived DEM as reference, a number of sample points were created randomly. Different interpolation techniques were applied to the sample points to generate DEMs. The performance of interpolation was assessed by the accuracy of such DEMs. The results showed that kriging gave the best results at all times whereas nearest neighborhood interpolation provided a fast solution with moderate accuracy when sample points were large enough.

  • PDF

Edge Adaptive Hierarchical Interpolation for Lossless and Progressive Image Transmission

  • Biadgie, Yenewondim;Wee, Young-Chul;Choi, Jung-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2068-2086
    • /
    • 2011
  • Based on the quincunx sub-sampling grid, the New Interleaved Hierarchical INTerpolation (NIHINT) method is recognized as a superior pyramid data structure for the lossless and progressive coding of natural images. In this paper, we propose a new image interpolation algorithm, Edge Adaptive Hierarchical INTerpolation (EAHINT), for a further reduction in the entropy of interpolation errors. We compute the local variance of the causal context to model the strength of a local edge around a target pixel and then apply three statistical decision rules to classify the local edge into a strong edge, a weak edge, or a medium edge. According to these local edge types, we apply an interpolation method to the target pixel using a one-directional interpolator for a strong edge, a multi-directional adaptive weighting interpolator for a medium edge, or a non-directional static weighting linear interpolator for a weak edge. Experimental results show that the proposed algorithm achieves a better compression bit rate than the NIHINT method for lossless image coding. It is shown that the compression bit rate is much better for images that are rich in directional edges and textures. Our algorithm also shows better rate-distortion performance and visual quality for progressive image transmission.

Wavelet Based Matching Pursuit Method for Interpolation of Seismic Trace with Spatial Aliasing (공간적인 알리아싱을 포함한 탄성파 트레이스의 내삽을 위한 요소파 기반의 Matching Pursuit 기법)

  • Choi, Jihun;Byun, Joongmoo;Seol, Soon Jee
    • Geophysics and Geophysical Exploration
    • /
    • v.17 no.2
    • /
    • pp.88-94
    • /
    • 2014
  • Due to mechanical failure or geographical accessibility, the seismic data can be partially missed. In addition, it can be coarsely sampled such as crossline of the marine streamer data. This seismic data that irregular sampled and spatial aliased may cause problems during seismic data processing. Accurate and efficient interpolation method can solve this problem. Futhermore, interpolation can save the acquisition cost and time by reducing the number of shots and receivers. Among various interpolation methods, the Matching Pursuit method can be applied to any sampling type which is regular or irregular. However, in case of using sinusoidal basis function, this method has a limitation in spatial aliasing. Therefore, in this study, we have developed wavelet based Matching Pursuit method that uses wavelet instead of sinusoidal function for the improvement of dealiasing performance. In addition, we have improved interpolation speed by using inner product instead of L-2 norm.