Abstract
In this paper the novel modification of the well known Canny edge detection algorithm is presented. The first section describes the goal to be achieved by using the new algorithm. The second section describes theoretical basis of Canny algorithm and its practical implementation. Next, basics of the Ramer–Douglas–Peucker algorithm used for reducing the number of points in the curve are presented. The extension of the Canny algorithm and its implementation are presented in the fourth section. The next section shows the results of the new algorithm implementation for various images and presents statistical data to report effectiveness of the proposed algorithm modification.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Donoho, D., Huo, X.: Applications of Beamlets to Detection and Extraction of Lines, Curves and Objects in Very Noisy Images. Nonlinear Signal and Image Processing (NSIP), Baltimore (2001)
Canny, J.: A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-8 (1986)
Internet resource, http://en.wikipedia.org/wiki/Ramer-Douglas-Peucker_algorithm (accessed April 24, 2012)
Heath, M., Sarkar, S., Sanocki, T., Bowyer, K.: Comparison of Edge Detectors. Computer Vision and Image Understanding 69(1), 38–54 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mokrzycki, W., Samko, M. (2012). Canny Edge Detection Algorithm Modification. In: Bolc, L., Tadeusiewicz, R., Chmielewski, L.J., Wojciechowski, K. (eds) Computer Vision and Graphics. ICCVG 2012. Lecture Notes in Computer Science, vol 7594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33564-8_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-33564-8_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33563-1
Online ISBN: 978-3-642-33564-8
eBook Packages: Computer ScienceComputer Science (R0)