AN OPTIMAL O(N) ALGORITHM FOR IDENTIFYING SEGMENTS FROM A SEQUENCE OFCHAIN CODES

Authors
YUAN JX SUEN CY
Citation
Jx. Yuan et Cy. Suen, AN OPTIMAL O(N) ALGORITHM FOR IDENTIFYING SEGMENTS FROM A SEQUENCE OFCHAIN CODES, Pattern recognition, 28(5), 1995, pp. 635-646
Citations number
16
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
Journal title
Pattern recognition → ACNP
ISSN journal
00313203
Volume
28
Issue
5
Year of publication
1995
Pages
635 - 646
Database
ISI
SICI code
0031-3203(1995)28:5<635:AOOAFI>2.0.ZU;2-8
Abstract
An optimal algorithm for identifying straight lines in chain codes is described. The algorithm turns the complicated problem of determining the straightness of digital arcs into a simple task by constructing a passing area around the pixels. It also solves the problem of detectin g all straight segments from a sequence of chain codes in O(n) time, w here n is the length of the sequence. It has been found that this algo rithm is not only simple and intuitive, but also highly efficient.