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.

4.5. MEASURING POINT DETECTION 77<br />

The results of the transparent tubes are crucial for the selection of an appropriate<br />

edge detection approach used in this application, since due to the strong contrast the<br />

detection of the black tube boundaries is uncritical with all tested methods. For both<br />

tube types the edge detection results differ in detected orientation, edge elongation (i.e.<br />

how precise an edge can be localized), or edge representation (signed/unsigned values,<br />

floating point/binary, etc.).<br />

Canny Edge Detector The Canny edge detector results in a skeletonized one pixel wide<br />

response that precisely describes edges of arbitrary orientation. In this application the<br />

main drawback of Canny’s approach is the importance of the threshold choice. As can<br />

be seen in Table 4.2, different parameter sets yield very different results. If the upper<br />

hysteresis threshold used as starting point for edge linking is low (e.g. 100) combined with<br />

a lower second threshold (e.g. 50), too many background edges are detected as well. A<br />

larger upper threshold (e.g. > 200) reduces the number of detected edge pixels, but also<br />

eliminates parts of the tube edge. It is possible that it breaks up into parts. If the distance<br />

between upper and lower threshold is large, it is likely that background and tube edges<br />

are merged. In any case a threshold set working fine with one image can lead to very<br />

poor results in another. The result of the Canny edge detector is a binary image where<br />

non-edge pixels have a value of zero and edge pixels a value of one (or 255 in 8bit gray level<br />

images). Binary contour algorithms can be applied to analyze chains of connected edge<br />

pixels. As can be seen in the test images, depending on how many edge pixels survived<br />

the thresholding, such analysis can be very complex and time-consuming. Gaps within<br />

edges belonging to the tube boundary make this search even more complicated.<br />

Sobel The Sobel operator approximates a Gaussian smoothing combined with differentiation.<br />

It can be applied with respect to x- andy- direction. Accordingly to the filter<br />

direction, vertical or horizontal edges are enhanced. Since the tube boundaries have a vertical<br />

orientation, the SOBELX operator is an adequate choice in this application. Edges<br />

are located at local extrema, i.e. local minima at bright-dark edges and local maxima<br />

for dark-bright edges with respect to the gradient direction. A drawback is that also<br />

the background pattern is dominantly vertical oriented, thus, background edges are also<br />

detected. The intensity of an edge is related to the image contrast. Assuming a certain<br />

contrast between tubes and background, a large amount of background clutter could be<br />

removed by thresholding leaving only tube edges and edges due to high-contrast dirt particles.<br />

However, this would lead to a similar approach like the Canny edge detector with<br />

the drawbacks stated before.<br />

Laplace The implementation used to test the Laplacian calculates the second-order derivative<br />

in x- andy-direction using the Sobel operator and sums the results. The output is<br />

an image of signed floating point values. Edges are located at the zero crossings between<br />

strong peaks. The Laplacian is an anisotropic operator, thus, edges off all orientations are<br />

detected equally. One drawback of this method is the sensitivity to noise. In the resulting<br />

response there are many zero crossings. Compared to first-order derivatives, the edge criterion<br />

is more complex. A pixel is an edge pixel if the closest neighbor in the direction of<br />

the gradient is a local maximum while the opposite neighbor is a local minimum and both

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

Saved successfully!

Ooh no, something went wrong!