Related Experiment Video
Updated: Jul 7, 2026
11:23
Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Space-filling approach for fast window query on compressed images
1Department of Information Management, Institute of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei 10672, Taiwan, ROC. klchung@cs.ntust.edu.tw
Summary
This study introduces a fast algorithm for window queries on compressed images using a space-filling approach. The new method significantly speeds up image data retrieval, showing 72-98% time improvement over naive methods.
Area of Science:
- Computer Science
- Image Processing
- Data Compression
Background:
- Window queries are essential for accessing data in compressed images.
- Existing naive algorithms for window queries are computationally intensive.
Purpose of the Study:
- To present a fast algorithm for window queries on compressed images.
- To improve the efficiency of image data retrieval.
Main Methods:
- Utilized a space-filling approach for algorithm design.
- Developed a novel algorithm with a time complexity of O(n1logT+P).
Main Results:
- The proposed algorithm achieves a significant time improvement compared to the naive approach.
- Experimental results demonstrate a 72-98% time reduction for window queries.
- The algorithm's efficiency is validated through computational advantage demonstrations.
Conclusions:
- The developed algorithm offers a computationally advantageous solution for window queries on compressed images.
- The space-filling approach provides a substantial speedup in image data processing.
