13.08.2018 Views

[Studies in Computational Intelligence 481] Artur Babiarz, Robert Bieda, Karol Jędrasiak, Aleksander Nawrat (auth.), Aleksander Nawrat, Zygmunt Kuś (eds.) - Vision Based Systemsfor UAV Applications (2013, Sprin

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>Vision</strong> System for Group of Mobile Robots 147<br />

2.5 Adaptation of Reference Histograms<br />

The need for cont<strong>in</strong>uous adaptation of reference histograms def<strong>in</strong><strong>in</strong>g the classes of<br />

objects comes from the unavoidable nonl<strong>in</strong>ear shift of colors of pixels belong<strong>in</strong>g<br />

to every object, which occurs as the object is mov<strong>in</strong>g around the play<strong>in</strong>g field. The<br />

object has different color <strong>in</strong> different po<strong>in</strong>ts on play<strong>in</strong>g field ma<strong>in</strong>ly because of the<br />

non-uniform light<strong>in</strong>g provided by four lamps <strong>in</strong>stalled over the play<strong>in</strong>g field. This<br />

phenomenon is <strong>in</strong> turn a cause of unpredictable changes <strong>in</strong> the object’s histogram<br />

which can lead to recognition errors.<br />

Fortunately this undesired effect can be compensated by simple mov<strong>in</strong>g average<br />

algorithm which, after successful recognition, updates the reference histogram<br />

with the histogram of an object recognized as belong<strong>in</strong>g to the class def<strong>in</strong>ed by<br />

this reference histogram. The formula for histogram update is as follows:<br />

<br />

<br />

1 <br />

(9)<br />

where is a set of all possible pixel values , is a normalized reference histogram<br />

be<strong>in</strong>g updated and is a normalized <strong>in</strong>put histogram. And as above,<br />

<strong>in</strong>dexes and 1 denote previous and current frame, respectively. For the<br />

objects on play<strong>in</strong>g field are able to move really fast (up to 1 ), the learn<strong>in</strong>g<br />

factor is quite large here and is equal to 0.2. It is important to notice that histogram<br />

obta<strong>in</strong>ed by mov<strong>in</strong>g average algorithm from two normalized histograms<br />

rema<strong>in</strong>s normalized as well. The proof is easy and is presented below.<br />

First, the formula for calculat<strong>in</strong>g sum of b<strong>in</strong>s <strong>in</strong> a histogram created from two<br />

normalized histograms accord<strong>in</strong>g to the mov<strong>in</strong>g average algorithm:<br />

<br />

<br />

1 <br />

<br />

<br />

<br />

Restructur<strong>in</strong>g right-hand side yields<br />

<br />

<br />

<br />

<br />

1 <br />

<br />

Factors and 1 can be taken outside summ<strong>in</strong>g operator yield<strong>in</strong>g<br />

<br />

(10)<br />

(11)<br />

<br />

<br />

<br />

<br />

<br />

1 <br />

<br />

S<strong>in</strong>ce right-hand side histograms are normalized (sum of b<strong>in</strong>s <strong>in</strong> each histogram<br />

is equal to 1)<br />

<br />

<br />

<br />

<br />

(12)<br />

1 (13)<br />

<br />

1 (14)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!