• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.75-86
• /
• 1999

An air-data estimator for generic air-breathing hypersonic vehicles (AHSVs) is developed and demonstrated with an example vehicle configuration. The AHSV air-data estimation strategy emphasized improvement of the angle of attack estimate accuracy to a degree necessitated by the stringent operational requirements of the air-breathing propulsion. the resulting estimation problem involves highly nonlinear diffusion process (propagation); consequently, significant distortion of a posteriori conditional density is suspected. A simulation based statistical analysis tool is developed to characterize the nonlinear diffusion process. The statistical analysis results indicate that the diffusion process preserves the symmetry and unimodality of initial probability density shape state variables, and provide the basis for applicability of an Extended Kalman Filter (EKF). An EKF is designed for the AHSV air-data system and the air data estimation capabilities are demonstrated.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.511-517
• /
• 2012

The best linear unbiased estimator (BLUE) is most suitable for practical application and can be determined with knowledge of only the first and second moments of the probability density function. Although the BLUE is an existing algorithm, it is still largely unexplored and has not yet been applied to channel estimation in amplify and forward (AF)-based wireless relay networks (WRNs). In this paper, a BLUE-based algorithm is proposed to estimate the overall channel impulse response between the source and destination of AF strategy-based WRNs. Theoretical mean square error (MSE) performance for the BLUE is derived to show the accuracy of the proposed channel estimation algorithm. In addition, the Cram$\acute{e}$r-Rao lower bound (CRLB) is derived to validate the MSE performance. The proposed BLUE channel estimation algorithm approaches the CRLB as the length of the training sequence and number of relays increases. Further, the BLUE performs better than the linear minimum MSE estimator due to the minimum variance characteristic exhibited by the BLUE, which happens to be a function of signal-to-noise ratio.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.8
• /
• pp.746-751
• /
• 2006

In this paper, we present tracking algorithm for the indoor moving object. We research passive method using a camera and image processing. It had been researched to use dynamic based estimators, such as Kalman Filter, Extended Kalman Filter and Particle Filter for tracking moving object. These algorithm have a good performance on real-time tracking, but they have a limit. If the shape of object is changed or object is located on complex background, they will fail to track them. This problem will need the complicated image processing algorithm. Finally, a large algorithm is made from integration of dynamic based estimator and image processing algorithm. For eliminating this inefficiency problem, image based estimator, Mean-shift Algorithm is suggested. This algorithm is implemented by color histogram. In other words, it decide coordinate of object's center from using probability density of histogram in image. Although shape is changed, this is not disturbed by complex background and can track object. This paper shows the results in real camera system, and decides 3D coordinate using the data from mean-shift algorithm and relationship of real frame and camera frame.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4
• /
• pp.93-97
• /
• 1996

The Total Least Squares(TLS) method is an unbiased estimator for solving overdetermined sets of linear equations Ax${\simeq}$b when errors occur in all data. However, as well as Least Squares(LS) method it doesn't show robustness while the errors have a heavy tailed probability density function. In this paper we proposed a robust method of TLS (Robust TLS, ROTLS) based on the characteristics of TLS solution. And the ROTLS is verified by applying it to system identification problems.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.947-956
• /
• 1999

We define a crossing point $x_0$ such that f(x)$\geq$g(x) for x$\leq$$x_0$ and f(x)$\leq$g(x) for x>$x_0$ where f and g are probability density functions. We may encounter suchy situation when we compare two histograms from two independent observations. For example two contingency tables where initially admitted students and actually enrolled students are classified according to their high school ranking may show such situation, In this paper we consider maximum likelihood estimation of cell probabilities when a crossing point exists, We first assume a known crossing point and find an estimator. The estimation procedure for the case of unknown crossing point is just a straightforward extension. A real data is analyzed for an illustrative purpose.

• Journal of Korea Water Resources Association
• /
• v.41 no.3
• /
• pp.265-276
• /
• 2008

The observed data of enough period need for design of hydrological works. But, most hydrological data aren't enough. Therefore in this paper, hourly precipitation generated by nonhomogeneous Markov chain model using variable Kernel density function. First, the Kernel estimator is used to estimate the transition probabilities. Second, wet hours are decided by transition probabilities and random numbers. Third, the amount of precipitation of each hours is calculated by the Kernel density function that estimated from observed data. At the results, observed precipitation data and generated precipitation data have similar statistic. Also, rainfall mass curve is derived by calculated transition probabilities for generation of hourly precipitation.

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.429-437
• /
• 2013

Let $X_1$, $X_2$, ${\cdots}$, $X_n$ be independent and identically distributed random variables having common exponential density with unknown mean ${\mu}$. In the sequential confidence interval estimation for the exponential hazard rate ${\theta}=1/{\mu}$, when the loss function is strictly convex, the following stopping rule is proposed with the half length d of prescribed confidence interval $I_n$ for the parameter ${\theta}$; ${\tau}$ = smallest integer n such that $n{\geq}z^2_{{\alpha}/2}\hat{\theta}^2/d^2+2$, where $\hat{\theta}=(n-1)\bar{X}{_n}^{-1}/n$ is the minimum risk estimator for ${\theta}$ and $z_{{\alpha}/2}$ is defined by $P({\mid}Z{\mid}{\leq}{\alpha}/2)=1-{\alpha}({\alpha}{\in}(0,1))$ Z ~ N(0, 1). For the confidence intervals $I_n$ which is required to satisfy $P({\theta}{\in}I_n){\geq}1-{\alpha}$. These estimated intervals $I_{\tau}$ have the asymptotic consistency of the sequential procedure; $$\lim_{d{\rightarrow}0}P({\theta}{\in}I_{\tau})=1-{\alpha}$$, where ${\alpha}{\in}(0,1)$ is given.