Space-filling approach for fast window query on compressed images

IEEE Transactions on Image Processing

Volumn 9, Issue 12, 2000, Pages 2109-2116

  Chung, Kuo Liang ^a   Tsai, Yao Hong ^a   Hu, Fei Ching ^a  

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

Author keywords

Compressed images; Hilbert scan; Image data base; Maximal quadtree blocks; Space filling curve; Window query

Indexed keywords

EID: 0001009341     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.887978     Document Type: Article

References (30)

1. C. Arcelli and G. Ramella, "Feature points for a polygonal representation of silhouettes," in Progress in Image Analysis and Processing II. Singapore: World Scientific, Sept. 1991, pp. 107-114.
2. W. G. Aref and H. Samet, "Efficient processing of window queries in the pyramid data," in Proc. 9th ACM-SIGMOD Symp. Principles Database Systems, Apr. 1990, pp. 265-272.
3. W. G. Aref and H. Samet, "Decomposing a window into maximal quadtree blocks," Acta Inform., vol. 30, pp. 425-439, 1993.
4. T. Asano, D. Ranjan, T. Roos, and E. Welzl, "Space-filling curves and their use in the design of geometric data structures," Theor. Comput. Sci., vol. 181, pp. 3-15, 1997.
5. T. Bially, "Space-filling curves: Their generation and their application to bandwidth reduction," IEEE Trans. Inform. Theory, vol. IT-15, no. 6, pp. 658-664, 1969.
6. N. Bourbakis and C. Alexopoulos, "Picture data encryption using scan patterns," Pattern Recognit., vol. 25, no. 6, pp. 567-581, 1992.
7. G. Cantor, "Ein Beitrag zur Mannigfaltigkeitslehre," Crelle J., vol. 84, pp. 242-258, 1878.
8. K. L. Chung and L. C. Chang, "Encrypting binary images with higher security," Pattern Recognit. Lett., vol. 19, pp. 461-468, 1998.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
10. J. G. Dunham, "Optimal uniform piecewise linear approximation of planar curves,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 1, pp. 67-75, 1986.
11. C. R. Dyer, "The space efficiency of quadtrees," Comput. Graph. Image Process., vol. 19, no. 4, pp. 335-348, 1982.
12. D. Hilbert, "Über die stetige Abbildung einer Linie auf ein Flächenstück," Math. Ann., vol. 38, pp. 459-460, 1891.
13. H. V. Jafadish, "Analysis of the Hilbert curve for representing two-dimensional space," Inform. Process. Lett., vol. 62, pp. 17-22, 1997.
14. F. C. Jian, "Hilbert curves and its applications on image processing," M.S. thesis, Dept. Elect. Eng., Nat. Taiwan Univ., Taiwan, R.O.C., June 1996.
15. S. Kamata, M. Niimi, and E. Kawaguchi, "A method of an interactive analysis for multi-dimensional images using a Hilbert curve," IEICE Trans., vol. J77-D-II, no. 7, pp. 1255-1264, 1993.
16. S. Kamata, R. O. Eaxon, and E. Kawaguchi, "An implementation of the Hilbert scanning algorithm and its application to data compression," IEICE Trans. Inform. Syst., vol. E76-D, no. 4, 1993.
17. S. Kamata, M. Niimi, and E. Kawaguchi, "A gray image compression using a Hilbert scan," in Proc. Int. Conf. Pattern Recognition '96, 1996.
18. H. Lebesgue, Leçons sur l'Intégration et la Recherche des Fonctions Primitives. Paris, France: Gauthier-Villars, 1904, pp. 44-45.
19. X. Liu and G. F. Schrack, "Encoding and decoding the Hilbert order," Softw. Pract. Exper., vol. 26, no. 12, pp. 1335-1346, 1996.
20. X. Liu and G. F. Schrack, "An algorithm for encoding and decoding the 3-D Hilbert order," IEEE Trans. Image Processing, vol. 6, pp. 1333-1337, Sept. 1997.
21. E. H. Moore, "On certain crinkly curves," Trans. Amer. Math. Soc., vol. 1, pp. 72-90, 1900.
22. E. Nardelli, "Efficient secondary memory processing of window queries on spatial data," Inform. Sci., vol. 84, pp. 67-83, 1995.
23. E. Nardelli and G. Proietti, "Time and space efficient secondary memory representation of quadtrees, "Inform. Syst., vol. 22, pp. 25-37, 1997.
24. G. Peano, "Sur une courbe qui remplit toute une aire plane," Math. Ann., vol. 36, pp. 157-160, 1890.
25. M. K. Quweider and E. Salari, "Peano scanning partial distance search for vector quantization," IEEE Signal Processing Lett., vol. 2, pp. 169-171, Sept. 1995.
26. C. S. Refazzoni and A. Teschioni, "A new approach to vector median filtering based on space filling curves," IEEE Trans. Image Processing, vol. 6, pp. 1025-1037, July 1997.
27. H. Sagan, Space-Filling Curves. New York: Springer-Verlag, 1994.
28. R. J. Stevens, A. F. Lehar, and F. H. Preston, "Manipulation and presentation of multidimensional image data using the peano scan," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 520-526, 1983.
29. Y. H. Tsai, K. L. Chung, and Y. H. Yang, "Optimal algorithm for decomposing a query window into maximal quadtree blocks," Dept. Inform. Manage. Inst. Inform. Eng., Nat. Taiwan Univ. Sci. Technol., Res. Rep., June 1998.
30. Y. F. Zhang, "Space-filling curve ordered dither," Comput. Graph., vol. 22, no. 4, pp. 559-563, 1998.