• Title/Summary/Keyword: Lagrange 보간법

Search Result 29, Processing Time 0.021 seconds

High Density Salt & Pepper Noise Reduction using Lagrange Interpolation and Iteration Process (Lagrange 보간 및 반복 처리를 이용한 고밀도 Salt & Pepper 잡음 제거)

  • Kwon, Se-Ik;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.965-972
    • /
    • 2015
  • Along with the rapid development in digital times, image media are being used in internet, computer and digital camera. But image deterioration occurs due to various exterior reasons in the procedures of acquisition, processing, transmission and recording of digital image and major reason is noise. Therefore in order to remove salt & pepper noise, this study suggested the algorithm which replaces the noise to original pixel in case of non-noise, and processes the noise with Lagrange interpolation method in case of noise. In case high density noise was added and the noise could not be removed, noise characteristics were improved by processing the noises repeatedly. And for objective judgment, this method was compared with existing methods and PSNR(peak signal to noise ratio) was used as judgment standard.

Performance Analysis of an Uplink MC-CDMA/TDD System with Pre-Equalization (사전등화를 이용하는 상향링크 MC-CDMA/TDD 시스템의 성능분석)

  • 남기호;오성근;선우명훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.218-221
    • /
    • 2003
  • 본 논문에서는 사전등화를 이용하는 상향링크 MC-CDMA(multicarrier-code division multiple access)/TDD(time division duplexing) 시스템에서 사전등화를 위한 상향링크 채널을 추정하는 방법들을 제안하고 시스템의 성능분석을 수행한다. 제안된 방법들에서는 하향링크 슬롯구간에서의 채널변화를 적절한 차수의 다항식으로 모델링하고, 이 다항식을 상향링크 슬롯구간으로 확장함으로써 상향링크 슬롯구간의 채널을 추정한다. 하향링크 슬롯구간에서의 채널변화는 MMSE(minimum mean squared error)curve fitting 방법이나 Lagrange 보간법 등이 사용되며 1차, 2차, 3차 다항식으로 근사화 된다. 성능지표로 정확도보다 시스템 성능이 중요 하므로 BER (bit error rate)을 사용한다. 다양한 시스템 및 채널환경에서의 모의실험 결과로부터 Lagrange 보간법은 하향링크 채널정보가 정확한 경우에는 MMSE 방법보다 성능이 다소 우수하지만 하향링크 채널추정 오류에 매우 민감하며, 2 차 다항식을 사용한 MMSE curve fitting 방법은 다양한 환경에서 우수한 성능을 가질 뿐만 아니라 채널추정 오류에도 매우 강인함을 알 수 있다.

  • PDF

