Browse > Article

Constant Time Algorithm for the Window Operation of Linear Quadtrees on RMESH  

Kim, Kyung-Hoon (단국대학교 전산통계학과)
Jin, Woon-Woo (단국대학교 전산통계학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.29, no.3, 2002 , pp. 134-142 More about this Journal
Abstract
Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary 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 window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary 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 route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.
Keywords
RMESH; RMESH; linear quadtree; locational code; window operation;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 H. Samet, Application of Spatial Data Structures, Computer Graphics, Image Processing, and GIS, Addison-Wesley, 1990
2 H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990
3 H. Samet 뭉 M. Tamminen, 'Computing Geometric Properties of Images Represented by Linear Quadtrees,' IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-7, No. 2, March 1985
4 김 명, 장주욱, '재구성가능 매쉬에서 O(1)시간 복잡도를 갖는 이진영상/사진트리 변환 알고리즘,' 정보과학회논문지(A), 제23권, 제5호, pp.454-466, 1996
5 공헌택, 우진운, 'RMESH 구조에서의 선형 사진트리 구축을 위한 상수 시간 알고리즘,' 정보처리 논문지, 제4권, 제9호, pp. 2247-2258, 1997   과학기술학회마을
6 J. Jenq and S. Sahni, 'Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching,' Proceedings 5th International Parallel Processing Symposium, pp.208-215, 1991   DOI
7 김홍근, 조유근, '단순다각형의 내부점 가시도를 위한 효율적인 RMESH 알고리즘,' 정보학회 논문지 제20권 11호, pp.1693-1701, 1993
8 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
9 J. Jenq and S. Sahni, 'Reconfigurable Mesh Algorithms for The Hough Transform,' Proceedings of International Conference on Parallel Processing, Vol.III, pp.34-41, 1991
10 D. Rogers, Procedural Elements for Computer Graphics, McGraw-Hill, New-York, 1985
11 M. Nigam and S. Sahni, 'Sorting n Numbers On $n{\times}n$ Reconfigurable Meshes With Buses,' Proceedings 7th International Parallel Processing Symposium, pp.174-181, 1993   DOI
12 김수환, '구멍이 있는 다각형에서 가시성 다각형을 구하는 상수 시간 RMESH 알고리즘,' 정보과학 2000년 가을학술발표논문집, 2000   과학기술학회마을
13 R. Miller, V. Prasanna-Kumar, D. Resis, and Q. Stout, 'Parallel Computation on Reconfigurable Meshes,' IEEE Transactions on Computers, Vol.42, No.6, pp.678-692, 1993   DOI   ScienceOn
14 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
15 B. Wang, G. Chen, and F. Lin, 'Constant Time Sorting on a Processor Array with a Reconfigurable Bus System,' Information Processing Letters, 34, 4, pp.187-190, 1990   DOI   ScienceOn
16 J. Jang. and V. Prasanna, 'An Optimal Sorting Algorithm on Reconfigurable Meshes,' Proceedings 6th International Parallel Processing Symposium, 1992   DOI