UNSPECIFIED. (2001) One-pass parallel hexagonal thinning algorithm. IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 148 (1). pp. 45-53. ISSN 1350-245X

Full text not available from this repository.

Abstract

A comparison between two fully parallel thinning algorithms designed for images sampled on the square and hexagonal grids is reported. Using techniques from mathematical morphology, a hexagonal algorithm has been designed to closely match the operation of a well known square grid algorithm. Proofs of the connectivity and single pixel limb width of the resulting converged hexagonal skeleton have been presented. Implementations of both algorithms were found to produce accurate skeletons, but the hexagonal could be implemented with only 50% of the logical operations required by the square.

Item Type:	Journal Article
Journal or Publication Title:	IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING
Publisher:	IEE-INST ELEC ENG
ISSN:	1350-245X
Date:	February 2001
Volume:	148
Number:	1
Number of Pages:	9
Page Range:	pp. 45-53
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/12281

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item