Hasan, Haswadi and Haron, Habibollah and Hashim, Siti Zaiton and Omer, Fakhrul Syakirin (2009) Logical heuristic algorithm in extracting 2D structure thinned binary image into freeman chain code (FCC). In: Visual Informatics: Bridging Research and Practice. Springer, Berlin/ Heidelberg, pp. 770-778. ISBN 978-3-642-05035-0
Full text not available from this repository.
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.
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Computer Science and Information System |
| ID Code: | 14561 |
| Deposited By: | Siti Khairiyah Nordin |
| Deposited On: | 26 Aug 2011 03:21 |
| Last Modified: | 13 Aug 2017 01:20 |
Repository Staff Only: item control page
