Space-filling approach for fast window query on compressed images

Authors:
Kuo-Liang Chung;Yao-Hong Tsai;Fei-Ching Hu
Affiliations:
Dept. of Inf. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan;-;-
Venue:
IEEE Transactions on Image Processing
Year:
2000

Citing 0
Cited 7

A technique for fuzzy document binarization

DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
A Cross-Type Peak-and-Valley Filter for Error Prevention and Resilience in Image Communications

PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

Information Sciences: an International Journal
An N-Dimensional Pseudo-Hilbert Scan for Arbitrarily-Sized Hypercuboids

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An efficient algorithm for computing moments on a block representation of a grey-scale image

Pattern Recognition
A generalized 3-D Hilbert scan using look-up tables

Journal of Visual Communication and Image Representation
Blind evaluation of location based queries using space transformation to preserve location privacy

Geoinformatica

Quantified Score

Hi-index	0.01

Visualization

Abstract

Based on the space-filling approach, this paper presents a fast algorithm for window query on compressed images. Given a query window of size n1×n2, the proposed algorithm takes O(n1logT+P) time to perform the window query, where n1=max(n1, n2) and T×T is the image size; P is the number of outputted codes. The proposed algorithm improves the naive algorithm, which needs O(n1n2log T+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.