Building a quadtree and its applications on a reconfigurable mesh

Pattern Recognition

Volumn 29, Issue 9, 1996, Pages 1571-1579

  Lee, Shung Shing ^a   Horng, Shi Jinn ^a   Tsai, Horng Ren ^a   Tsai, Shun Shan ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Hilbert's space filling curve; Image compression decompression; Image processing; Parallel algorithms; Pattern recognition; Quadtree; Reconfigurable mesh

Indexed keywords

DATA STRUCTURES; DIGITAL SIGNAL PROCESSING; IMAGE COMPRESSION; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

BINARY IMAGES; HILBERT MAPPING TECHNIQUE; IMAGE DECOMPRESSION; QUADTREE; RECONFIGURABLE MESH;

PATTERN RECOGNITION;

EID: 0030241667     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(96)00003-9     Document Type: Article

References (19)

1. E. Shusterman and M. Feder, Image compression via improved quadtree decomposition algorithms, IEEE Trans. Image Process. 3(2), 207-215 (1994).
2. P. Strobach, Quadtree-structured linear prediction models for image sequence processing, IEEE Trans. Pattern Anal. Mach. Intell. 11(7), 742-748 (1989).
3. C. H. Chien and J. K. Aggarwal, A normalized quadtree representation, Comput. Vis. Graphics Image Process. 26, 331-346 (1984).
4. A. S. Bhaskar, A. Rosenfeld and A. Wu, Parallel processing of regions represented by linear quadtrees, Comput. Vis. Graphics Image Process. 42, 371-380 (1988).
5. Y. Hung and A. Rosenfeld, Parallel processing of linear quadtree on a mesh-connected computer, J. Parallel Dist. Comput. 7, 1-27 (1989).
6. S. Kasif, Optimal parallel algorithms for quadtree problems, CVGIP, Image Understanding 59(3), 281-285 (1994).
7. H. Samet, An algorithm for converting rasters to quadtrees, IEEE Trans. Pattern Anal. Mach. Intell. 3, 93-95 (1981).
8. H. Samet, Application of Spatial Data Structure: Computer Graphics, Image processing, and GIS, pp. 116-143. Addison-Wesley, Reading, Massachussetts (1990).
9. C. A. Shaffer and H. Samet, Optimal quadtree construction algorithms, Comput. Vis. Graphic Image Process. 37, 402-419 (1987).
10. A. R. Butz, Convergence with Hilbert's space filling curve, J. Comput. Syst. Sci. 3, 128-146 (1969).
11. A. R. Butz, Alternative algorithm for Hilbert's space-filling curve, IEEE Trans. Comput. 424-426 (1971).
12. R. Miller, V. K. P. Kumar, D. Reisis and Q. F. Stout, Meshes with reconfigurable buses, Proc. MIT Conf. Adv. Res. VLSI, 163-178 (1988).
13. R. Miller, V. K. P. Kumar, D. Reisis and Q. F. Stout, Data movement operations and applications on reconfigurable VLSI arrays, Proc. Intl. Conf. Parallel Process. 1, 205-208 (1988).
14. H. Li and M. Maresca, Polymorphic-torus network, IEEE Trans. Comput. 38(9), 1345-1351 (1989).
15. H. Li and M. Maresca, Polymorphic-torus architecture for computer vision, IEEE Trans. Pattern Anal. Mach. Intell. 11(3), 233-243 (1989).
16. S. Olariu, J. L. Schwing and J. Zhang, Fundamental data movement algorithms for reconfigurable mesh, Proc. 11th Ann. Intl. Phoenix Conf. Comput. Commun. pp. 480-484, Scottsdale, Arizona (1992).
17. S. Olariu, J. L. Schwing and J. Zhang, Fast computer vision algorithms for reconfigurable mesh, Image Vis. Comput. 10(9), 610-616 (1992).
18. G. H. Chen, B. F. Wang and H. Li, Deriving algorithms on reconfigurable networks based on function decomposition, Theoret. Comput. Sci. 120, 215-227 (1993).
19. B. F. Wang, G. H. Chen and F. C. Lin, Constant time sorting on a processor array with a reconfigurable bus system, Inf. Process. Lett. 34(4), 187-192 (1990).