• No se han encontrado resultados

Resultados del Modelo de Herrera (2012) para el Año 2015

CAPITULO IV: CONCLUSIONES Y RECOMENDACIONES

Anexo 26. Resultados del Modelo de Herrera (2012) para el Año 2015

When speaking of landmarks in a visual SLAM context, for most of the cases the term itself is used to describe point landmarks, as they are by far the most used. Still, it is worth noting that other types of features exist and have been used successfully.

Though other approaches may use analogous representations for the different elements of the map/state/filter represented, the following section discusses landmark parametrization in the context of visual EKF or equivalent filtering SLAM approaches. This is relevant because the Bayesian nature of the EKF allows using redundant parametrization. As pointed in (Sola et al., 2012), EKF, as a Bayesian estimator, uses an initial prediction to generate the prior distributions that constrains the redundant DoF that would disrupt convergence in other approaches (such as those based on bundle adjustment or other iterative optimizations).

Euclidean points:

An Euclidean point codifies a given position in 3D space with three Cartesian coordinates (see FIGURE 2.10 left). They represent the simplest possible parametrization, as seen in

gimbal lock problem. Moreover, rotation matrices based on quaternion rotations tend to present bilinear relations which simplify Jacobian computations.

3

[ ]T ex y z

p  (2.20)

Even using quaternions, the Euclidean points are unsuitable for bearing-only SLAM systems, as they introduce severe non-linearity on the models, aggravating Abbe’s errors. This has been long reported and known, since (Chiuso et al., 2000).

FIGURE 2.10: Left: Visual representation of the Euclidean coordinates of point p. Right: Geometrical interpretation of the homogeneous coordinates for p.

Homogeneous Points

Homogeneous points are coded by a vector of 4 elements, mapping a projective ℙ3 space. Although this representation is widely known and used in computer vision, it is rather new in the SLAM field, first seen in (Marzorati et al., 2008). This vector is composed of a 3D vector, noted m, and a scalar p, the homogeneous part:

4 [ ]T h x y z p p m m m        p m  . (2.21)

The conversion of a homogeneous point to Euclidean coordinates is straightforward, being

pe = m/p. This means that each pe can be represented by an equivalence class through

proportional transformations of the 4-vector of a homogeneous point (see FIGURE 2.10

right). Different choices for the canonical values can produce several representations

widely known in computer vision: p = 1 is the original Euclidean parametrization; mz = 1 is the inverse-depth; and ||m|| = 1 is the inverse-distance.

As discussed in (Sola et al., 2012), the inverse-distance is isotropic, and if a given point is expressed w.r.t. to a camera sensor, m is the director vector of an optical ray to the point,

and p presents linear dependency with the inverse of the distance between said sensor and the point.

Plücker Coordinates

Plücker lines codify a line in ℙ3 space through 6 parameters, based on the Plücker coordinates introduced by Julius Plücker in the 19th century. Assuming, in a 3-dimensional projective space ℙ3, a line L crossing homogeneous points ah and bh, the Plücker coordinates can be represented as a 6-vector lp  ℙ5. The elements of this 6-vector can be obtained through several ways, though in the context of SLAM (especially bearing-only approaches) the most used representation is that proposed at (Bartoli and Sturm, 2001), shown in equation (2.22): 5 6 T p n n n v v vx y z x y z          n l v   , (2.22)

which represents the corresponding Plücker Matrix Lp:

 

, 3 0 x p T ,          n v L n v v  . (2.23)

The general formula of the Plücker Matrix describes a given line L using two different points in homogeneous coordinates, and this can be used, as seen in equation (2.24), to obtain a 4x4 skew-symmetric matrix subject to the Plücker constraint, that is, the determinant must be zero.

4 4 · T · T p h h h h     L b a a b  (2.24)

So, the representation considered in equation (2.22) allows to define vectors n and v as:

e e ap bp

   

n a b v b a. (2.25)

This representation means that the Plücker constraint is now equivalent to the orthogonality condition nTv = 0, and is conditioned in a way to make it easy to visualize from an Euclidean intuition point of view, as seen in FIGURE 2.11 . Vector n is normal to the plane which passes through the origin of coordinates and contains the line, while v is a director vector for the line, going from a to b. Then, the distance from the origin of coordinates to the line can be computed as ||n||/||v||.

FIGURE 2.11: Visual representation of the Plücker line coordinates. Line defined by points a and b is denoted by the vector v and n in Plücker coordinates, lying on the plane U (shaded in grey).

Unified Inverse Depth Parameterization

In (Civera et al., 2006) a new approach to parametrize point features was introduced. The ‘inverse depth points’ (IDP) method presents a formulation which combines characteristics from the homogeneous points representation and from earlier works on simplified polar coordiantes (Aidala and Hammel, 1983). A given point p is parametrized as pidp according

to equation (2.26): through an anchor p0 = (x0,y0,z0), a director vector m, and a distance to

the point, codified through the inverse of its value, ρ.

0 0 0 0 T idp x y z               p p m (2.26)

To find the Euclidean coordinates of a point under IDP notation, the director vector m must be applied to the inverse of ρ, and translated to the anchor, as illustrated in FIGURE 2.12

seen in equation (2.27):

 

0 1 , e     p p m (2.27) where

 ,

cos sin  sin cos cos 

T

In a visual SLAM context, the anchor p0 is generally set to be the Euclidean coordinates of

the camera optical centre when the point was first parametrized. This allows decoupling the uncertainty of the term multiplying the most uncertain value, the distance to the point (inverse distance in our case). The notation of the distance to the point through its inverse is especially fit for visual approaches: ranges up to near infinite can be codified within a bounded range, and representing the uncertainty with a low range of values also makes the filtering approaches more numerically stable.

FIGURE 2.12: Visual representation of the inverse depth points (IDP) parametrization for a given point p anchored a p0 with director vector m at distance 1/ρ.

Introducing the anchor p0 improves the accuracy of the representation in the long term: the

uncertainty between the camera pose and position p0 is initially low, and while the camera

is near p0 the uncertainty remains low, but as soon as the camera moves from the anchor,

the relative uncertainty grows quickly between camera and anchor. Without this anchor, the isolated position uncertainty would have a big impact in the director vector, m, which would be modified so that it is considered to have origin in the moving camera optical centre.