Space-filling approach for fast window query on compressed images

Based on the space-filling approach, this paper presents a fast algorithm for window query on compressed images. Given a query window of size n1xn2, the proposed algorithm takes O(n1logT+P) time to perform the window query, where n1=max(n1, n2) and TxT is the image size; P is the number of outputted codes. The proposed algorithm improves the naive algorithm, which needs O(n1n2logT+P) time, significantly. Some experimentations are carried out to demonstrate the computational advantage of the proposed algorithm. From the experimental results, it is observed that the proposed algorithm has about 72-98% time improvement when compared to the naive algorithm.

[1]  Günther F. Schrack,et al.  Encoding and decoding the Hilbert order , 1996 .

[2]  Carlo S. Regazzoni,et al.  A new approach to vector median filtering based on space filling curves , 1997, IEEE Trans. Image Process..

[3]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[4]  E. H. Moore.  On certain crinkly curves , 1900 .

[5]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[6]  Xian Liu,et al.  An algorithm for encoding and decoding the 3-D Hilbert order , 1997, IEEE Trans. Image Process..

[7]  Kuo-Liang Chung,et al.  Large encrypting binary images with higher security , 1998, Pattern Recognit. Lett..

[8]  Theodore Bially,et al.  Space-filling curves: Their generation and their application to bandwidth reduction , 1969, IEEE Trans. Inf. Theory.

[9]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Desh Ranjan,et al.  Space Filling Curves and Their Use in the Design of Geometric Data Structures , 1995, LATIN.

[11]  Enrico Nardelli,et al.  Time and Space Efficient Secondary Memory Representation of Quadtrees , 1997, Inf. Syst..

[12]  Michiharu Niimi,et al.  A gray image compression using a Hilbert scan , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[13]  Charles R. Dyer,et al.  The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[14]  Yuefeng Zhang,et al.  Space-filling curve ordered dither , 1998, Comput. Graph..

[15]  Enrico Nardelli,et al.  Efficient Secondary Memory Processing of Window Queries on Spatial Data , 1995, Inf. Sci..

[16]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[17]  H. Lebesgue,et al.  Lecons Sur L'Integration Et LA Recherche Des Fonctions Primitives , 1973 .

[18]  H. Sagan.  Space-filling curves , 1994 .

[19]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[20]  H. V. Jagadish,et al.  Analysis of the Hilbert Curve for Representing Two-Dimensional Space , 1997, Inf. Process. Lett..

[21]  Ezzatollah Salari,et al.  Peano scanning partial distance search for vector quantization , 1995, IEEE Signal Processing Letters.

[22]  G. Cantor,et al.  Ein Beitrag zur Mannigfaltigkeitslehre. , 1878 .

[23]  Michiharu Niimi,et al.  An interactive analysis method for multidimensional images using a Hilbert curve , 1995, Systems and Computers in Japan.

[24]  Walid G. Aref,et al.  Efficient processing of window queries in the pyramid data structure , 1990, PODS '90.

[25]  Sei-ichiro Kamata,et al.  An Implementation of the Hilbert Scanning Algorithm and Its Application to Data Compression (Special Issue on Image Processing and Understanding) , 1993 .

[26]  R. J. Stevens,et al.  Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Nikolaos G. Bourbakis,et al.  Picture data encryption using scan patterns , 1992, Pattern Recognit..