Logical Heuristic Algorithm in Extracting 2D Structure Thinned Binary Image into Freeman Chain Code (FCC)

Authors:
Haswadi Hasan;Habibollah Haron;Siti Zaiton Hashim;Fakhrul Syakirin Omar
Affiliations:
Faculty of Computer Science and Information System, Universiti Teknologi Malaysia, Skudai, Malaysia 81310 UTM;Faculty of Computer Science and Information System, Universiti Teknologi Malaysia, Skudai, Malaysia 81310 UTM;Faculty of Computer Science and Information System, Universiti Teknologi Malaysia, Skudai, Malaysia 81310 UTM;Faculty of Computer Science and Information System, Universiti Teknologi Malaysia, Skudai, Malaysia 81310 UTM
Venue:
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
Year:
2009

Citing 3
Cited 0

Thinning Methodologies-A Comprehensive Survey

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy model based recognition of handwritten numerals

Pattern Recognition
3D-curve representation by means of a binary chain code

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2D structure with junctions, problem arise as which way first should be followed when junction is found while generating chain code. This paper presents new algorithm using special characters as the means of marking the junctions to ensure all paths have been crossed. The proposed chain code will be consisting of one long alphanumeric sequence with digit characters representing direction codes and alphabets for junction markers. The aim is to reduce the chain code's length to the minimum, as opposed to other chain code generation algorithms when facing with junction problem.