• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1E
• /
• pp.25-29
• /
• 2008

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimatesthe signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. In this paper, we propose a new algorithm to improve the subspace estimation accuracy using a normally ordered input vector and a reversely ordered input vector simultaneously.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.514-519
• /
• 2009

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimates the signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. FE-PAST (Forward-Backward PAST) is one of the results from the improvement studies. In this paper, we propose a new algorithm to improve the orthogonality of the FB-PAST (Forward-Backward PAST).

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.408-410
• /
• 2009

We present an efficient and robust measurement model for visual tracking. This approach builds on and extends work on subspace representations of measurement model. Subspace-based tracking algorithms have been introduced to visual tracking literature for a decade and show considerable tracking performance due to its robustness in matching. However the measures used in their measurement models are often restricted to few approaches. We propose a novel measure of object matching using Angle In Feature Space, which aims to improve the discriminability of matching in subspace. Therefore, our tracking algorithm can distinguish target from similar background clutters which often cause erroneous drift by conventional Distance From Feature Space measure. Experiments demonstrate the effectiveness of the proposed tracking algorithm under severe cluttered background.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.7-13
• /
• 2001

In this paper we propose a new subspace tracking algorithm based on the PASTd (Projection Approximation Subspace Tracking with deflation). The algorithm is obtained via introducing the variable forgetting factor which adapts itself to the time-varying subspace environments. The tracking capability of the proposed algorithm is demonstrated by computer simulations in an abruptly changing DOA scenario. The estimation results of the variable forgetting factor PASTd(VFF-PASTd) outperform those of the PASTd in the nonstationary case as well as in the stationary case.

• 전자공학회논문지 IE
• /
• v.48 no.1
• /
• pp.7-15
• /
• 2011

In this paper, we propose a correlation-based subspace estimation technique, which is called square-root forward/backward correlation-based projection approximation subspace tracking(SRFB-COPAST). The SRFB-COPAST utilizes the forward and backward correlation matrix as well as square-root recursive matrix update in projection approximation approach to develop the subspace tracking algorithm. With the projection approximation, the square-root recursive FB-COPAST is presented. The proposed algorithm has the better performance than the recently developed COPAST method.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.216-221
• /
• 2010

In this paper, we propose and develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out a novel mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of projection approximation subspace tracking deflation (PASTd) algorithm, the eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. We apply the new tracking scheme for blind adaptive multiuser detection for non-stationary cellular CDMA environment and use extensive simulation results to demonstrate the performance improvement of the proposed scheme.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.189-192
• /
• 2000

본 논문은 Nonstationary 환경에서 동작하는 소나의 DOA추정의 정확도를 높이기 위하여 가변 망각인자를 도입한 새로운 Extended PASTd (Extended Projection Approximation of Subspace Tracking with deflation) 을 제안하고 기존 알고리즘과 비교함으로써 새로운 알고리즘의 향상된 성능을 보인다.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.1E
• /
• pp.34-37
• /
• 2005

Ryu et al. proposed a multiple target angle-tracking algorithm without a data association problem using angular innovations. This algorithm, however, needs the computational loads in proportion to the square number of sensors regardless of the number of targets, because it uses a nonlinear equation between the signal subspace and angular innovation. In this Paper, we proposed an efficient algorithm for the multiple target angle-tracking using angular innovations. The proposed algorithm extracts the angular innovations from noise subspace. Also, it is demonstrated by computer simulations dealing with the tracking of crossing targets. The simulation results show that the computational loads of the proposed algorithm are $80\%$ and $60\%$ of those of Ryu's algorithm for 3 targets and 6 targets without degrading the performance of the target tracking.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1E
• /
• pp.19-25
• /
• 2003

Ryu et al. recently proposed a multiple target angle-tracking algorithm without a data association problem. This algorithm, however, shows the degraded performance on evasive maneuvering targets, because the estimated signal subspace is d,:graded in the algorithm. In this Paper, we proposed a new algorithm, in which VFF-PASTd (Variable Forgetting Factor PASTd) algorithm is applied to Ryu's algorithm to effectively handle the evasive target tracking with better time-varying signal subspace.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.13-21
• /
• 2006

Ryu et al. proposed a multiple target angle tracking algorithm using the angular measurement obtained from the signal subspace estimated by the output of sensor array. Ryu's algorithm has good features that it has no data association problem and simple structure. But its performance is seriously degraded in the low signal-to-noise ratio, and it uses the angular measurement obtained from the signal subspace of sampling time, even though the signal subspace is continuously updated by the output of sensor array. For improving the tracking performance of Ryu's algorithm, a measurement fusion method is derived based on ML(Maximum Likelihood) in this paper, and it admits us to use the angular measurements obtained form the adjacent signal subspaces as well as the signal subspace of sampling time. The new target angle tracking algorithm is proposed using the derived measurement fusion method. The proposed algorithm has a better tracking performance than that of Ryu's algorithm and it sustains the good features of Ryu's algorithm.