[ieee 2012 2nd international conference "methods and systems of navigation and motion...

3
2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC), October 9-12, Kiev, Ukraine pp.56-58 Visual SLAM Algorithm Using Correlation Extremal Principle Mana Mukhina Aviation Computer-Integrated Complexes Department National Aviation University Kiev, Ukraine m [email protected] Abstract -Visual information features for SLAM algorithm are considered. The problem of navigation for continuous observation of the ground surface is stated. The algorithm of correlation search and coordinates estimation is proposed based on Kalman filtering. Keywords - simultaneous localization and mapping (SM). statistical correlation. Kalman filter I. INTRODUCTION SLAM is based on the processing of navigation information in the fonn of random nctions. The coelation between the realization of random nctions (geophysical fields) is used to find the coordinates of the object as the exemum of coelation nction or of any other statistical estimate of random nction realizations. The conol of object motion is performed as the determination of its location as the comparison between the disibution of template and current geophysical fields. The cuent field is perceived by sensor of navigational information, e.g. radiolocation image of surface, laser range image, etc. The template field is measured beforehand and presented in the fonn of map with specified accuracy. It must be mentioned here that the template map may be absent and will be fonned and adjusted simultaneously with motion start. Since the disibutions of current and mapped fields along the prescribed route are random processes the degree of their matching can be detennined by the quantity of coelation nction [1]. The maximum of this nction proves that the cuent realization of the field coincides with the definite region of the field map whose coordinates are known. The structure of SLAM systems has defmite features. The first is that the object captures and stores the features of environment (landmarks) and in this way decreases the uncertainty of the map. The greater the number of detected landmarks is, the less the uncertainty of the map will be. With the recuent scanning of already detected landmarks the uncertainty will be rther decreased. If there are some unknown reference points object puts them on the map with typical uncertainty that is very high. But uncertainty will decrease because of correlation between object and reference points when rescanning of all reference points is presented. 978-1-4673-2554-7/12/$31.00 © 2012 IEEE Another feature of SLAM problems is map difficulties. Considerable quantity of correlations can lead to increasing of calculating complication of navigation problems. To save all possible correlation links calculation of O(n3) and O(n2) links should be done, where n is a number of nctions. So, for solving SLAM problems it's important to create an efficient map of geophysical field, that will content typical features of environment, that are necessary for object positioning. For solving SLAM problems it is important to check authenticity of the map, that lead by "loop close", i.e. retuing of object to initial point. If map is compiled coectly, the object will be able to define initial point on the map and retu to it with the minimal difference comparing with observing reference points. II. RELATED WORKS Reduction of calculating complication that appears during processing and map updating in the common case is possible by providing the map in the fonn o - set of the most informative areas; - set of typical features (reference points); - coded (brie image. Information of geophysical field in the common case can be given in the form of double-dimension matrix with the values of the third coordinate, for example height. The main point of proposed methods consisting in reduction of all available information about geophysical fields to common presentation in the fonn of iple-dimension matrix of image, and the methods of coelation searching of matches are developed for that [2; 3]. In case of optical (visual) field different variations of standard map are used in the form o set of contours; disibution of field intensity (histogram); set of typical features (for example, coefficients of wavelet transform).

Upload: maryna

Post on 14-Mar-2017

213 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: [IEEE 2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC) - Kiev, Ukraine (2012.10.9-2012.10.12)] 2012 2nd International Conference "Methods

2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC), October 9-12, Kiev, Ukraine pp.56-58

Visual SLAM Algorithm Using Correlation Extremal Principle

Maryna Mukhina Aviation Computer-Integrated Complexes Department

National Aviation University Kiev, Ukraine

m [email protected]

Abstract - Visual information features for SLAM algorithm are considered. The problem of navigation for continuous observation of the ground surface is stated. The algorithm of correlation search and coordinates estimation is proposed based on Kalman filtering.

Keywords - simultaneous localization and mapping (SLAM). statistical correlation. Kalman filter

I. INTRODUCTION

SLAM is based on the processing of navigation information in the fonn of random functions. The correlation between the realization of random functions (geophysical fields) is used to find the coordinates of the object as the extremum of correlation function or of any other statistical estimate of random function realizations. The control of object motion is performed as the determination of its location as the comparison between the distribution of template and current geophysical fields. The current field is perceived by sensor of navigational information, e.g. radiolocation image of surface, laser range image, etc. The template field is measured beforehand and presented in the fonn of map with specified accuracy. It must be mentioned here that the template map may be absent and will be fonned and adjusted simultaneously with motion start.

