Cart (Loading....) | Create Account
Close category search window
 

A novel logarithmic edge detection algorithm

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
$31 $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

3 Author(s)
Alipoor, M. ; Eng. Dept., Tarbiat Moallem Univ. of Sabzevar, Sabzevar, Iran ; Ebrahimi, Z. ; Haddadnia, J.

In this paper a novel logarithmic edge detection algorithm is presented. The algorithm is an extended and modified version of PLIP Sobel edge detection algorithm. Six new kernels are suggested to achieve a higher level of independence from scene illumination and provide obvious distinction between edge and non-edge pixels. We present experimental results for this method, and compare results of the algorithm against several leading edge detection methods such as Sobel, Canny and conventional logarithmic edge detection. To compare results objectively, we computed edginess judging index (EJI) for edge detection algorithms. The proposed technique is effective, as demonstrated by computer simulations, conceptually straight forward, and easy to use.

Published in:

Machine Vision and Image Processing (MVIP), 2010 6th Iranian

Date of Conference:

27-28 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.