Projects

State Estimation with Extended Kalman Filter (EKF) and Particle Filter (PF)

The main objective is to estimate an object's 3D position from two cameras using Extended Kalman Filter (EKF) and Particle Filter (PF) with sequential and batch measurement updates. Kalman filter is an approach based on recursice Bayesian filtering where the noise in the system is assumed Gaussian. Extended Kalman filter (EKF) is an extension of KT for non-linear systems where non-linearity are approxiamted using the first or second order derivative. The idea of the particle filter (PF) is based on Monte Carlo methods, which use particle sets to represent probabilities and can be used in any form of state space model. The core concept is to express its distribution by extracting random state particles from the posterior probability. The result was to able to reduced estimated position error by 2.1% and 7.3% respectively by using EKF and PF in batch measurement update than sequential measurement update. In addition, batch update performs better because for each update, it takes more information into consideration or it could be said that all information is incorporated into the filter at once.

EKF & PF problem image unavailable
Problem setup for EKF & PF
EKF & PF results image unavailable
Results of EKF & PF

Point Cloud Processing: Point Cloud Registration Enhancement

The objective is to utilize Point Feature Histogram (PFH) and Iterative Closest Point (ICP) for enhancing point cloud registration. Point clouds are often aligned with 3D models or with other point clouds, a process known as pointset registration. The aim is to find a rigid transformation among these point clouds. Iterative closest point (ICP) is a powerful algorithm employed by a robot to accomplish this kind of tasks by minimize the difference between two clouds of points, often time by reducing the distances of point pairs. However, the drawback of ICP is that it does not take geometric information into account and is sensitive to initial correspondences of the two point clouds. This project solves the problems mentioned above by implementing another algorithm - Point Feature Histogram (PFH), which provides a better solution to registration since it incorporates more informative geometric features when matching the correspondence. To be more specific, the key component in PFH is to estimate surface normal and curvature for a point with its k-nearest neighbor and further formulate associate local features. These features enable us to find more the accuracy during the correspondence calculation process. As for the result, we decreased 22% of total time through extracting key features in a dense point cloud.

2 sets of initial Point Cloud Processing image unavailable
Sets of initial point clouds
Point cloud methods compare image unavailable
Comparison between different methods
2 sets of Point Cloud Processing result image unavailable
Results of point cloud processing