Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Marr-Hildreth algorithm

Computational Geometry Algorithm

The Marr-Hildreth algorithm is an edge detection method for digital images, finding the continuous curves where brightness changes strongly and quickly. It first convolves the image with the Laplacian of the Gaussian function, or with the faster difference of Gaussians approximation, and then detects zero crossings in the filtered result to locate the edges. The Laplacian-of-Gaussian operator is sometimes called the Mexican hat wavelet because of its shape when turned upside down. David Marr and Ellen C. Hildreth are among its inventors. It has two main limitations: it produces responses that are not real edges, called false edges, and its localization error can be severe at curved edges, so the Canny edge detector and differential approaches are now preferred.

Facts
Problem Solved
detecting edges in digital images 1
Connections

Credited To

David Marr, Pioneers
Source Marr-Hildreth algorithm (Wikipedia)

In Field

Source Marr-Hildreth algorithm (Wikipedia)

Invented

David Marr, Pioneers
Source Marr-Hildreth algorithm (Wikipedia)
Sources
1. Marr-Hildreth algorithm (Wikipedia)
  • Lead, problem solved
    is a method of detecting edges in digital images
  • In Group: Image Feature Detection Algorithms, Lead
    In computer vision, the Marr-Hildreth algorithm is a method of detecting edges in digital images
  • In Field: Computer Vision, Lead, field
    In computer vision, the Marr-Hildreth algorithm is a method of detecting edges in digital images
  • Invented: David Marr, Lead
    David Marr and Ellen C. Hildreth are two of the inventors.
  • Credited To: David Marr, Lead, credited inventor
    David Marr and Ellen C. Hildreth are two of the inventors.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.