By Topic

An edge detection algorithm using a local distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Ayatollahi ; Iran Univ. of Sci. & Technol., Tehran, Iran ; S. B. Rezazad

The recently effective edge detection methods have computational complexity. In this paper, a new algorithm is proposed which is simple and fast. First, a set of points in an image is chosen which forms small squares. The value of each point is calculated using a low pass filter. The values of other points can be calculated by using the local linear distribution. It is possible that there is a curve corresponding to each level in any square. Therefore, for each level, one or more closed curves are formed in the full image. These curves are the edges of the image. Now, a set of levels must be chosen so that their corresponding curves produce the desired edges. If a larger number of levels are used, more details will be detected, otherwise only the objects will be recognized. This algorithm is easy to implement and very fast in execution, and can be used in a variety of applications such as normal edge detection, object detection, boundary detection and detecting objects as polygons, this assists in recognizing the shape and calculating the volume, gravity center and etc.

Published in:

Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on  (Volume:2 )

Date of Conference:

4-7 May 2003