An analysis of hexagonal thinning algorithms and skeletal shape representation
UNSPECIFIED. (1996) An analysis of hexagonal thinning algorithms and skeletal shape representation. PATTERN RECOGNITION, 29 (7). pp. 1131-1146. ISSN 0031-3203Full text not available from this repository.
The use of skeletons or stick figures for binary image shape analysis, object classification and coding has been widely reported in the literature. Tools using the nomenclature of mathematical morphology for defining skeletons and analysing algorithms based on the iterative deletion of pixels have recently been developed and are extended here to examine the processing of binary images sampled on a hexagonal grid of points. The properties of a skeleton in a hexagonal grid are defined and thinning templates designed. It is shown that even when simple templates are used, some parallel application can be achieved. The analysis leads to the development of a new algorithm in which pairs of templates are applied in parallel, resulting in accurate and efficient processing. Finally, the new algorithm is compared experimentally to a similar parallel algorithm designed for a conventional rectangular sampling grid. The hexagonal skeleton exhibited more accurate corner representation, limbs that enable the area of a rectangular shape to be estimated form the skeleton, noise immunity without preprocessing and a processing time of 55% of that required to process the rectangular scheme skeleton. Copyright (C) 1996 Pattern Recognition Society.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Journal or Publication Title:||PATTERN RECOGNITION|
|Publisher:||PERGAMON-ELSEVIER SCIENCE LTD|
|Official Date:||July 1996|
|Number of Pages:||16|
|Page Range:||pp. 1131-1146|
Actions (login required)