Nasien, Dewi and Deni Yulianti, Deni Yulianti and Omar, Fakhrul Syakirin (2015) Shortest chain code extraction from handwritten character using simulated annealing. In: Proceedings of the 4th International Conference on Computer Science & Computational Mathematics (ICCSCM 2015), 7-8 May, 2015, Langkawi, Malaysia.
Full text not available from this repository.
Official URL: http://www.iccscm.com/2015/
Abstract
Chain code is used as representation for an image in form of sequence of directional codes along the border or structure line. Issue arises during its extraction when the line has branches and the sequence must be continuous; no restarting at any junction is allowed. To find the shortest route possible covering all edges in the image to produce the shortest chain code, optimization using simulated annealing is performed. The overall resulting chain code length is shorter compared with by using harmony search algorithm for searching.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | simulated annealing, chain code extraction |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Computing |
| ID Code: | 63512 |
| Deposited By: | Widya Wahid |
| Deposited On: | 30 May 2017 05:10 |
| Last Modified: | 30 May 2017 05:10 |
Repository Staff Only: item control page
