Master Thesis - Fachbereich Informatik
Master Thesis - Fachbereich Informatik
Master Thesis - Fachbereich Informatik
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
2.3. EDGE DETECTION 23<br />
N × 1 kernel. This increases the performance significantly for large images and N. More<br />
information about convolution and filter separation can be found for example in [64].<br />
The general procedure of edge enhancement in common derivative-based edge detectors<br />
can be summarized into two steps:<br />
1. Smoothing of the image by convolving with a smoothing function<br />
2. Differentiation of the smoothed image<br />
Mathematically, this can be expressed as follows (here with respect to x):<br />
Iedge(x, y) = K∂/∂x ∗ (S ∗ I(x, y)) (2.18)<br />
= (K∂/∂x ∗ S) ∗ I(x, y)<br />
= ∂S<br />
∗ I(x, y)<br />
∂x<br />
where K∂/∂x indicates the filter kernel approximating the partial derivative with respect<br />
to x. S represents the kernel of the smoothing function. Again, the associativity of the<br />
convolution can be used to optimize processing. Thus, instead of first smoothing the<br />
image with kernel S and then calculating the partial derivative, it is possible to reduce<br />
the problem to a single convolution with the partial derivative of the smoothing kernel<br />
∂S<br />
∂x . Hence, the first-order derivative of a Gaussian is suited as an edge detector which is<br />
less sensitive to noise compared to finite difference filters [24]. The response of the edge<br />
detector can be parametrized by the standard deviation of the Gaussian to control the<br />
scale of detected edges, i.e. the level of detail. A larger σ suppresses high-frequency edges<br />
for example.<br />
2.3.3. Common Edge Detectors<br />
Due to the large number of approaches in this section only a selection of common edge<br />
detectors can be presented. Figure 2.7 visualizes the edge responses of different edge<br />
detectors that will be introduced in the following in more detail.<br />
Sobel Edge Detector A very early edge detector that is still used quite often in the<br />
present is the Sobel operator. It was first described in [51] and attributed to Sobel. It is<br />
the smallest difference filter with odd number of coefficients that averages the image in<br />
the direction perpendicular to the differentiation [36]. The corresponding filter kernel for<br />
x and y are:<br />
⎡<br />
SOBELX = ⎣<br />
⎡<br />
SOBELY = ⎣<br />
1 0 −1<br />
2 0 −2<br />
1 0 −1<br />
⎤<br />
1 2 1<br />
0 0 0<br />
−1 −2 −1<br />
⎦ (2.19)<br />
⎤<br />
⎦ (2.20)