• Title/Summary/Keyword: iterative polynomial fitting

Search Result 4, Processing Time 0.015 seconds

Iterative Polynomial Fitting Technique Using Polynomial Coefficients for the Nonlinear Line Array Shape Estimation (비선형 선배열 형상 추정을 위한 계수 반복 다항 근사화 기법)

  • Cho, Chom Gun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.9 no.2 s.25
    • /
    • pp.20-25
    • /
    • 2006
  • Low frequency towed line array with high array gain and beam resolution is a long range surveillance sensor for anti-submarine warfare. The beam characteristics is however deteriorated due to the distorted line array sensor caused by low towing speed, wind, current, and towing ship maneuvering. An adaptive beamforming method is utilized in this paper to enhance the distorted line array beam performance by estimating and compensating the nonlinear array shape. A polynomial curve fitting in the least square sense is used to estimate the array shape iteratively with the distributed heading sensors data along the array. Real time array shape estimation and nonlinear array beam calculation is applied to a very long towed line array sensor system and the beam performance is evaluated and compared to the linear beamformer for the simulation and sea trial data.

Iterative Polynomial Fitting Technique for the Nonlinear Array Shape Estimation (비선형 선배열 형상 추정을 위한 반복 다항 근사화 기법)

  • 조요한;조치영;서희선
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.8
    • /
    • pp.74-80
    • /
    • 2001
  • Because of ocean waves, swell, steering corrections, etc, the hydrophones of a towed array will not live along a straight line. However the degradation of bearing estimation performance occurs when beamforming is carried out on the hydrophone outputs of an acoustic towed array which is not straight. So it is required to estimate the shape of the array for the improved beamformer output. In this paper, an iterative array shape estimation technique is presented, which is based on the use of the least squares polynomial fitting to the data from heading sensors. The estimation error and the influence of deformations on the performance of the conventional beamformer output are investigated. Finally, the suggested method is applied to the real system in order to investigate the applicability.

  • PDF

Array Shape Estimation Method Using Heading Sensors (방위센서를 이용한 배열 형상 추정기법)

  • 조요한;서희선;조치영
    • Journal of KSNVE
    • /
    • v.10 no.5
    • /
    • pp.886-891
    • /
    • 2000
  • In this paper, an iterative array shape estimation technique is presented, which is based on the use of the least squares polynomial fitting to the data from heading sensors. The estimated polynomial shape model is then used for calculating the hydrophone positions on the assumption that the arc distances between sensors are constant. In order to verify the applicability of the proposed algorithm, numerical simulations are performed using two types of non-linear array shapes. In addition the noise effects of heading sensors on the array shape estimation results and the performance of beamformer are also investigated.

  • PDF

On the Spatial Registration Considering Image Exposure Compensation (영상의 노출 보정을 고려한 공간 정합 알고리듬 연구)

  • Kim, Dong-Sik;Lee, Ki-Ryung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.93-101
    • /
    • 2007
  • To jointly optimize the spatial registration and the exposure compensation, an iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm, which is based on the histogram transformation function. Based on a simple regression model, a nonparametric estimator, the empirical conditional mean, and its polynomial fitting are used as histogram transformation functions for the exposure compensation. Since the proposed algorithm is composed of separable optimization phases, the proposed algorithm is more advantageous than the joint approaches of Mann and Candocia in the aspect of implementation flexibility. The proposed algorithm performs a better registration for real images than the case of registration that does not consider the exposure difference.