Download
1 / 15
150 likes | 357 Views
Wavelet Signal Processing:. of Video Signals. Compression. What is a Wavelet?. A wavelet is a function that has finite energy and has an average of zero. Here are some examples of mother wavelets:. Haar Wavelet. Daubechie’s 4 Wavelet. Daubechie’s 6 Wavelet.
E N D
Wavelet Signal Processing: of Video Signals Compression
What is a Wavelet? A wavelet is a function that has finite energy and has an average of zero. Here are some examples of mother wavelets: Haar Wavelet Daubechie’s 4 Wavelet Daubechie’s 6 Wavelet Daubechie’s mother wavelets are like fractals: the smaller portions mimic the original wavelet.
Why use Wavelets? Wavelets are used within the fields of electrical engineering, mathematics, quantum physics, seismic geology, astronomy, neurophysiology, nuclear engineering, optics and music. More specifically, wavelets are used for sub-band coding, signal and image processing, denoising noisy data, detecting self similarity in a time series, and our favourite, compression. Wavelets give us the ability to cut up the data into different frequency components, which can be matched to the scale or size of the function. Sine and cosine functions extend in either direction to infinity, however, wavelets are just for a small portion of time, and are called local. Since wavelets are local we can approximate functions that have spikes, irregularities or are choppy. To use wavelets for compression, a mother wavelet, such as a Haar or Daubechie’s 4 or 6, is selected. To get the best compression, we want to use the wavelet that gives us the greatest number of zeros, while still preserving original picture quality. Thus we tested three different mother wavelets for our project, and Daubechie’s 6 gave us the best results.
Design Specifications • For Compression: • Input: Pure Video Data from Planar YUV 4:2:0 files • Output: Compressed File • Desired Compression Ratio: around 10:1…this may vary between samples • Maximum Loss: Loss should be kept to a minimum, almost visually lossless • For Decompression • Input: Compressed File • Output: Pure Video Data • Decompression algorithm must be able to reverse all encoding done during compression
Design Achievements • Compression Results: • Input: Pure Video Data from Planar YUV 4:2:0 files • Output: Compressed File • Compression Ratio: around 5 to 1 • Decompression Results: • Input: Compressed File • Output: Pure Video Data • Uncompressed file may be played and viewed with almost the same quality as original
The Design Decompression: a) Load the .kmw file b) Decode the data c) Perform Inverse Wavelet Transform in three dimensions d) Save video data to a new file Compression: a) Load the file b) Perform Wavelet Transform in three dimensions c) Encode the data d) Save data to a new file (*.kmw)
Wavelet choice Video file(s) Load_Files Transform Block Load Data Block Memory Filter Main Program Encode Compressed File Software Layout For Compression Algorithm
Compressed File Decode Load Wavelet choice Memory Inverse Transform Main Program Raw Video File Filter Software Layout For Decompression Algorithm
Transform Filter along y Filter along x Mother Wavelet Filter = ? Filter along t Choose Haar Wavelet Transform Algorithm for Three Dimensions
Inverse Transform Filter along x Filter along y Mother Wavelet Filter = ? Filter along t Choose Haar Wavelet Inverse Transform Algorithm for Three Dimensions
Encoding Process To encode the data, first we quantized our numbers. To quantize one must divide by the maximum value of the data, and multiply by 2bits used.Then we reduced the number of bits for each filtered data point. Depending on the set of data, and its importance, we keep a certain number of bits, one for the sign, and the other for data. We will also note the maximum value of the data, so that decoding will be easier. When we quantize and reduce the number of bits for the data we are losing information, so we will have a lossy compression. 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 The next part of the encode process removed bytes of zeros, and bytes that had a value of one, and replaced them with two bit. This process was iterated as long as the size of the file would be smaller.
Filtering A0 B0 C0 D0 2 2 {…f2, f1, f0} E + A1 B1 C1 D1 2 2 A one dimensional Haar Filter Signals:
3-D Filtering Filter H0H0H0 2 Filter H0H0 2 Filter H0H0H1 2 Filter H0 2 Filter H0H1H0 2 Filter H0H1 2 Filter H0H1H1 2 DATA Filter H1H0H0 2 Filter H1H0 2 Filter H1H0H1 2 Filter H1 2 Filter H1H1H0 2 Filter H1H1 2 Filter H1H1H1 2 X-DIRECTION Y-DIRECTION T-DIRECTION
3-D Filtering Filter F0F0F0 2 2 Filter F0F0 Filter F0F0F1 2 2 Filter F0 Filter F0F1F0 2 2 Filter F0F1 Filter F0F1F1 2 + 2 Filter F1F0F0 Filter F1F0 2 Filter F1F0F1 2 2 Filter F1 2 Filter F1F1H0 2 Filter F1F1 X-DIRECTION 2 Filter F1F1F1 Y-DIRECTION T-DIRECTION
Video File Format Our video file format is Planar YUV 4:2:0. This video files comes from the MPEG format, so the video clip is already compressed. This made our task more difficult, as there is little room for improvement. Planar YUV 4:2:0 is broken down into luminance (Y) and red (U) and blue (V) chrominance parts. This is because the human eye does not detect a big difference between colour as it does between light and dark. The original picture is 720 by 480. The luminance is 720 by 480, and each of the chrominance is 360*240. The video clip we have is from the start of the movie “Eyes Wide Shut”. It contains a part with the opening credits, a brighter portion and a darker portion. This should give us unbiased results for our compression ratio.
