Git Product home page Git Product logo

sfnd_2d_tracking's Introduction

SFND 2D Feature Tracking

The idea of the camera course is to build a collision detection system - that's the overall goal for the Final Project. As a preparation for this, you will now build the feature tracking part and test various detector / descriptor combinations to see which ones perform best. This mid-term project consists of four parts:

  • First, you will focus on loading images, setting up data structures and putting everything into a ring buffer to optimize memory load.
  • Then, you will integrate several keypoint detectors such as HARRIS, FAST, BRISK and SIFT and compare them with regard to number of keypoints and speed.
  • In the next part, you will then focus on descriptor extraction and matching using brute force and also the FLANN approach we discussed in the previous lesson.
  • In the last part, once the code framework is complete, you will test the various algorithms in different combinations and compare them with regard to some performance measures.

See the classroom instruction and code comments for more details on each of these parts. Once you are finished with this project, the keypoint matching part will be set up and you can proceed to the next lesson, where the focus is on integrating Lidar points and on object detection using deep-learning.

Dependencies for Running Locally

Basic Build Instructions

  1. Clone this repo.
  2. Make a build directory in the top level directory: mkdir build && cd build
  3. Compile: cmake .. && make
  4. Run it: ./2D_feature_tracking.

Performance Evaluation

MP6

  • For Perforamnce Stats look at the folder data/ it's in the data.csv file
  • For images look at the folder data/images
  • knn matching was used with k=2 as the selectorType and the matcher type was set to MAT_BF

MP7

Both total points and points within the ROI were counted for each detector type

  • The most matching points were found with :
  1. FAST (approx. 400 per image pair)
  2. BRISK (254-297 per image pair)
  • The fewest matching points were found with :
  1. HARRIS (always less than 100 per image pair)
  2. ORB and SHITOMASI (both were around the 100-130 range for an image pair)

MP9

  • FAST was mostly the fastest detector (about 1-2 ms) while also producing the most matches
  • the descriptors BRIEF (1ms), ORB (1ms) and SIFT(about 10-11 ms) all performed pretty well and all offer real time Performance when combined with FAST
  • Therefore the first 3 options therfore are BRIEF, ORB and SIFT descriptors combined with a FAST detector
  • SIFT however should be avoided for a commercial application if possible due to the patent that goes along with it, this does not pose a problem in the project though

Good to know

sfnd_2d_tracking's People

Watchers

James Cloos avatar Cedric Perauer avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.