Since the distributions of current and mapped fields along the prescribed route are random processes the degree of their matching can be detennined by the quantity of correlation function [1]. The maximum of this function proves that the current realization of the field coincides with the definite region of the field map whose coordinates are known.

The structure of SLAM systems has defmite features. The first is that the object captures and stores the features of environment (landmarks) and in this way decreases the uncertainty of the map. The greater the number of detected landmarks is, the less the uncertainty of the map will be. With the recurrent scanning of already detected landmarks the uncertainty will be further decreased.

If there are some unknown reference points object puts them on the map with typical uncertainty that is very high. But uncertainty will decrease because of correlation between object and reference points when rescanning of all reference points is presented.

978-1-4673-2554-7/12/$31.00 © 2012 IEEE

Another feature of SLAM problems is map difficulties. Considerable quantity of correlations can lead to increasing of calculating complication of navigation problems. To save all possible correlation links calculation of O(n3) and O(n2) links should be done, where n is a number of functions.

So, for solving SLAM problems it's important to create an efficient map of geophysical field, that will content typical features of environment, that are necessary for object positioning.

For solving SLAM problems it is important to check authenticity of the map, that lead by "loop close", i.e. returning of object to initial point. If map is compiled correctly, the object will be able to define initial point on the map and return to it with the minimal difference comparing with observing reference points.

II. RELATED WORKS

Reduction of calculating complication that appears

during processing and map updating in the common case is

possible by providing the map in the fonn of: • - set of the most informative areas;

• - set of typical features (reference points);

• - coded (brief) image.

Information of geophysical field in the common case

can be given in the form of double-dimension matrix with the values of the third coordinate, for example height.

The main point of proposed methods consisting in

reduction of all available information about geophysical fields to common presentation in the fonn of triple-dimension matrix

of image, and the methods of correlation searching of matches

are developed for that [2; 3].

In case of optical (visual) field different variations of

standard map are used in the form of: • set of contours;

• distribution of field intensity (histogram);

• set of typical features (for example, coefficients of wavelet transform).

Page 2: [IEEE 2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC) - Kiev, Ukraine (2012.10.9-2012.10.12)] 2012 2nd International Conference "Methods

M. Mukhina

III. CORRELATION EXTREMAL PRINCIPLE

A. Problem statement The working information is the image (frame) of the

surface field. Let's denote the observing field as .lex, y), assuming that Oxy is a horizontal rectangular coordinate system. Observation vector is given as a set of discrete measured values of the field Z; (i = 1, 2, ... ,)(Fig. I).

!I Yo 1\"

�I� I Nil

r--A 7 "il

I ..... \.z

pf-:r;-�

........ -

z,

� 1.1 '-1 XA �

Figure I. Map of geophysical field

Let's suppose, that longitudinal axis Xo moves relatively axis x. If we had no heading error, so

where XII' YII are coordinates of the point on the land surface, where the sensor axis of the surface field is directed (as we can have deviation Ll�x, Ll�y axes sensor field from vertical).

So coordinates xI!' YI! can differ from coordinates xo, Yo) ; L" Ly are rear distances (scale) between elements of the image;

NL,x(2M + I)Ly are the image size (frame); in general case

let's consider the frame as asymmetrical

