Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2004.11A.3.173

Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH  

Woo, Jin-Woon (단국대학교 정보컴퓨터학부)
Publication Information
The KIPS Transactions:PartA / v.11A, no.3, 2004 , pp. 173-180 More about this Journal
Abstract
Quadtree, which 11 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 to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.
Keywords
RMESH; Linear Quadtree; Locational Code; Region Expansion; Scaling;
Citations & Related Records
Times Cited By KSCI : 1  (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 I. Gargantini, 'Translation, rotation, and superposition of linear quadtrees,' International Journal of Man-Machine Studies, Vol.18, No.3, pp.253-263, 1985   DOI   ScienceOn
4 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
5 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
6 J. Jang and V. Prasanna, 'An Optimal Sorting Algorithm on Reconfigurable Meshes,' Proceedings 6th International Parallel Processing Symposium, 1992
7 김명, 장주욱, '재구성가능 매쉬에서 Ο(1) 시간 복잡도를 갖는 이진영상/사진트리 변환 알고리즘', 정보학학회논문지A, 제23-A권 제5호, pp.454-466, 1996
8 김수환, '구멍이 있는 다각형에서 가시성 다각형을 구하는 상수 시간 RMESH 알고리즘', 정보과학 2000년 가을학술발표논문집, 2000   과학기술학회마을
9 김홍근, 조유근, '단순다각형의 내부점 가시도를 위한 효율적인 RMESH 알고리즘', 정보학회논문지, 제20권 제11호, pp.1693-1701, 1993
10 T. R. Walsh, 'Efficient axis-truaslation 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
11 공헌택, 우진운, 'RMESH 구조에서의 선형 사진트리 구축을 위한 상수 시간 알고리즘', 정보처리논문지, 제4권 제9호, pp.2247-2258, 1997   과학기술학회마을
12 김경훈, 우진운, 'RMESH 구조에서 선형 사진트리의 윈도우 연산을 위한 상수시간 알고리즘,' 정보과학회논문지, 제29권 제3, 4호, pp.134-142, 2002   과학기술학회마을
13 Sanjay Ranka and Sartaj Sahni, Hypercube algorithms with applications to image processing and pattern recognition, Springer-Verlag, New York, 1990
14 R. Miller, V. Prasanna-Kumar, D. Reisis and Q. Stout, 'Parallel Computation on Reconfigurable Meshes,' IEEE Transactions on Computers, Vol.42, No.6, pp.678-692, 1993   DOI   ScienceOn
15 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
16 M. Nigam and S. Sahni, 'Sorting n Numhers On $n{\times}n$ Reconfigurable Meshes With Buses,' Proceedings 7th International Parallel Processing Symposium, pp.174-181, 1993