Main Page
About FCIT
History
Strategy
Administration>
Current Administration
Prevouis Administration
Organization Strucutre
Industrial Advisory Board
PhotoAlbum
Lab Guides
Departments
Computer Science
Information Technology
Information Systems
Academics
Bachelor Programs
Graduate Programs
Executive Programs
Academic Calendar
Admission
Bachelor Degree & Transferring
Admission from the Foundation Year
Transferring to the Faculty
Graduate Studies
Graduate Programs
Executive Programs
Scientific Research
Groups and Units
Research Groups
Research Interests
Distinguished Scientists Program
Faculty Journal
Faculty and Staff
Faculty
CS Department
IT Department
IS Department
Staff
Accreditation Integration & Management System (AIM
Development and Quality Unit
Work at FCIT
Capabilities Under the Spotlight
Code of Ethics
Students
Bachelor
ِAcademic Services
Preparatory Year Courses
Students' Guide
Academic Advising
Laboratories and Facilities
Student rights and duties
Graduate
Polices and Regulations
Students' Guide
Student's Handbook
New Student Orientation
Templates of proposals and theses for masters and
Courses
CS Program
IT Program
IS Program
Alumni Registration
Students Activities
Entrepreneurship Club
Cybersecurity Club
Data Science Club
Programming Club
Community
Industrial partnerships
Cisco Academy
Microsoft Academy
Oracle Academy
Files
Researches
Contact Us
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Computing and Information Technology
Document Details
Document Type
:
Article In Journal
Document Title
:
Connected Components Labeling Algorithm Based on Span Tracking
خوارزمية وسم العناصر المترابطة بالإعتماد على تعقب النطاق
Subject
:
Image Processing and Computer Vision
Document Language
:
English
Abstract
:
In this paper, a single scan algorithm for labeling of connected components in binary images is presented. The main feature of this algorithm is to label the entire component in one shot, to avoid the analysis of label equivalences. In the algorithm, the binary image is scanned row by row, from top to bottom and from left to right. When a starting pixel (seed) of a component is encountered, the scanning process is paused and the algorithm completely labels all pixels of that component with the same label. The scanning process is resumed and the labeling process is continued until the entire image is scanned. The performance of the proposed algorithm is compared with the well-known single scan labeling algorithm, Chang‘s contour tracing algorithm. Both algorithms generate consecutive labels for objects. Experimental results demonstrated that the presented algorithm is superior to contour tracing algorithm.
ISSN
:
19231717
Journal Name
:
Canadian Journal on Image Processing and Computer Vision
Volume
:
2
Issue Number
:
7
Publishing Year
:
1432 AH
2011 AD
Article Type
:
Article
Added Date
:
Sunday, January 8, 2012
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
فرج النجاحي
Elnagahy, farag
Researcher
Doctorate
faragelnagahy@hotmail.com
Files
File Name
Type
Description
32006.docx
docx
Connected Components Labeling Algorithm Based on Span Tracking
Back To Researches Page