Related Experiment Video
Updated: Jul 19, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
A fast and effective model for wavelet subband histograms and its application in texture image retrieval
Ming Hong Pi1, C S Tong, Siu Kai Choy
1Department of Computing Science, University of Alberta, Edmonton, Canada. minghong@cs.ualberta.ca
Summary
This study introduces a new image signature method using bit-plane probabilities from wavelet subbands. This efficient technique enhances image retrieval in compressed formats like JPEG2000.
Area of Science:
- Digital image processing
- Signal processing
- Computer vision
Background:
- Wavelet transforms are widely used for image compression and analysis.
- Existing image retrieval methods often require uncompressed data or have high computational costs.
- Compression domain analysis offers potential for efficient retrieval.
Purpose of the Study:
- To propose a novel and efficient method for characterizing wavelet subbands.
- To develop a new image signature based on bit-plane probabilities.
- To enable effective image retrieval in the compression domain, particularly for JPEG2000 images.
Main Methods:
- Characterization of wavelet subbands through bit-plane extraction.
- Association of each bit plane with the probability of 1-bit occurrence.
- Concatenation of bit-plane probabilities to form a unique image signature.
- Direct signature extraction from the code-block code-stream.
Main Results:
- The proposed image signatures require less storage and computational power.
- Experimental results demonstrate superior cost-effectiveness compared to existing methods.
- The method shows high efficacy in texture image retrieval.
- Signatures are adaptable for compression domain image retrieval (e.g., JPEG2000).
Conclusions:
- The bit-plane probability-based signature is an effective and efficient method for image characterization.
- This approach offers significant advantages for image retrieval in compressed formats.
- The proposed method is a cost-effective alternative to current state-of-the-art techniques.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Histogram
The histogram is a graphical representation in the x-y form of data distribution in a data set. The horizontal x-axis is labeled with what the data represents (for instance, distance from your home to school). The vertical y-axis is labeled either frequency or relative frequency (or percent frequency or probability).
A histogram graph consists of contiguous (adjoining) boxes. The heights of the bars correspond to frequency values. The graph will have the same shape with respective labels. The...
A histogram graph consists of contiguous (adjoining) boxes. The heights of the bars correspond to frequency values. The graph will have the same shape with respective labels. The...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Continuous -time Fourier Transform
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
Bandpass Sampling
In signal processing, bandpass sampling is an effective technique for sampling signals that have most of their energy concentrated within a narrow frequency band. This type of signal is known as a bandpass signal. The key principle of bandpass sampling involves sampling the signal at a rate that is greater than twice the signal's bandwidth to prevent aliasing.
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
Relative Frequency Histogram
The relative frequency depicts the proportion of data points that have each value. The frequency tells the number of data points that have each value. Like the histogram, a relative frequency histogram also has the same shape with a horizontal scale (the x-axis), but the vertical scale (the y-axis) is marked with relative frequencies (percentages of the whole) instead of actual frequencies. A relative frequency histogram is a graphical representation of a frequency distribution where the...
