Loading

Improved Canny Edge Detection Technique Using S-Membership Function
R. Pradeep Kumar Reddy1, C. Nagaraju2

1R. Pradeep Kumar Reddy, Department of Computer Science and Engineering, Y.S.R. Engineering College of Yogi Vemana University, Proddatur, India.
2Dr. C. Nagaraju, Department of Computer Science and Engineering, Y.S.R. Engineering College of Yogi Vemana University, Proddatur, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 43-49 | Volume-8 Issue-6, August 2019. | Retrieval Number: E7419068519 /2019©BEIESP | DOI: 10.35940/ijeat.E7419.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Traditional Canny edge detection algorithm is sensitive to noise, hence it may lose the weak edge information after noise removal and show poor adaptability of fixed parameters like threshold values. In view of these problems, this paper reports on the modification of canny edge detection algorithm using s-membership function. Adaptability of threshold values are achieved through S-membership function and is given as input to default Canny algorithm. The grayscale images have been analyzed for default Canny and modified Canny algorithm. To understand the performance of these algorithms it is essential to evaluate various statistical metrics. The proposed work states that the detailed statistical results and the images obtained reveal the superior performance of the modified Canny algorithm over the default Canny edge detection algorithm. Further the images obtained from modified Canny algorithm shows the marked edges with efficient image edge extraction and provide accurate information for image measurement.
Keywords: Canny edge detection, grayscale image, S-membership function, Improved Canny algorithm, and threshold.