• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.5
• /
• pp.315-324
• /
• 2023

In this paper, we propose a real-time pose estimation method for a monocular camera using a particle filter integrated with UKF (unscented Kalman filter). While conventional camera tracking techniques combine camera images with data from additional devices such as gyroscopes and accelerometers, the proposed method aims to use only two-dimensional visual information from the camera without additional sensors. This leads to a significant simplification in the hardware configuration. The proposed approach is based on a particle filter integrated with UKF. The pose of the camera is estimated using UKF, which is defined individually for each particle. Statistics regarding the camera state are derived from all particles of the particle filter, from which the real-time camera pose information is computed. The proposed method demonstrates robust tracking, even in the case of rapid camera shakes and severe scene occlusions. The experiments show that our method remains robust even when most of the feature points in the image are obscured. In addition, we verify that when the number of particles is 35, the processing time per frame is approximately 25ms, which confirms that there are no issues with real-time processing.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.735-746
• /
• 1999

We design the robust and inherently fault tolerant decetralized$$H^infty$$ filter for the multisensor state estimation problem when there are insufficient priori informations on the statistical properties of external disturbances. For developing the proposed algorithm, an alternative form of suboptimal$$H^infty$$ filter equations are formulated by applying an alternative form of Kalman filter equations to the indefinite inner product space state model of suboptimal$$H^infty$$ filtering problems. The decentralized$$H^infty$$ filter that consists of local and central fusion filters can be designed effciently using the proposed alternative$$H^infty$$ filiter gain equations. The proposed decentralized$$H^infty$$ filter is robust against un-known external disturbances since it bounds the maximum energy gain from the external disturbances to the estimation errors under the prescribed level$$r^2$$ in both local and central fusion filters and is also fault tolerant due to its inherent redundancy. In addition, the central fusion equations between the global and local data can reduce the unnecessary calculation burden effectively. Computer simulations are made to ceritfy the robustness and fault tolerance of the proposed algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.8
• /
• pp.385-392
• /
• 2016

Market analysis for a business plain is required for the success in the modern world. Most important part in this analysis is pedestrian traffic counting. A traditional way for this is counting it in person. However, it causes high labor costs and mistakes. This paper proposes an automatic algorithm to measure the pedestrian traffic count using images with webcam. The proposed algorithm is composed of two parts: pedestrian area detection and movement tracking. In pedestrian area detection, moving blobs are extracted and pedestrian areas are detected using HoG features and Adaboost algorithm. In movement tracking, multi-level matching and false positive removal are applied to track pedestrian areas and count the pedestrian traffic. Multi-level matching is composed of 3 steps: (1) the similarity calculation between HoG area, (2) the similarity calculation of the estimated position with Kalman filtering, and (3) the similarity calculation of moving blobs in the pedestrian area detection. False positive removal is to remove invalid pedestrian area. To analyze the performance of the proposed algorithm, a comparison is performed with the previous human area detection and tracking algorithm. The proposed algorithm achieves 83.6% accuracy in the pedestrian traffic counting, which is better than the previous algorithm over 11%.