• Title/Summary/Keyword: optimal estimation

Search Result 1,618, Processing Time 0.026 seconds

ARC-LENGTH ESTIMATIONS FOR QUADRATIC RATIONAL B$\acute{e}$zier CURVES COINCIDING WITH ARC-LENGTH OF SPECIAL SHAPES

  • Kim, Seon-Hong;Ahn, Young-Joon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.15 no.2
    • /
    • pp.123-135
    • /
    • 2011
  • In this paper, we present arc-length estimations for quadratic rational B$\acute{e}$zier curves using the length of polygon and distance between both end points. Our arc-length estimations coincide with the arc-length of the quadratic rational B$\acute{e}$zier curve exactly when the weight ${\omega}$ is 0, 1 and ${\infty}$. We show that for all ${\omega}$ > 0 our estimations are strictly increasing with respect to ${\omega}$. Moreover, we find the parameter ${\mu}^*$ which makes our estimation coincide with the arc-length of the quadratic rational B$\acute{e}$zier curve when it is a circular arc too. We also show that ${\mu}^*$ has a special limit, which is used for optimal estimation. We present some numerical examples, and the numerical results illustrates that the estimation with the limit value of ${\mu}^*$ is an optimal estimation.

Individual Channel Estimation Based on Blind Interference Cancellation for Two-Way MIMO Relay Networks

  • He, Xianwen;Dou, Gaoqi;Gao, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3589-3605
    • /
    • 2018
  • In this paper, we investigate an individual channel estimation problem for multiple-input multiple-output (MIMO) two-way amplify-and-forward (AF) relay networks. To avoid self-interference during the estimation of the individual MIMO channels, a novel blind interference cancellation (BIC) approach is proposed based on an orthogonal preceding framework, where a pair of orthogonal precoding matrices is utilized at the source nodes. By designing an optimal decoding scheme, we propose to decompose the bidirectional transmission into a pair of unidirectional transmissions. Unlike most existing approaches, we make the practical assumption that the nonreciprocal MIMO channel and the mutual interference of multiple antennas are both taken into consideration. Under the precoding framework, we employ an orthogonal superimposed training strategy to obtain the individual MIMO channels. However, the AF strategy causes the noise at the terminal to be the sum of the local noise and the relay-propagated noise. To remove the relay-propagated noise during the estimation of the second-hop channel, a partial noise-nulling method is designed. We also derive a closed-form expression for the total mean square error (MSE) of the MIMO channel from which we compute the optimal power allocation. The simulation results demonstrate that the analytical and simulated curves match fully.

Quasi-Optimal Linear Recursive DOA Tracking of Moving Acoustic Source for Cognitive Robot Auditory System (인지로봇 청각시스템을 위한 의사최적 이동음원 도래각 추적 필터)

  • Han, Seul-Ki;Ra, Won-Sang;Whang, Ick-Ho;Park, Jin-Bae
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.3
    • /
    • pp.211-217
    • /
    • 2011
  • This paper proposes a quasi-optimal linear DOA (Direction-of-Arrival) estimator which is necessary for the development of a real-time robot auditory system tracking moving acoustic source. It is well known that the use of conventional nonlinear filtering schemes may result in the severe performance degradation of DOA estimation and not be preferable for real-time implementation. These are mainly due to the inherent nonlinearity of the acoustic signal model used for DOA estimation. This motivates us to consider a new uncertain linear acoustic signal model based on the linear prediction relation of a noisy sinusoid. Using the suggested measurement model, it is shown that the resultant DOA estimation problem is cast into the NCRKF (Non-Conservative Robust Kalman Filtering) problem [12]. NCRKF-based DOA estimator provides reliable DOA estimates of a fast moving acoustic source in spite of using the noise-corrupted measurement matrix in the filter recursion and, as well, it is suitable for real-time implementation because of its linear recursive filter structure. The computational efficiency and DOA estimation performance of the proposed method are evaluated through the computer simulations.

A Study on Super Resolution Optimum Beam Steering Pattern for Improvement Moving Target Estimation Accuracy (이동 목표물 추정 정확도를 향상시키기 위한 고 분해능 최적 빔 지향 패턴에 관한 연구)

  • Cho, Sung Kuk;Jeon, Byung Kook;Yang, Gill Mo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.4
    • /
    • pp.71-78
    • /
    • 2014
  • Method a target estimation in spatial are mobile wireless communication using network cell and GPS. It have much error that mobile wireless communication depend on cell size. GPS method can't find a target in shadow and inner area. In this paper, we estimate a target as direction of arrival method using adaptive array antenna system. Adaptive array antenna system can obtain desired signal to remove other signal This paper studied digital beamforming method in order to estimation a target. Proposed method is modified optimum weight and antenna error correction to estimation an optimal receive signal. Digital beamforming method decided a signal phase and amplitude from received signal on array antenna element. But if it is not to do error correction of received signal, system performance have decreased. Firstly, we proposed modified optimum weight in order to finding desired target. Secondly, we are error correction of antenna incident signals by optimal weight before digital beamforming method. Thirdly, throughly simulation, we showed that system performance of proposed method compare proposal method with general method. It have improved resolution of estimation target to good performance more proposed method than general method.

