MSER & CNN Home Number Recognition

---

The intent of this project was to be able to detect house numbers and return the digits present in the image in the correct sequence. For more information, see the dedicated page for this project.

The intent of this project was to be able to track an object in an image given nothing but a template to start.

A particle filter is used to detect small changes in size and location of the objet being tracked. 

The template is updated each step so that changes in object apperance can be accommodated. There is a parameter to determine how much of the original template is retained, and another to determine how quickly the template is allowed to change.

 A Kalman filter is also used to help the tracking algorithm with occlusions. 

This project used a Particle Filter to track an object moving counterclockwise in a 2D solar system with a central sun and occasional planets. The goal was to estimate its trajectory despite noisy observations and motion uncertainties.

The system simulated the object's orbit, influenced by gravity and planetary perturbations. The Particle Filter maintained a set of weighted particles representing possible states, evolving through prediction, update, and resampling.

Particles moved based on an orbital motion model, with weights adjusted using noisy position observations. Higher-likelihood particles were duplicated, while less likely ones were removed, ensuring accurate tracking. The filter adapted to sporadic measurements and disturbances, effectively handling non-linear motion and uncertainty better than traditional methods.

 The system used Simultaneous Localization and Mapping (SLAM), where the drone moved through a forested area, continuously measuring distances to trees. The Graph SLAM approach represented the environment as a graph, with nodes corresponding to drone poses and landmarks (trees), while edges encoded constraints based on sensor observations and motion estimates. 

As the drone moved, new position estimates were added to the graph, and loop closures were used to correct drift by recognizing previously visited locations. An optimization process refined the graph structure, minimizing errors in both drone trajectory and tree positions. 

 This project implements the A* search algorithm  in a finite 2D space.

The A* search process involves expanding nodes based on a cost function that combined the actual movement cost and a heuristic estimate of the remaining distance. The algorithm prioritizes paths with the lowest estimated total cost, ensuring an efficient and collision-free route. If an obstacle was encountered, the algorithm adjusted the plan, recalculating a new optimal path to reach the destination.