Space-filling approach for fast window query on compressed images.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 18262948.
- Also identified by DOI 10.1109/83.887978.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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 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.