Skip to main content

Review of ORB-SLAM: a monocular SLAM system

ORB-SLAM

- Uses

  - Bundle Adjustment
  - ORB features [9]
  - A pose graph
     - Essential graph
     - a spanning tree
       - loop closure links
       - strong edges
       - from covisibility graph

  - covisibliity graph
    - local covisible area
    - tracking and mapping

- mar point and keyframe selection
  - generous spawning
  - restrictive culling
  - identify redundant keyframes
  - improves robustness and lifelong operations


- Stores map points:

  - 3D position X(w,i) in the world coordinate system
  - the viewing direction n(i)
    - the mean unit vector of all its viewing directions
    - the ray that joint the point with the optical center of the keyframe

 - A representative ORB descriptor D(i)
    - the associated ORB descriptor whose hamming distance is minimum
      with respect to all other associated descriptors in the keyframes
      in which the point is observed.

 - the maximum d(max)
 - the minimum d(min) distance
    - at which the point can be observed,
    - according to the scale invariance limits of the ORB features.


- Stores keyframes k(i)

  - The camera pose T (i,w)
   
    - a rigid body transformation
       - that transforms points from the world to the camera coordinate system

   - the camera intrinsics
      - including focal length and principal point

   - all the ORB features extracted in the framee
      - associated or not to a map point,
        whose coordinates are undistorted if a distortion model is provided.



Comments

Popular posts from this blog

How to project a camera plane A to a camera plane B

How to Create a holographic display and camcorder In the last part of the series "How to Create a Holographic Display and Camcorder", I talked about what the interest points, descriptors, and features to find the same object in two photos. In this part of the series, I'll talk about how to extract the depth of the object in two photos by calculating the disparity between the photos. In order to that, we need to construct a triangle mesh between correspondences. To construct a mesh, we will use Delaunnay triagulation.  Delaunnay Triagulation - It minimizes angles of all triangles, while the sigma of triangles is maximized. The reason for the triangulation is to do a piece wise affine transformation for each triangle mapped from a projective plane A to a projective plane B. A projective plane A is of a camera projective view at time t, while a projective plane B is of a camera projective view at time t+1. (or, at t-1.  It really doesn't matter)...

How to use Convolution Neural Network to predict SIFT features

A feature locator is essential in all CV domain.  It's the basis of the germetric transformation, epipolar geometry, to 3D mesh reconstruction. Many techniques - SIFT and other SLAM technologies, are available, but they require ideal environments to work in. To address the short comings: - sensitive to low texture environment - sensitive to low light envonrment - sensitive to high light environment (like outdoor day light with above 20k lux) - and many other issues I propose a CNN based neural network to detect 4 correspondences in an image A and an image B. Since it is tricky to have a neural network to predict a 4x4 affine matrix of rotation and translation, I separated the translation vector from the rotation vector. Basically, the ground truth data will be precalcalated with a generic SIFT with RANSAC to calculate the correspondences set P and P'. The L2 (Eucledean) distance will be used between a predicted value.  They are 4 points, so an averaged will ...

How to improve the traditional ASR using Connectionist Temporal Classification

The traditional Automatic Speech Recognition (ASR) performs at about 85% accuracy rate.  At this rate, ASR users are often frustrated with the experience with using such a system. The tradition ASR is often fragile: 1) requires extensive modification of parameters, just to make it work. 2) requires extensive understanding of a language model and a acoustic model. 3) doesn't scale well to multiple languages. 4) hyper-sensitive to speaker variants. Deep Learning on the acoustic model has been introduced, but not much of gain in the accuracy. What if, we can do a DL from end to end? Connectionist Temporal Classification (2006) introduces an idea of using FFT on the frequency of a recording of a voice command and constructs a spectrogram at 8kHz.  At each spectrogram interval, a DL neural network can be assigned, individually. The basic idea is to have RNN output neurons to encode distribution over "symbols". The traditional ASR uses a phone...