Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Development and verification of the coaxial heterogeneous hyperspectral imaging system.

The Review of scientific instruments·2022

Same author

Findings from the first public COVID-19 temporary test centre in Hong Kong.

Hong Kong medical journal = Xianggang yi xue za zhi·2021

Same author

First Report of Leaf Spot Disease Caused by Exserohilum rostratum on Pineapple in Hainan Province, China.

Plant disease·2019

Same author

Nanoscale Removal of Picosecond Laser Ablation for Polymer.

Journal of nanoscience and nanotechnology·2018

Same author

The influence of dehydration on the prognosis of acute ischemic stroke for patients treated with tissue plasminogen activator.

BMC cardiovascular disorders·2017

Same author

A latent profile analysis on patient empowerment programme in a Hong Kong primary care setting.

Patient education and counseling·2017

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Lensless Fluorescent Microscopy on a Chip

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

Space-filling approach for fast window query on compressed images.

K L Chung¹, Y H Tsai, F C Hu

¹Department 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

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|February 12, 2008

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.

More Related Videos

Applying Hyperspectral Reflectance Imaging to Investigate the Palettes and the Techniques of Painters

Applying Hyperspectral Reflectance Imaging to Investigate the Palettes and the Techniques of Painters

Published on: June 18, 2021

Related Experiment Videos

Last Updated: Jul 7, 2026

Lensless Fluorescent Microscopy on a Chip

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

Applying Hyperspectral Reflectance Imaging to Investigate the Palettes and the Techniques of Painters

Applying Hyperspectral Reflectance Imaging to Investigate the Palettes and the Techniques of Painters

Published on: June 18, 2021

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.