Thinning algorithms based on quadtree and octree representations

Authors

Wai Tak Wong, Chung Hua University
Frank Y. Shih, Ying Wu College of Computing
Te Feng Su, Chung Hua University

Document Type

Article

Publication Date

3-20-2006

Abstract

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²) or O(N³), which is more efficient than the existing algorithms of O(N³) or O(N⁴). Furthermore, our thinning algorithms can lessen boundary noise spurs and are suited for parallel implementation. © 2005 Elsevier Inc. All rights reserved.

Identifier

33644688799 (Scopus)

Publication Title

Information Sciences

External Full Text Location

https://doi.org/10.1016/j.ins.2005.04.001

ISSN

00200255

First Page

1379

Last Page

1394

Issue

10

Volume

176

Recommended Citation

Wong, Wai Tak; Shih, Frank Y.; and Su, Te Feng, "Thinning algorithms based on quadtree and octree representations" (2006). Faculty Publications. 19022.
https://digitalcommons.njit.edu/fac_pubs/19022