• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1510-1521
• /
• 2001

In this paper a subspace-based blind interference cancellation is proposed and its performance is analyzed. Then the blind adaptive implementation is devolped using the improved natural power method which is the signal subspace tracking algorithm. The theoretical analysis shows that when the exact covariance matrix is kown the performance of the proposed detector is the same as that of the decorrelating detector. And when the covariance matrix is estimated the asymptotic results are examined. The results of computer simulation demonstrate that the proposed detector outperforms the previous blind adaptive RLS MOE detector.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.438-449
• /
• 2005

In this paper, we describes the information-theoretic approaches to sensor selection and sensor placement in sensor net­works for target localization and tracking. We have developed a sensor selection heuristic to activate the most informative candidate sensor for collaborative target localization and tracking. The fusion of the observation by the selected sensor with the prior target location distribution yields nearly the greatest reduction of the entropy of the expected posterior target location distribution. Our sensor selection heuristic is computationally less complex and thus more suitable to sensor networks with moderate computing power than the mutual information sensor selection criteria. We have also developed a method to compute the posterior target location distribution with the minimum entropy that could be achieved by the fusion of observations of the sensor network with a given deployment geometry. We have found that the covariance matrix of the posterior target location distribution with the minimum entropy is consistent with the Cramer-Rao lower bound (CRB) of the target location estimate. Using the minimum entropy of the posterior target location distribution, we have characterized the effect of the sensor placement geometry on the localization accuracy.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.1
• /
• pp.108-114
• /
• 2014

This paper describes a method to set an intensity-based initial validation gate for tracking filter while preserves the ability of tracking a target with maximum speed. First, we collected real data set of signal versus distance of an airplane target. And at each data point, we computed maximum distance the target can move. And a function is modeled to expect the maximum moving pixels on the lateral direction based on the intensity of the detected target in IR image sequence. The initial prediction error covariance can be computed using this function to decide the size of the initial validation gate. The simulation results show the proposed method can set the appropriate initial validation gates to track the targets with the maximum speed.

• Aerospace Engineering and Technology
• /
• v.12 no.2
• /
• pp.40-47
• /
• 2013

GEO-KOMPSAT2 shall be designed to produce higher quality of image than that of COMS, and this requires the ground system to provide orbit data with high accuracy; better than 2km which is sort of high accuracy when it comes to geostationary satellite. For GEO-KOMPSAT2, KARI is planning to use ranging data for orbit determination, obtained from two ranging stations located in KARI and oversea country with long longitudinal baseline. This paper estimated achievable orbit determination accuracy using covariance analysis under assumption of using two ranging stations; SOC and available secondary tracking stations located in oversea countries. In addition to covariance analysis, in order to validate the analysis, the Monte-Carlo simulation has been performed and compared to the covariance analysis.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.107-116
• /
• 2015

In compliance with digital device growth, the proliferation of high-tech computers, the availability of high quality and inexpensive video cameras, the demands for automated video analysis is increasing, especially in field of intelligent monitor system, video compression and robot vision. That is why object tracking of computer vision comes into the spotlight. Tracking is the process of locating a moving object over time using a camera. The consideration of object's scale, rotation and shape deformation is the most important thing in robust object tracking. In this paper, we propose a robust object tracking scheme using Random Forest. Specifically, an object detection scheme based on region covariance and ZNCC(zeros mean normalized cross correlation) is adopted for estimating accurate object location. Next, the detected region will be divided into five regions for random forest-based learning. The five regions are verified by random forest. The verified regions are put into the model pool. Finally, the input model is updated for the object location correction when the region does not contain the object. The experiments shows that the proposed method produces better accurate performance with respect to object location than the existing methods.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.305-308
• /
• 1988

Pole assignment controller with variable forgetting factor is generalizaed to allow the output and/or input variance to be reduced. The algorithm can give significant reductions in variance for little extra computational effort and is presented for servo-tracking using leat-squares estimation. Moreover, the use of a variable forgetting factor with correct choice of information bound can avoid 'blowing-up' of the covariance matrix of the estimates and subsequent unstable control.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.5
• /
• pp.294-300
• /
• 2005

Generally, traditional approaches to track the target position are to estimate ranges and bearings by 2-D MUSIC (MUltiple 519na1 Classification) method. and to associate estimates of 2-D MUSIC made at different time points with the right targets by JPDA (Joint Probabilistic Data Association) filter in the near field. However, the disadvantages of these approaches are that these have the data association Problem in tracking multiple targets. and that these require the heavy computational load in estimating a 2-D range/bearing spectrum. In case multiple targets are adjacent. the tracking performance degrades seriously because the estimate of each target's Position has a large error. In this paper, we proposed a new tracking algorithm using Position innovations extracted from the senor output covariance matrix in the near field. The proposed algorithm is demonstrated by the computer simulations dealing with the tracking of multiple closing and crossing targets.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.2
• /
• pp.109-120
• /
• 2021

This paper proposes the H∞ norm based data association gate method to apply robustly the data association gate of passive sonar automatic target tracking which is on non-linear targets in dense cluttered environment. For target tracking, data association method selects the measurements within validated gate, which means validated measuring extent, as candidates for the data association. If the extent of the validated gate in the data association is not proper or the data association executes under dense cluttered environment, it is difficult to maintain the robustness of target tracking due to interference of clutter measurements. To resolve this problem, this paper proposes a novel gating method which applies H∞ norm based bisection algorithm combined with 3-σ gate method under Gaussian distribution assumption and tracking error covariance. The proposed method leads to alleviate the interference of clutters and to track the non-linear maneuvering target robustly. Through analytic method and simulation to utilize simulated data of horizontal and vertical bearing measurements, improvement of data association robustness is confirmed contrary to the conventional method.

• Journal of Power Electronics
• /
• v.17 no.1
• /
• pp.149-160
• /
• 2017

To improve the performance of sensorless induction motor (IM) drives, an adaptive speed estimation method based on a strong tracking extended Kalman filter with a least-square algorithm (LS-STEKF) for induction motors is proposed in this paper. With this method, a fading factor is introduced into the covariance matrix of the predicted state, which forces the innovation sequence orthogonal to each other and tunes the gain matrix online. In addition, the estimation error is adjusted adaptively and the mutational state is tracked fast. Simultaneously, the fading factor can be continuously self-tuned with the least-square algorithm according to the innovation sequence. The application of the least-square algorithm guarantees that the information in the innovation sequence is extracted as much as possible and as quickly as possible. Therefore, the proposed method improves the model adaptability in terms of actual systems and environmental variations, and reduces the speed estimation error. The correctness and the effectiveness of the proposed method are verified by experimental results.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.1 s.307
• /
• pp.31-38
• /
• 2006

In this paper, we consider one-step-ahead control of waveform parameters (pulse amplitudes and lengths, and FM sweep rate) as well as detection thresholds for optimal range and range-rate tracking in clutter. The optimal control of the combined parameter set minimizes a tracking performance index under a set of parameter constraints. The performance index includes the probability of track loss and a function of estimation error covariances. The track loss probability and the error covariance are predicted using a hybrid conditional average algorithm The effect of the false alarms and clutter interference is taken into account in the prediction. Tracking performance of the one-step-ahead control is presented for several examples and compared with a control strategy heuristically derived from a finite horizon optimization.