Roberts Cross

In computer vision, the Roberts' Cross operator is one of the earliest edge detection algorithms, which works by computing the sum of the squares of the differences between diagonally adjacent pixels. This can be accomplished by convolving the image with two 2x2 kernels:

:

In other words, each pixel in the output image is calculated as follows:

tmp1 = absolute_value(input_image(x,y) - input_image(x+1,y+1)) tmp2 = absolute_value(input_image(x+1,y) - input_image(x,y+1)) output_image(x,y) = tmp1 + tmp2

Roberts' Cross is still in use due to the speed of computation, but performance compared to the alternatives is poor, with noise sensitivity a significant problem. It produces finer lines than other edge detection methods. It is sometimes called 'Roberts Filter'.

ee also

* computer vision
* digital image processing
* edge detection
* feature detection (computer vision)
* feature extraction
* Sobel operator A more advanced edge-detection operator that uses a similar technique