0% found this document useful (0 votes)
125 views2 pages

Marr Hildreth

The Marr-Hildreth algorithm detects edges in digital images by convolving the image with the Laplacian of Gaussian function or difference of Gaussians. Zero crossings are then detected in the filtered result to obtain the edges. The Laplacian of Gaussian operator is sometimes referred to as the Mexican hat wavelet due to its visual shape. Marr-Hildreth edge detection operates by convolving the image with the Laplacian of Gaussian, which smooths the image with a Gaussian filter then convolves it with a Laplacian mask to extract edges via zero crossings.

Uploaded by

Rajesh Paul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
125 views2 pages

Marr Hildreth

The Marr-Hildreth algorithm detects edges in digital images by convolving the image with the Laplacian of Gaussian function or difference of Gaussians. Zero crossings are then detected in the filtered result to obtain the edges. The Laplacian of Gaussian operator is sometimes referred to as the Mexican hat wavelet due to its visual shape. Marr-Hildreth edge detection operates by convolving the image with the Laplacian of Gaussian, which smooths the image with a Gaussian filter then convolves it with a Laplacian mask to extract edges via zero crossings.

Uploaded by

Rajesh Paul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

In computer vision, the Marr–Hildreth algorithm is a method of detecting edges in digital images,

that is, continuous curves where there are strong and rapid variations in image brightness. The
Marr–Hildreth edge detection method is simple and operates by convolving the image with the
Laplacian of the Gaussian function, or, as a fast approximation by difference of Gaussians. Then, zero
crossings are detected in the filtered result to obtain the edges. The Laplacian-of-Gaussian image
operator is sometimes also referred to as the Mexican hat wavelet due to its visual shape when
turned upside-down. David Marr and Ellen C. Hildreth are two of the inventors.[1]

Edge detection of an image reduces significantly the amount of data and filters
out information that may be regarded as less relevant, preserving the important
structural properties of an image. There are many methods for edge detection,
but most of them can be grouped into two categories, search-based and zero-
crossing based. The search-based methods detect edges by looking for maxima
and minima in the first derivative of the image, usually local directional maxima of
the gradient magnitude. The zero-crossing based methods search for zero
crossings in the second derivative of the image in order to find edges, usually the
zero-crossings of the Laplacian or the zero-crossings of a non-linear differential
expression. This project will look at two edge detection methods, the first being
Marr-Hildreth, a zero-crossing method, and the other is Canny, a search-based
method. The Canny is most commonly used edge detection method and
supposedly give the best results. Hopefully my results will be able to confirm this.

Marr-Hildreth
The Marr-Hildreth edge detection method operates by convolving the image with
the Laplacian of Gaussian. Laplacian of Gaussian (LoG) is a second derivative of a
Gaussian filter. After reading the book, the LoG can be broken up into two steps.
First, smooth the image with a Gaussian filter, and second, convolve the image
with a Laplacian mask. The Laplacian mask I used was taken from the book shown
below. I used the 3x3 mask with a value of 8 in the middle surrounded by -1.
Laplacian Mask

The Marr-Hildreth edge detection algorithm can be modified by changing the


standard deviation of the Gaussian filter. After using the Laplacian mask on the
image, in order to extract the edges from the image, zero crossings is used. Below
is an image of a white square surrounded by black. This image was used to help
debug this algorith
References:

Edge detection in images using Marr-


Hildreth filtering techniques

You might also like