File: sobel_derivatives.markdown

package info (click to toggle)
opencv 3.2.0%2Bdfsg-6
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 238,480 kB
  • sloc: xml: 901,650; cpp: 703,419; lisp: 20,142; java: 17,843; python: 17,641; ansic: 603; cs: 601; sh: 516; perl: 494; makefile: 117
file content (153 lines) | stat: -rw-r--r-- 6,433 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
Sobel Derivatives {#tutorial_sobel_derivatives}
=================

Goal
----

In this tutorial you will learn how to:

-   Use the OpenCV function @ref cv::Sobel to calculate the derivatives from an image.
-   Use the OpenCV function @ref cv::Scharr to calculate a more accurate derivative for a kernel of
    size \f$3 \cdot 3\f$

Theory
------

@note The explanation below belongs to the book **Learning OpenCV** by Bradski and Kaehler.

-#  In the last two tutorials we have seen applicative examples of convolutions. One of the most
    important convolutions is the computation of derivatives in an image (or an approximation to
    them).
-#  Why may be important the calculus of the derivatives in an image? Let's imagine we want to
    detect the *edges* present in the image. For instance:

    ![](images/Sobel_Derivatives_Tutorial_Theory_0.jpg)

    You can easily notice that in an *edge*, the pixel intensity *changes* in a notorious way. A
    good way to express *changes* is by using *derivatives*. A high change in gradient indicates a
    major change in the image.

-#  To be more graphical, let's assume we have a 1D-image. An edge is shown by the "jump" in
    intensity in the plot below:

    ![](images/Sobel_Derivatives_Tutorial_Theory_Intensity_Function.jpg)

-#  The edge "jump" can be seen more easily if we take the first derivative (actually, here appears
    as a maximum)

    ![](images/Sobel_Derivatives_Tutorial_Theory_dIntensity_Function.jpg)

-#  So, from the explanation above, we can deduce that a method to detect edges in an image can be
    performed by locating pixel locations where the gradient is higher than its neighbors (or to
    generalize, higher than a threshold).
-#  More detailed explanation, please refer to **Learning OpenCV** by Bradski and Kaehler

### Sobel Operator

-#  The Sobel Operator is a discrete differentiation operator. It computes an approximation of the
    gradient of an image intensity function.
-#  The Sobel Operator combines Gaussian smoothing and differentiation.

#### Formulation

Assuming that the image to be operated is \f$I\f$:

-#  We calculate two derivatives:
    -#  **Horizontal changes**: This is computed by convolving \f$I\f$ with a kernel \f$G_{x}\f$ with odd
        size. For example for a kernel size of 3, \f$G_{x}\f$ would be computed as:

        \f[G_{x} = \begin{bmatrix}
        -1 & 0 & +1  \\
        -2 & 0 & +2  \\
        -1 & 0 & +1
        \end{bmatrix} * I\f]

    -#  **Vertical changes**: This is computed by convolving \f$I\f$ with a kernel \f$G_{y}\f$ with odd
        size. For example for a kernel size of 3, \f$G_{y}\f$ would be computed as:

        \f[G_{y} = \begin{bmatrix}
        -1 & -2 & -1  \\
        0 & 0 & 0  \\
        +1 & +2 & +1
        \end{bmatrix} * I\f]

-#  At each point of the image we calculate an approximation of the *gradient* in that point by
    combining both results above:

    \f[G = \sqrt{ G_{x}^{2} + G_{y}^{2} }\f]

    Although sometimes the following simpler equation is used:

    \f[G = |G_{x}| + |G_{y}|\f]

@note
    When the size of the kernel is `3`, the Sobel kernel shown above may produce noticeable
    inaccuracies (after all, Sobel is only an approximation of the derivative). OpenCV addresses
    this inaccuracy for kernels of size 3 by using the @ref cv::Scharr function. This is as fast
    but more accurate than the standar Sobel function. It implements the following kernels:
    \f[G_{x} = \begin{bmatrix}
    -3 & 0 & +3  \\
    -10 & 0 & +10  \\
    -3 & 0 & +3
    \end{bmatrix}\f]\f[G_{y} = \begin{bmatrix}
    -3 & -10 & -3  \\
    0 & 0 & 0  \\
    +3 & +10 & +3
    \end{bmatrix}\f]
@note
    You can check out more information of this function in the OpenCV reference (@ref cv::Scharr ).
    Also, in the sample code below, you will notice that above the code for @ref cv::Sobel function
    there is also code for the @ref cv::Scharr function commented. Uncommenting it (and obviously
    commenting the Sobel stuff) should give you an idea of how this function works.

Code
----

-#  **What does this program do?**
    -   Applies the *Sobel Operator* and generates as output an image with the detected *edges*
        bright on a darker background.

-#  The tutorial code's is shown lines below. You can also download it from
    [here](https://github.com/opencv/opencv/tree/master/samples/cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp)
    @include samples/cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp

Explanation
-----------

-#  First we declare the variables we are going to use:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp variables
-#  As usual we load our source image *src*:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp load
-#  First, we apply a @ref cv::GaussianBlur to our image to reduce the noise ( kernel size = 3 )
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp reduce_noise
-#  Now we convert our filtered image to grayscale:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp convert_to_gray
-#  Second, we calculate the "*derivatives*" in *x* and *y* directions. For this, we use the
    function @ref cv::Sobel as shown below:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp sobel
    The function takes the following arguments:

    -   *src_gray*: In our example, the input image. Here it is *CV_8U*
    -   *grad_x*/*grad_y*: The output image.
    -   *ddepth*: The depth of the output image. We set it to *CV_16S* to avoid overflow.
    -   *x_order*: The order of the derivative in **x** direction.
    -   *y_order*: The order of the derivative in **y** direction.
    -   *scale*, *delta* and *BORDER_DEFAULT*: We use default values.

    Notice that to calculate the gradient in *x* direction we use: \f$x_{order}= 1\f$ and
    \f$y_{order} = 0\f$. We do analogously for the *y* direction.

-#  We convert our partial results back to *CV_8U*:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp convert
-#  Finally, we try to approximate the *gradient* by adding both directional gradients (note that
    this is not an exact calculation at all! but it is good for our purposes).
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp blend
-#  Finally, we show our result:
    @snippet cpp/tutorial_code/ImgTrans/Sobel_Demo.cpp display

Results
-------

-#  Here is the output of applying our basic detector to *lena.jpg*:

    ![](images/Sobel_Derivatives_Tutorial_Result.jpg)