Road detection via entropy By Anna Zaidman 1 1 What is entropy? - - PowerPoint PPT Presentation

road detection via entropy
SMART_READER_LITE
LIVE PREVIEW

Road detection via entropy By Anna Zaidman 1 1 What is entropy? - - PowerPoint PPT Presentation

Road detection via entropy By Anna Zaidman 1 1 What is entropy? Entropy is a mathematically - defined thermodynamic quantity that helps to account for the flow of energy through a thermodynamic process. 2 What is


slide-1
SLIDE 1

1

By Anna Zaidman

Road detection via entropy

1

slide-2
SLIDE 2

What is entropy?

Entropy is a mathematically - defined thermodynamic quantity that helps to account for the flow of energy through a thermodynamic process.

2

slide-3
SLIDE 3

What is entropy?

As a mathematical function, entropy is used to measure the level of “disorder” within a certain sample of values, a certain entropy value is assigned to a pixel by measuring entropy of a sample of pixel values present in a given “window” around that pixel. Smooth and visually “uniform” parts of the image thus have low or very low entropy (no matter what are the real pixel values - “color”), while areas with higher diversity of pixel values, especially with sudden shifts in image color – gain higher entropy values.

slide-4
SLIDE 4

What is entropy?

If we assume that the road to follow has a consistent color or texture, we can state that the neighborhoods of pixels forming that road have lower diversification than a neighborhood of pixels forming people, trees, cars, traffic signs, and so on, which might be composed of different levels

  • f illumination, textures, patterns and edges.

Lack of diversity means also, lack of information, when the opposite implies lot of information.

4

slide-5
SLIDE 5

My goal is to detect a drivable road using an adaptive entropy filter .

slide-6
SLIDE 6

How to create an entropy filter?

Let's define the entropy H of an image I, as the amount of information that exists over a statistically distributed set of pixels 𝑕, over a window w, where for each grayscale level i its probability of appearance is 𝒒(𝒉𝒋) , as shown in equation (1). The probability of a graylevel i is calculated according to the histogram of the image as shown in equation (2). (1) 𝐼(𝑕) = − 𝑞 𝑕𝑗 𝑚𝑝𝑕 (𝑞 𝑕𝑗 )

𝑥

(2 ) 𝑞 𝑕𝑗 =

ℎ𝑗𝑡𝑢(𝑕𝑗) ℎ𝑗𝑡𝑢(𝑕𝑘)

𝑓𝑜𝑒 𝑘=1

Thus , an entropy filter consists of calculating the entropy over all the pixels in the image, using a predefined mask of neighborhood.

6

slide-7
SLIDE 7

7

slide-8
SLIDE 8

8

slide-9
SLIDE 9

9

slide-10
SLIDE 10

Implementation

10

slide-11
SLIDE 11

Conclusions

The entropy filter turned out to be a robust technique to perform segmentation and Clustering. A setback is the implementation of this method in real time. Due to the nature of the entropy filter , the computational load is very expensive.

11

slide-12
SLIDE 12

How can we resolve it?

12

1.

In order to improve performance , look-up-tables with a priori data could be used to compute the entropy itself .

2.

Use other filters with similar results but faster computing.

slide-13
SLIDE 13