Ming-Ai (London) Institute © 2010 Ming-Ai (London) Institute.
Application: Signal Compression Jyun-Ming Chen Spring 2001.
-
Upload
conrad-harrell -
Category
Documents
-
view
224 -
download
0
Transcript of Application: Signal Compression Jyun-Ming Chen Spring 2001.
![Page 1: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/1.jpg)
Application:Signal Compression
Jyun-Ming Chen
Spring 2001
![Page 2: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/2.jpg)
Signal Compression
• Lossless compression– Huffman, LZW, arithmetic, run-length– Rarely more than 2:1
• Lossy Compression– Willing to accept slight inaccuracies
• Quantization/Encoding is not discussed here
![Page 3: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/3.jpg)
Wavelet Compression
• A function can be represented by linear combinations of any basis functions
• different bases yields different representation/approximation
![Page 4: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/4.jpg)
Wavelet Compression (cont)
• Compression is defined by finding a smaller set of numbers to approximate the same function within the allowed error
![Page 5: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/5.jpg)
Wavelet Compression
• : permutation of 1, …, m, then• L2 norm of approximation error
Assuming orthonormal bas
is
![Page 6: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/6.jpg)
Wavelet Compression
• If we sort the coefficients in decreasing order, we get the desired compression (next page)
• The above computation assumes orthogonality of the basis function, which is true for most image processing wavelets
![Page 7: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/7.jpg)
Results of Coarse Approximations (using Haar wavelets)
![Page 8: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/8.jpg)
Significance Map
• While transmitting, an additional amount of information must be sent to indicate the positions of these significant transform values
• Either 1 or 0– Can be effectively compressed (e.g., run-length)
• Rule of thumb:– Must capture at least 99.99% of the energy to produce
acceptable approximation
![Page 9: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/9.jpg)
Application:Denoising Signals
![Page 10: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/10.jpg)
Types of Noise
• Random noise– Highly oscillatory– Assume the mean to be zero
• Pop noise– Occur at isolated locations
• Localized random noise– Due to short-lived disturbance in the
environment
![Page 11: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/11.jpg)
Thresholding
• For removing random noise• Assume the following conditions hold:
– Energy of original signal is effectively captured by values greater than Ts
– Noise signal are transform values below noise threshold Tn
– Tn < Ts
• Set all transformed value less than Tn to zero
![Page 12: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/12.jpg)
Results (Haar)• Depend on how the wavelet transform compact
the signal
![Page 13: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/13.jpg)
Haar vs. Coif30
![Page 14: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/14.jpg)
Choosing a Threshold Value
Transform preserves the Gaussian nature of the noise
![Page 15: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/15.jpg)
Removing Pop andBackground Static
• See description on pp. 63-4
![Page 16: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/16.jpg)
Types of Thresholding
![Page 17: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/17.jpg)
Soft vs. Hard Threshold on Image Denoising
![Page 18: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/18.jpg)
Quantitative Measure of Error
• Measure amount of error between noisy data and the original
• Aim to provide quantitative evidence for the effectiveness of noise removal
• Wavelet-based measure
signal edcontaminat:fsignal original:s
noise:nnsf
![Page 19: Application: Signal Compression Jyun-Ming Chen Spring 2001.](https://reader030.fdocuments.us/reader030/viewer/2022033101/56649f535503460f94c787cb/html5/thumbnails/19.jpg)
Error Measures (cont)
image original:f
imagenoisy :g
size image :,NM