Edge detection: Difference between revisions

Revision as of 11:51, 15 July 2023

Revision as of 21:08, 10 August 2023

Line 118:

</ref>

It took less than two decades to find a modern geometric variational meaning for that operator that links it to the [[Marr–Hildreth algorithm|Marr–Hildreth]] (zero crossing of the Laplacian) edge detector.

That observation was presented by [[Ron Kimmel]] and [[Alfred Bruckstein]].<ref>[{{Cite web |url=https://www.cs.technion.ac.il/~ron/PAPERS/laplacian_ijcv2003.pdf |title=R. Kimmel and A.M. Bruckstein (2003) "On regularized Laplacian zero crossings and other optimal edge integrators", ''International Journal of Computer Vision'', 53(3) pages 225–243.] |access-date=2019-09-15 |archive-date=2021-03-08 |archive-url=https://web.archive.org/web/20210308012954/https://www.cs.technion.ac.il/~ron/PAPERS/laplacian_ijcv2003.pdf |url-status=dead }}</ref>

Although his work was done in the early days of computer vision, the [[Canny edge detector]] (including its variations) is still a state-of-the-art edge detector.<ref>[[Linda Shapiro|Shapiro L. G.]] & Stockman G. C. (2001) Computer Vision. London etc.: Prentice Hall, Page 326.</ref> Edge detectors that perform better than the Canny usually require longer computation times or a greater number of parameters.