MATEC Web of Conferences
Volume 22, 2015International Conference on Engineering Technology and Application (ICETA 2015)
|Number of page(s)||7|
|Section||Information and Communication Technology|
|Published online||09 July 2015|
An Improved Canny Algorithm with Adaptive Threshold Selection
School of Automation & Electrical Engineering, University of Science and Technology Beijing, Beijing, China
* Corresponding author: email@example.com
Canny is a classic algorithm of edge detection which has been widely applied in various fields of image processing for years. However, the algorithm has some defects. The most serious defect is that the traditional canny algorithm can’t set threshold adaptively. If the threshold set manually is not accurate, it will seriously affect the quality of the algorithm to detect the edge. This makes the poor adaptability of the algorithm. This paper proposes a method which combines maximum entropy method with Otsu method to determine the high and low threshold of Canny algorithm. Experiments show that the modified algorithm has stronger robustness than traditional method. For the images which have complex distributions of grey level histogram, the modified algorithm has better performance.
Key words: edge detection / adaptive threshold / maximum entropy method / Otsu method / Canny algorithm
© Owned by the authors, published by EDP Sciences, 2015
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.