Thinning algorithms based on quadtree and octree representations

Thinning is a critical pre-processing step to obtain skeletons for pattern analysis. Quadtree and octree are hierarchical data representations in image processing and computer graphics. In this paper, we present new 2-D area-based and 3-D surface-based thinning algorithms for directly converting qua...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 176; no. 10; pp. 1379 - 1394
Main Authors Wong, Wai-Tak, Shih, Frank Y., Su, Te-Feng
Format Journal Article
LanguageEnglish
Published Elsevier Inc 22.05.2006
Subjects
Image representation
Octree
Quadtree
Skeleton
Thinning
Quadtree
Image representation
Skeleton
Octree
Thinning
Online AccessGet full text

Cover

More Information
Summary:Thinning is a critical pre-processing step to obtain skeletons for pattern analysis. Quadtree and octree are hierarchical data representations in image processing and computer graphics. In this paper, we present new 2-D area-based and 3-D surface-based thinning algorithms for directly converting quadtree and octree representations to skeletons. The computational complexity of our thinning algorithm for a 2-D or a 3-D image with each length N is respectively O( N 2) or O( N 3), which is more efficient than the existing algorithms of O( N 3) or O( N 4). Furthermore, our thinning algorithms can lessen boundary noise spurs and are suited for parallel implementation.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2005.04.001