Friday 23rd of February 2018

Fast Color Edge Detection Algorithm Based on Similarity Relation Matrix

Hossam Eldin Ibrahim Ali

A fast edge detection algorithm for color images was described in this paper. In the proposed method, smoothness of each pixel in color image is firstly calculated by means of similarity relation matrix and is normalized to maximum gray level. In spite of the simplicity of the proposed method, it can be further simplified taking benefit from the symmetry of matrix components as well as the avoidance of re-computing the common matrix elements between two successive pixel windows. This will reduce the time complexity extremely. The time complexity is further reduced by the splitting the algorithm into parallel tasks.

Keywords: Edge detection; Similarity relation matrix; Smoothness thresholding

Download Full-Text


Hossam Eldin Ibrahim Ali
Hossam Eldin Ibrahim received his B.Sc. degree in Communications & Electronics Engineering, his M.Sc. degree in Computer Engineering, and his Ph.D. degree in Computer Engineering from Helwan University, Cairo, Egypt, in 2000, 2004, and 2009 respectively. He has three published papers at M.Sc. degree, and seven published papers at Ph.D. degree. He is currently a Teacher at Electronics, Communication & Computer Department, Faculty of Engineering, Helwan University.

IJCSI Published Papers Indexed By:





IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482

More contact details »