Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ins.2005.04.001 | Inf. Sci. |
Keywords | Field | DocType |
hierarchical data representation,existing algorithm,boundary noise,critical pre-processing step,image processing,length n,octree representation,3-d image,computer graphics,computational complexity,quadtree,pattern analysis,computer graphic,hierarchical data,skeleton,octree | Thinning,Computer science,Image processing,Artificial intelligence,Hierarchical database model,Computer graphics,Sparse voxel octree,Discrete mathematics,Computer vision,Algorithm,Computational complexity theory,Octree,Quadtree | Journal |
Volume | Issue | ISSN |
176 | 10 | 0020-0255 |
Citations | PageRank | References |
8 | 0.51 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wai-Tak Wong | 1 | 114 | 8.64 |
| Frank Y. Shih | 2 | 1103 | 89.56 |
| Te-Feng Su | 3 | 34 | 7.55 |