[N=N'+N"+I,N';tN", q=N(2M+1)] , 11; is errors of

measurement of the field by field sensor in i point:

Image elements is numbered is such way, that the first is considered to be the upper left element. Now if we consider constant heading error \jf (inconsistency between axis Xo i x), which appears due to that, on the board of moving object rate is never known for sure, the equation for observing quantities of the field is:

Zi = f\ x, +( -N -1 +i - N ] �[)Lx cos Y +( -M + ] �[)Ly sin Y,

YA + ( -N -1 +i - N ]�[J L, sin 'P + ( -M + ]�[J Ly cos 'P) +

+l1\X, +( -N -1 +i - N ] �[JLx cos � +( -M + ] �[JLy sin�, y, + (-N- I+ i- N ]�[JLx sin� + (-M + ]�[JLvCOS�)

(i = 1,2, ... ,q). Scale image Lx i Ly is constant in time, but unknown on the

moving object. As, in case of using the optical images on UA V this uncertainty determines inaccurate data of altitude and angles Ll�x, Ll�y deviation sensors axis field from vertical. In case of using the radar images of region and making sweep on horizontal range (as usual is necessary) the need of scale is also explained by inaccurate data of height of the flight.

B. One-dimensional SLAM Let's consider one dimension SLAM for uniform motion of

the moving object (and a field sensor on it) along x axes :

Equation of motion in scalar form is the following:

x = V V = 0 i = 0 ,if = O. Jl x' x ' y , 't'

Let's assume that the state vector is:

X =[Xl Xz X3 X4 XS]T,

where Xl = Xi!' X2 = VX, X3 = Lx, X4 = Lv, Xs = \jf, so the equation of motion is :

X+AX=O. Matrix A will be:

0 -1 0 0 0 0 0 0 0 0

A= 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Let's also use vector representation for the noise vector 10 = [EJ, Ez, ... , Eq]

T. As the heading error is small, we can make the linearization by \jf and then the projection of vector heX) will take the form:

= (-N' -I +i -N]i/ NDx4XS + (M-]i/ NDxJ

Let's assume that the matrix of spectral densities of noises is diagonal:

where SJ, ... , Sq are values of spectral densities of errors in different points at the frame at zero frequency.

2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC ) , October 9-12, Kiev, Ukraine 57

Page 3: [IEEE 2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC) - Kiev, Ukraine (2012.10.9-2012.10.12)] 2012 2nd International Conference "Methods

Visual SLAM Algorithm Using Correlation Extremal Principle

Let's suppose that the measurements are done with the same accuracy (SI = S2 =. . . = Sq = So), then Sz = So *1, where I is a unit matrix of the size qxq:

o

R" =

o

2 2 2 where (j Xo ' (j vXo ' (jljlo are variances of initial errors of

estimation in position, speed and heading of UA V,

respectively; (j� ,(j� are variances of initial relative errors of 1\,..0 1""0

estimation in scale Lx, Ly. Initial value of inverse matrix will be equal to

o

o

C. Kalman estimation The algorithm of estimation will be based on Kalman

filtering:

X+AX = kg, [z-h(X)]; k =R(�YS-l. g, ax) z '

t-LA-ATL=( a� y S-l ( a� I; ax) z ax) L=R-1•

With the calculation and plotting the graphs (Fig.2) to reach the required accuracy of SLAM we will use the equation of one-dimensional cross of correlation function for the geophysical field{(x, y):

Rf(Li) = a� exp( _a2 Li2),

where (j} is the variance of the field! (x, y).

10

5

2

0, 5

0,

O,lL-_I.--L--L_:'---'----'-_-'--'----'----'l:-:--

Figure 2. Estimation of errors of UA V coordinates by SLAM

The correlation radius p of the filed can be determined by

the relationship r

fRf(Li)dLi o

RI(O) And equals

p=Jic/(2a). The correlation function Rto.f(Li) of the gradient of

initial field is connected with Rj(Li) by the following

equation:

Thus,

Rj(Li) = 2a2a}(l- 2a2 Li2)exp( _a2 Li2)

From this the variance (j! of the gradient of the used field

becomes:

2 n a� a =--'"

to. 4 p

2

The main source of error is the error of field sensor used during the primal mapping. This error is the function of the spatial coordinate:

where Vx is the speed of motion, PrJ is the correlation radius of the field sensor error.

The behavior of the curve alt) is explained as following. During the first 5 seconds the initial error of positioning is decreased significantly due to the use of primal information from map. Then during 95 seconds the error ait) is also decreased but less rapidly and finally the further decreasing of error is done only due to the increasing of equivalent area of the frame with the object motion.

The improvement of estimation of object speed is absent for the beginning because such information is absent in initial data. And only with further estimation we see decreasing of error in speed ait).

REFERENCES

[1] EaKJIIIUKIIH B. K., A. H. IOpbeB, KOppeJllIUIIOHHO-3KCTpeMaJIbHble MeTO)l,bI HaBllfaUIIII- M.: Pa)l,lIo II CBl!3b,1982 -256 c.

[2] EeJlOfJla30B 11. H, B. n. TapaceHKo, KOppeJlllUHOHHo-3KcrpeMaJIbHble CHCTeMbl - M.: COB. pa,[lHO, 19 74 - 392 c.

[ 3] H. Jacky Chang, George Lee, Yung-Hsiang Lu, Y. Charlie Hu, "P­SLAM: Simultaneous Localization and Mapping With Environmental­Structure Prediction" IEEE transactions on robotics. Vol. 23., No.2. -Apri12007 ..

58 2012 2nd International Conference "Methods and Systems of Navigation and Motion Control" (MSNMC ) , October 9-12, Kiev, Ukraine