PHD Thesis - Institute for Computer Graphics and Vision - Graz ...
PHD Thesis - Institute for Computer Graphics and Vision - Graz ...
PHD Thesis - Institute for Computer Graphics and Vision - Graz ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
7.1. Map building 111<br />
point l<strong>and</strong>mark. In fact, already a single plane match allows pose estimation while this is<br />
not possible with a single 3D point l<strong>and</strong>mark.<br />
Additional geometric constraints: L<strong>and</strong>marks which are located on one <strong>and</strong> the same 3D<br />
plane are connected by geometric constraints. Plane projective relations are much more<br />
restrictive than general projective relations. A planar homography can be used very efficiently<br />
to verify feature matches geometrically.<br />
Feature reduction: By selecting only l<strong>and</strong>marks located on 3D planes the number of stored<br />
features in the map is reduced significantly. The map uses less memory <strong>and</strong> the computation<br />
time <strong>for</strong> feature matching of course depends on the number of features. It also<br />
increases the robustness <strong>and</strong> reliability. Non-planar features may change in appearance<br />
more significantly than planar features under viewpoint changes. Such l<strong>and</strong>marks are the<br />
reason <strong>for</strong> ambiguities in feature matching, <strong>and</strong> mis-matches will occur more frequently<br />
which cause problems in pose estimation.<br />
Easier matching of planar l<strong>and</strong>marks: State-of-the-art wide-baseline methods assume that<br />
l<strong>and</strong>marks undergo a planar projective trans<strong>for</strong>mation under viewpoint change. Approximating<br />
the projective trans<strong>for</strong>mation by an affine trans<strong>for</strong>mation to create viewpoint<br />
normalized descriptors are the currently most advanced matching methods. L<strong>and</strong>marks<br />
located on 3D corners strongly violate the just mentioned assumption. Such features would<br />
cause troubles <strong>for</strong> matching algorithms <strong>and</strong> should not be stored as l<strong>and</strong>marks in the map.<br />
Increased accuracy: The accuracy of the 3D reconstruction can be increased with plane in<strong>for</strong>mation.<br />
3D point reconstructions are coupled by geometric constraints <strong>and</strong> the 3D<br />
coordinates can be optimized to be arranged exactly as a plane.<br />
In the following a batch method <strong>for</strong> map building is presented. Input <strong>for</strong> the method is an<br />
image sequence acquired from a mobile robot equipped with a single perspective camera. The<br />
camera needs to be calibrated be<strong>for</strong>eh<strong>and</strong>. Structure-from-motion algorithms <strong>and</strong> wide-baseline<br />
stereo methods are applied to build the piece-wise planar world representation. The created<br />
map can then be used <strong>for</strong> purely vision based global localization. A mobile robot equipped with<br />
a single perspective camera can estimate its pose in respect to the world map from a single<br />
camera image.<br />
The localization approach to be presented is in analogy to [56] as it computes the robot<br />
pose from 3D-2D point correspondences. The novelty is the use of small planar patches as<br />
3D l<strong>and</strong>marks <strong>and</strong> that the pose can be computed from a single l<strong>and</strong>mark correspondence.<br />
This allows to do localization under extreme conditions, where other methods which require<br />
usually a high number of correspondences would normally fail. The novel localization approach<br />
is presented in the second part of this chapter.<br />
7.1 Map building<br />
The world is represented as a network of linked metric sub-maps (see Figure 7.1 <strong>for</strong> illustration).<br />
Each sub-map has its own local coordinate system <strong>and</strong> each link between two sub-maps<br />
represents a rigid trans<strong>for</strong>mation (containing rotation, translation <strong>and</strong> scaling) connecting both<br />
local coordinate system. Thus it is possible to express a position within a specific sub-map<br />
from each local coordinate system. Furthermore each sub-map contains the trans<strong>for</strong>mation into