The Roberts cross operator is used in image processing and computer vision for edge detection. It was one of the first edge detectors and was initially proposed by Lawrence Roberts in 1963.[1] As a differential operator, the idea behind the Roberts cross operator is to approximate the gradient of an image through discrete differentiation which is achieved by computing the sum of the squares of the differences between diagonally adjacent pixels.
According to Roberts, an edge detector should have the following properties: the produced edges should be well-defined, the background should contribute as little noise as possible, and the intensity of edges should correspond as close as possible to what a human would perceive. With these criteria in mind and based on then prevailing psychophysical theory Roberts proposed the following equations:
yi,j=\sqrt{xi,j
zi,j=\sqrt{(yi,j-yi+1,j+1)2+(yi+1,j-yi,)2}
where x is the initial intensity value in the image, z is the computed derivative and i,j represent the location in the image.
The results of this operation will highlight changes in intensity in a diagonal direction. One of the most appealing aspects of this operation is its simplicity; the kernel is small and contains only integers. However with the speed of computers today this advantage is negligible and the Roberts cross suffers greatly from sensitivity to noise.[2]
In order to perform edge detection with the Roberts operator we first convolve the original image, with the following two kernels:
\begin{bmatrix}+1&0\\ 0&-1\\ \end{bmatrix} and \begin{bmatrix}0&+1\\ -1&0\\ \end{bmatrix}.
Let
I(x,y)
Gx(x,y)
Gy(x,y)
\nablaI(x,y)=G(x,y)=\begin{bmatrix} Gx\\ Gy \end{bmatrix}, \left\|\nablaI(x,y)\right\|=\sqrt{
| 2 | |
| G | |
| x |
+
| 2 | |
| G | |
| y |
}.
The direction of the gradient can also be defined as follows:
\Theta(x,y)=\arctan{\left(
| Gy(x,y) | |
| Gx(x,y) |
\right)}-
| 3\pi | |
| 4 |
.
Here, four different gradient operators are used to estimate the magnitude of the gradient of the test image.