Thinning algorithms based on quadtree and octree representations

Authors:
Wai-Tak Wong;Frank Y. Shih;Te-Feng Su
Affiliations:
Department of Information Management, Chung-Hua University, No. 707, Sec. 2, Wu Fu Road, Hsin Chu, Taiwan, ROC;Computer Vision Laboratory, College of Computing Sciences, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Information Management, Chung-Hua University, No. 707, Sec. 2, Wu Fu Road, Hsin Chu, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2006

Citing 12
Cited 4

A one-pass thinning algoruthm and its parallel implementation

Computer Vision, Graphics, and Image Processing
A thinning algorithm by contour generation

Communications of the ACM
Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
Fast fully parallel thinning algorithms

CVGIP: Image Understanding
One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation

IEEE Transactions on Pattern Analysis and Machine Intelligence
On topology preservation in 3D thinning

CVGIP: Image Understanding
A 3D 6-subiteration thinning algorithm for extracting medial lines

Pattern Recognition Letters
Parameter-controlled volume thinning

CVGIP: Graphical Models and Image Processing
A medial-surface oriented 3-d two-subfield thinning algorithm

Pattern Recognition Letters
Handbook Of Pattern Recognition And Computer Vision

Handbook Of Pattern Recognition And Computer Vision
Pyramidal thinning algorithm for SIMD parallel machines

Pattern Recognition

Efficient continuous skyline computation

Information Sciences: an International Journal
Fast distance transformation on irregular two-dimensional grids

Pattern Recognition
A connected-component-labeling-based approach to virtual porosimetry

Graphical Models
Dynamic point-region quadtrees for particle simulations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

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^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.