Edge Drawing: A Heuristic Approach to Robust Real-Time Edge Detection
Authors:
- Cihan TopalCTCihan Topal
- Cuneyt AkinlarCACuneyt Akinlar
- Yakup GencYGYakup Genc
- 1 August 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10514651,p. 2424-2427
Abstract
We propose a new edge detection algorithm that works by computing a set of anchor edge points in an image and then linking these anchor points by drawing edges between them. The resulting edge map consists of perfect contiguous, one-pixel wide edges. The performance tests show that our algorithm is up to 16% faster than the fastest known edge detection algorithm, i.e., OpenCV implementation of the Canny edge detector. We believe that our edge detector is a novel step in edge detection and would be very suitable for the next generation real-time image processing and computer vision applications.Keywords
This publication has 12 references indexed in Scilit:
- A methodology for quantitative performance evaluation of detection algorithmsIEEE Transactions on Image Processing, 1995
- Adaptable edge quality metricOptical Engineering, 1993
- Assessing the state of the art in edge detection: 19921992
- Performance characterization of edge detectors1992
- Optimal infinite impulse response zero crossing based edge detectorsCVGIP: Image Understanding, 1991
- Edge FocusingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1987
- A Computational Approach to Edge DetectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
- On Detecting EdgesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
- Quantitative design and evaluation of enhancement/thresholding edge detectorsProceedings of the IEEE, 1979
- On the Quantitative Evaluation of Edge Detection Schemes and their Comparison with Human PerformanceIEEE Transactions on Computers, 1975