Abstract
In this paper, we propose a simple and new technique called as 'pixel scratching algorithm'. This method finds edges of objects in any black and white image by scratching out all those pixels that show abrupt changes in grey levels and making all other pixels as background. These scratched out pixels then form a sketch of the edge of the objects that are present in the image. In contrast to existing edge detection techniques like Laplacian operators, Sobel operators, Prewitt operators, the proposed technique gives finer edges with much less computation without the need of any mask operator, finding second derivatives or applying weight for smoothing. In this approach, edge pixels are determined by scanning the image line by line from top to bottom and finding out differences between successive pixel values, followed by thresholding. Experimental results show that the proposed method provides more promising result than the methods being compared here.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Vision and Robotics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
