Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2007.14-A.3.151

Constant Time Algorithm for Computing Block Location of Linear Quadtree on RMESH  

Han, Seon-Mi (단국대학교 대학원 컴퓨터과학)
Woo, Jin-Woon (단국대학교 정보컴퓨터학부)
Publication Information
The KIPS Transactions:PartA / v.14A, no.3, 2007 , pp. 151-158 More about this Journal
Abstract
Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.
Keywords
RMESH; Linear quadtree; Locational code; Block location;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T.R. Walsh, 'Efficient axis-trnaslation of binary digital pictures by blocks in linear quadtree representation,' Computer Vision, Graphics and Image Processing Vol.41, No.3, pp.282-292, 1988   DOI
2 김수환,'구멍이 있는 다각형에서 가시성 다각형을 구하는 상수 시간 RMESH 알고리즘,'정보과학 2000년 가을학술발표논문집, 2000   과학기술학회마을
3 M. Nigam and S. Sahni, 'Sorting n Numbers On n x n Reconfigurable Meshes With Buses,' Proceedings 7th International Parallel Processing Symposium, pp.174- 181, 1993   DOI
4 G. Kim, et. al, 'Finding Neighbor Blocks on 3D RMESH in Constant Time without Condition,' Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp.2225-2231, 2001
5 J. Jenq, 'Clustering Using Self Organization Map on Rmesh,' Proceedings of International Conference on Computers and Their Applications, pp.91-96, 2005
6 김 명, 장주욱, '재구성가능 매수에서 O(1)시간 복잡도를 갖는 이진영상/사진트리 변환 알고리즘,' 정보과학회논문지(A), 제23권, 제5호, pp.454-466, 1996
7 공헌택, 우진운, 'RMESH 구조에서의서 원형 사진트리 구축을 위한 상수 시간 알고리즘, ' 정보처리 논문지, 제4권, 제9호, pp. 2247-2258, 1997   과학기술학회마을
8 김경훈, 우진운, 'RMESH 구조에서 unaligned 선형사진트리의 alignrnent를 위한 상수시간 알고리즘,' 정보과학회논문지, 제31권 1,2호, pp.10-18, 2004
9 H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990
10 H. Samet, Application of Spatial Data Structures, Computer Graphics, Image Processing, and GIS. Addison-Wesley, 1990
11 I. Gargantini, 'Translation, rotation, and superposition of linear quadtrees,' International of Man-Machine Studies Vol.18, No.3, pp.253-263, 1985   DOI   ScienceOn
12 R. Miller, V. Prasanna-Kurnar, D. Reisis, and Q. Stout, 'Parallel Computation on Reconfigurable Meshes,' IEEE Transactions on Computers, Vol.42, No.6, pp.678-692, 1993   DOI   ScienceOn
13 J. Jenq and S. Sahni, 'Reconfigurable Mesh Algorithms for The Hough Transform,' Proceedings of International Conference on Parallel Processing, Vol.Ⅲ, pp.34-41, 1991   DOI   ScienceOn
14 김홍근, 조유근, '단순다각형의 내부점 가시도를 위한 효율적인 RMESH 알고리즘,정보학회 논문지, 제20권 11호, pp.1693-1701, 1993
15 J. Jang, H. Park, and V. Prasanna, 'A Fast Algorithm for Computing Histogram on a Reconfigurable Mesh,' IEEE Trans. on Pattern Analysis and Machine Intelligence , Vol. 17, No.2, pp.97-106, 1995   DOI   ScienceOn
16 Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, 'The Power of Reconfiguration,' Journal of Parallel and Distributed Computing, 13, pp.139-153, 1991   DOI   ScienceOn
17 Sanjay Ranka and Sartaj Sahni, Hypercube algorithms with applications to image processing and pattern recognition, Springer-Verlag, New York, 1990
18 J. Jang and V. Prasanna, 'An Optimal Sorting Algorithm on Reconfigurable Meshes,' Proceedings 6th International Parallel Processing Symposium, 1992   DOI