01.12.2012 Views

Master Thesis - Fachbereich Informatik

Master Thesis - Fachbereich Informatik

Master Thesis - Fachbereich Informatik

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

66 CHAPTER 4. LENGTH MEASUREMENT APPROACH<br />

250<br />

200<br />

150<br />

100<br />

50<br />

(a) transparent, 50mm length, ∅8mm (b) black, 50mm length, ∅8mm<br />

gray level profile<br />

0<br />

0 100 200 300 400 500 600 700<br />

(c)<br />

250<br />

200<br />

150<br />

100<br />

50<br />

gray level profile<br />

0<br />

0 100 200 300 400 500 600 700<br />

Figure 4.13: Sample images with 11 equally distributed vertical scan lines used for profile<br />

analysis within a certain region of interest. (c) and (d) show the resulting profiles of image<br />

(a) and (b) respectively.<br />

ˆPy(x) =I(x, y) (4.3)<br />

where I(x, y) indicates the gray level value of an image I at pixel position (x, y). Since<br />

a single scan line (e.g. ˆ P h/2 with h the image height) is very sensitive to noise and local<br />

intensity variations, the localization of the tube boundaries based on the profile of a single<br />

row can be error-prone. Hence, a set of n parallel scan lines is considered. The mean<br />

profile Pn of all n lines is calculated by averaging the intensity values at each position:<br />

Pn = 1<br />

n<br />

n�<br />

ˆPyi<br />

i=1<br />

(d)<br />

(4.4)<br />

One property of the resulting profile Pn is the projection of a two-dimensional to an onedimensional<br />

problem which can be solved even faster (processing speed is a very important<br />

criteria at this step of the computation). Since further processing steps with respect to Pn<br />

are independent of the number of scan lines n (n ≥ 1), Pn is denoted simply as P in the<br />

following. A more detailed view on the number of scan lines and the scan line distribution<br />

with respect to robustness and performance is given in Appendix A. In the following Nscan<br />

denotes the number of scanlines used.<br />

4.4.2. Profile Analysis<br />

Step 1: The first step is smoothing the profile P by convolving with a large 1D mean<br />

filter kernel of dimension Ksmooth:

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

Saved successfully!

Ooh no, something went wrong!