A Study on the Performance Digital Beamforming using Antenna Error Correction and Modified Optimum Weight for Improved Signal Estimation (향상된 신호 추정을 위한 안테나 오차 보정 과 수정된 최적 가중치를 이용한 디지털 빔 형성 성능 분석에 관한 연구)

  • Cho, Sung Kuk;Lee, Jun Dong;Yang, Gill Mo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.4
    • /
    • pp.63-70
    • /
    • 2014
  • Method a target estimation in spatial are mobile wireless communication using network cell and GPS. It have much error that mobile wireless communication depend on cell size. GPS method can't find a target in shadow and inner area. In this paper, we estimate a target as direction of arrival method using adaptive array antenna system. Adaptive array antenna system can obtain desired signal to remove other signal This paper studied digital beamforming method in order to estimation a target. Proposed method is modified optimum weight and antenna error correction to estimation an optimal receive signal. Digital beamforming method decided a signal phase and amplitude from received signal on array antenna element. But if it is not to do error correction of received signal, system performance have decreased. Firstly, we proposed modified optimum weight in order to finding desired target. Secondly, we are error correction of antenna incident signals by optimal weight before digital beamforming method. Thirdly, throughly simulation, we showed that system performance of proposed method compare proposal method with general method. It have improved resolution of estimation target to good performance more proposed method than general method.

ESTIMATION OF SCALE PARAMETER AND P(Y < X) FROM RAYLEIGH DISTRIBUTION

  • Kim, Chan-Soo;Chung, Youn-Shik
    • Journal of the Korean Statistical Society
    • /
    • v.32 no.3
    • /
    • pp.289-298
    • /
    • 2003
  • We consider the estimation problem for the scale parameter of the Rayleigh distribution using weighted balanced loss function (WBLF) which reflects both goodness of fit and precision. Under WBLF, we obtain the optimal estimator which creates a kind of balance between Bayesian and non-Bayesian estimation. We also deal with the estimation of R = P(Y < X) when Y and X are two independent but not identically distributed Rayleigh distribution under squared error loss function.

DETERMINATION OF OPTIMAL ROBUST ESTIMATION IN SELF CALIBRATING BUNDLE ADJUSTMENT (자체검정 번들조정법에 있어서 최적 ROBUST추정법의 결정)

  • 유환희
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.9 no.1
    • /
    • pp.75-82
    • /
    • 1991
  • The objective of this paper is to investigate the optimal Robust estimation and scale estimator that could be used to treat the gross errors in a self calibrating bundle adjustment. In order to test the variability in performance of the different weighting schemes in accurately detecting gross error, five robust estimation methods and three types of scale estimators were used. And also, two difference control point patterns(high density control, sparse density control) and three types of gross errors(4$\sigma o$, 20$\sigma o$, 50$\sigma o$) were used for comparison analysis. As a result, Anscombe's robust estimation produced the best results in accuracy among the robust estimation methods considered. when considering the scale estimator about control point patterns, It can be seen that Type II scale estimator provided the best accuracy in high density control pattern. On the other hand, In the case of sparse density control pattern, Type III scale estimator showed the best results in accuracy. Therefore it is expected to apply to robustified bundle adjustment using the optimal scale estimator which can be used for eliminating the gross error in precise structure analysis.

  • PDF

Adaptive Mesh Refinement and Multigrid FEM by Error Estimation (오차추정에 의한 순응형요소분할과 다단계 유한요소해석)

  • Yang, P.D.C.;Hwang, M.Y.
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.33 no.1
    • /
    • pp.90-97
    • /
    • 1996
  • The optimal mesh refinement has a meaning that error of the every element is within an allowable level and in uniformly distributed. The adaptive mesh generation may be required to achieve the optimal mesh generation. For the purpose of optimal mesh generation, an error estimation and an adaptive mesh refinement are required. Using the adaptive mesh generation the second finite element analysis is performed with the result of the first analysis. In the process the error estimation is required. In this study the adaptive mesh generation program for triangular element is developed, and for a posteriori error estimation the stress projection approach is considered. It has been found the multigrid technique, where the error estimation and the mesh generation are combined in multi-step of analysis, may be used efficiently in the finite element analysis.

  • PDF

RFID Tag Number Estimation and Query Time Optimization Methods (RFID 태그 개수 추정 방법 및 질의 시간 최소화 방안)

  • Woo, Kyung-Moon;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.6
    • /
    • pp.420-427
    • /
    • 2006
  • An RFID system is an important technology that could replace the traditional bar code system changing the paradigm of manufacturing, distribution, and service industry. An RFID reader can recognize several hundred tags in one second. Tag identification is done by tags' random transmission of their IDs in a frame which is assigned by the reader at each round. To minimize tag identification time, optimal frame size should be selected according to the number of tags. This paper presents new query optimization methods in RFID systems. Query optimization consists of tag number estimation problem and frame length determination problem. We propose a simple yet efficient tag estimation method and calculate optimal frame lengths that minimize overall query time. We conducted rigorous performance studies. Performance results show that the new tag number estimation technique is more accurate than previous methods. We also observe that a simple greedy method is as efficient as the optimal method in minimizing the query time.

Fast Motion Estimation Algorithm Using Early Detection of Optimal Candidates with Priority and a Threshold (우선순위와 문턱치를 가지고 최적 후보 조기 검출을 사용하는 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.2
    • /
    • pp.55-60
    • /
    • 2020
  • In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.