A Filter Algorithm based on Partial Mask and Lagrange Interpolation for Impulse Noise Removal (임펄스 잡음 제거를 위한 부분 마스크와 라그랑지 보간법에 기반한 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.5
    • /
    • pp.675-681
    • /
    • 2022
  • Recently, with the development of IoT technology and AI, unmanned and automated in various fields, interest in video processing, which is the basis for automation such as object recognition and object classification, is increasing. Various studies have been conducted on noise removal in the video processing process, which has a significant impact on image quality and system accuracy and reliability, but there is a problem that it is difficult to restore images for areas with high impulse noise density. In this paper proposes a filter algorithm based on partial mask and Lagrange interpolation to restore the damaged area of impulse noise in the image. In the proposed algorithm, the filtering process was switched by comparing the filtering mask with the noise estimate and the purge weight was calculated based on the low frequency component and the high frequency component of the image to restore the image.

Numerical Modeling of One-Dimensional Longitudinal Dispersion Equation using Eulerian-Lagrangian Method (Eulerian-Lagrangian 방법을 이용한 1차원 종확산방정식의 수치모형)

  • 서일원;김대근
    • Water for future
    • /
    • v.27 no.2
    • /
    • pp.155-166
    • /
    • 1994
  • Various Eulerian-Lagrangian numerical models for the one-dimensional longitudinal dispersion equation are studied comparatively. In the model studied, the transport equation is decoupled into two component parts by the operator-splitting approach ; one part governing adveciton and the other dispersion. The advection equation has been solved using the method of characteristics following fluid particles along the characteristic line and the results are interpolated onto an Eulerian grid on which the dispersion equation is solved by Crank-Nicholson type finite difference method. In solving the advection equation, various interpolation schemes are tested. Among those, Hermite interpolation polynomials are superior to Lagrange interpolation polynomials in reducing dissipation and dispersion errors in the simulation.

  • PDF

A Multi-Compartment Secret Sharing Method (다중 컴파트먼트 비밀공유 기법)

  • Cheolhoon Choi;Minsoo Ryu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.2
    • /
    • pp.34-40
    • /
    • 2024
  • Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.

Interpolation-Based Adaptive LQ Control for Nonlinear Systems (비선형 시스템을 위한 보간 기반의 적응 LQ 제어)

  • Lee, Yun-Hyung;Ahn, Jong-Kap;Jin, Gang-Gyoo;So, Myung-Ok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.32 no.4
    • /
    • pp.618-623
    • /
    • 2008
  • This paper presents a design method of the Interpolation-based adaptive LQ controller that is accomplished by getting the final controller interpolated with each gain of sub-LQ controllers. The Lagrange interpolation method is used in the scheme. The proposed controller is useful to control nonlinear systems which are especially changed the system parameters. The design method is illustrated by an application to the stabilization and tracking problems of an inverted pole system on a cart. Several cases of simulations are carried out in order to validate the control effectiveness and robustness. The simulation results are compared with those of LQ controller and prove the better control performance than LQ controller.

An estimate of silicon wafer's cross section shape by interpolation (보간법에 의한 실리콘웨이퍼 단면도 추정)

  • Song, Eun-Jee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04a
    • /
    • pp.345-348
    • /
    • 2001
  • 반도체에 이용되는 실리콘웨이퍼 생산에 있어 평탄도는 가장 중요한 요소 중 하나이다. 실리콘웨이퍼의 평탄도는 POLISHING이라는 공정과정을 통하여 측정하고 제어하고 있는데 현재 측정장비에서 보여주는 웨이퍼의 모양을 사람에 의해 제어하고 있어 경험이 필요하고 일일이 사람이 체크해야하는 번거로움이 있다. 따라서 평탄도가 시스템에 의해 자동적으로 측정되고 제어할 필요가 있다. 본 연구는 웨이퍼의 3차원 형상을 측정하여 보여주는 장비에서 이미지와 함께 나타나는 몇 개의 정량적인 항목을 이용하여 웨이퍼의 단면도를 추정하는 알고리즘을 제안함으로 평탄도가 자동으로 측정될 수 있도록 하였다. 이 알고리즘은 Spline보간법을 이용하였고 웨이퍼의 특정단면 뿐만 아니라 임의의 단면도도 추정할 수 있으며 수치실험을 통해 Lagrange보간법과 비교하여 그 효율성을 입증하였다.

  • PDF

The New Integral Operational Matrix of Block Pulse Function using Interpolation Method (보간법을 이용한 블록펄스 함수에 대한 새로운 적분 연산행렬의 유도)

  • Jo, Yeong-Ho;Sin, Seung-Gwon;Lee, Han-Seok;An, Du-Su
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.6
    • /
    • pp.753-759
    • /
    • 1999
  • BPF(block pulse function) has been used widely in the system analysis and controller design. The integral operational matrix of BPF converts the system represented in the form of the differential equation into the algebraic problem. Therefore, it is important to reduce the error caused by the integral operational matrix. In this paper, a new integral operational matrix is derived from the approximating function using Lagrange's interpolation formula. Comparing the proposed integral operational matrix with another, the result by proposed matrix is closer to the real value than that by the conventional matrix. The usefulness of th proposed method is also verified by numerical examples.

  • PDF

조사구간 윈도우 변형을 이용한 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