1. 2009. 3. 25 (Wed) Young Ki Baik Computer Vision Lab.

2. References   Inverse Depth parameterization for Monocular SLAM J. Civera, A. J. Davison, J. M. M. Montiel (IEEE Trans. On Robotics 2008)   Inverse Depth to Depth Convsrsion for Monocualr SLAM J. Civera, A. J. Davison, J. M. M. Montiel (ICRA 2007)   Unified Inverse Depth Parameterization for Monocular SLAM J. M. M. Montiel, J. Civera, A. J. Davison (RSS 2006) Computer Vision Lab.

3. Outline   What is SLAM?   What is Visual SLAM?   Overall process of SLAM   An issue of the Map   Inverse depth parameterization   Conclusion Computer Vision Lab.

4. What is SLAM?   SLAM : Simultaneous Localization and Mapping is a technique used by robots and autonomous vehicles to build up a map within an unknown environment while at the same time keeping track of their current position. Where am I ? Map building Observation Computer Vision Lab.

5. What is SLAM?   SLAM : Simultaneous Localization and Mapping basically uses some statistical techniques based on recursive Bayesian estimation such as Kalman filters and particle filters (aka. Monte Carlo methods). ^$#!@&%? Computer Vision Lab.

6. What is Visual SLAM?   SLAM : Simultaneous Localization and Mapping can use many different types of sensor to acquire observation data used in building the map such as laser rangefinders, sonar sensors and cameras. Visual SLAM - is to use cameras as a sensor. Computer Vision Lab.

7. Why Visual SLAM?  Vision data can inform us more meaningful information (such as color, texture, shape…) relative to other sensors. Computer Vision Lab.

8. Overall process of Visual SLAM Map management Map management Measurement Initialization Prediction Update Computer Vision Lab.

9. Visual SLAM DEMO Mono-slam Computer Vision Lab.

10. Problems   Proposal   Data association   Filter   Map management   Real-time Computer Vision Lab.

11. What is the map of visual SLAM?  Map (Landmarks:LM) L i = (y i, Y i ) T + Patch y : 3D position of LM Y : 3x3 covariance matrix of LM  Robot (or Camera) r : 3D position C = (r, q) T q : 3D orientation Computer Vision Lab.

12.   Robot and maps What is the map of visual SLAM? Computer Vision Lab. C 6D = (r, q) T L 2 = (y 2, Y 2 ) T L 1 = (y 1, Y 1 ) T

13.   Binocular camera case 3D landmarks are directly reconstructed from stereo images since binocular camera retains parallax. How can we obtain initial LM info.? Computer Vision Lab. C 6D = (r, q) T L = (y, Y) T Parallax : The measured angle between the captured rays from different view points

14.   Monocular camera case Is it possible that 3D landmarks are directly reconstructed by monocular camera? How can we obtain initial LM info.? Computer Vision Lab. C 6D = (r, q) T L = (y, Y) T ?

15. How can we obtain initial LM info.?   Delayed Initialization of LM location A batch update [Dean 2000, Bailey 2003] Computer Vision Lab. - Large base line will assure high parallax !!! - We can’t always expect large base line !!! → Problem is distance from camera to LM.

16. How can we obtain initial LM info.?   Delayed Initialization of LM location Gaussian Sum Filter [Kwok 2005, Sola 2005] Computer Vision Lab. - Initializing predefined multiple hypothesis at various depths !!! -Pruning those not re-observed in subsequent images !!! → It can cover the predefined depth only. → can not cover the distant depth. → can not cover low parallax cases.

17. How can we obtain initial LM info.?   Undelayed Initialization of LM Inverse Depth Parameterization [Montiel 2006~2008] Computer Vision Lab. - Initializing a ray !!! - Updating uncertainty by inverse depth coding !!! → It can cover the infinity depth.

18. How can we obtain initial LM info.?   Undelayed Initialization of LM Inverse Depth Parameterization [Montiel 2006~2008] Contribution Computer Vision Lab. * Initializing LM immidiately !!! * Covering the infinity depth of LM !!! * Covering the Low parallax case !!!

19. Inverse Depth Parameterization   Overview Computer Vision Lab. W r wc C 6D = (r wc, q wc ) T C L XYZ = (X, Y, Z) T = (x,y,z) T + 1/ ρ*m(θ,ф) (x,y,z) T m 1/ ρ = d α

20. Inverse Depth Parameterization   Definition (Point parameterization) X-Y-Z Point Parameterization Inverse Depth Point Parameterization Computer Vision Lab. L IDP = (x, y, z, θ, ф, ρ) T L XYZ = (X, Y, Z) T = (x,y,z) T + 1/ ρ*m(θ, ф) m( cosфsinθ, -sinф, cosфsinθ)

21. Inverse Depth Parameterization   Definition (Measurement Equation) X-Y-Z system Inverse Depth system Computer Vision Lab. L XYZ = (X, Y, Z) T = (x, y, z) T + 1/ ρ*m(θ, ф) h C = h XYZ = R cw [ (X, Y, Z) T – r wc ] h C = h ρ = R cw [ ρ ( ( x, y, z ) T – r wc ) + m(θ, ф) ] It can be safely used even for points at infinity ( ρ=0 ) !!! (u, v) T = (u 0 – f x h x C / h z C, v 0 - f y h y C / h z C )

22. Inverse Depth Parameterization   Initialization of LM using IDP Computer Vision Lab. L IDP = (x, y, z, θ, ф, ρ) T C = (r, q) T L IDP = (r, θ, ф, ρ) T

23. Inverse Depth Parameterization   Initialization of LM using IDP Computer Vision Lab. L IDP = (x, y, z, θ, ф, ρ) T L IDP = (r, θ, ф, ρ) T (u’, v’, 1) T C = (r, q) T H w = R wc (u’, v’, 1) T θ = arctan (h x w, h z w ) T ф = arctan ( -h y w, sqrt(h x w ^2 +h z w^2 ) ) T ρ = 0.1 (or arbitrary constant value)

24. Inverse Depth Parameterization   Initialization of LM using IDP Updating state covariance matrix Computer Vision Lab. State covariance Measurement covariance Inverse depth variance

25. Inverse Depth Parameterization   Switching from Inverse depth to XYZ Computer Vision Lab. L IDP P IDP L XYZ P XYZ L = (X, Y, Z) T = (x,y,z) T + 1/ ρ*m(θ,ф)

26. Inverse Depth Parameterization   Demo Monocular SLAM based on EKF Computer Vision Lab.

27. Inverse Depth Parameterization   Demo Monocular SLAM based on PF with OIF Computer Vision Lab.

28. Conclusion   Pros. IDP is robust for monocular SLAM. Non-delayed LM initialization Processing for any point in the scene, close or distant, or even at “infinity” Dealing simultaneously with low and high parallax case   Cons. IDP requires 6-D state vector → This doubles the map state vector size Computer Vision Lab.

29. Q&AQ&A