1 / 19

Application: Signal Compression

Application: Signal Compression. Jyun-Ming Chen Spring 2001. 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.

doctor
Download Presentation

Application: Signal Compression

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Application:Signal Compression Jyun-Ming Chen Spring 2001

  2. 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

  3. A function can be represented by linear combinations of any basis functions different bases yields different representation/approximation Wavelet Compression

  4. Compression is defined by finding a smaller set of numbers to approximate the same function within the allowed error Wavelet Compression (cont)

  5. Wavelet Compression • : permutation of 1, …, m, then • L2 norm of approximation error Assuming orthonormal basis

  6. 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

  7. Results of Coarse Approximations (using Haar wavelets)

  8. 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

  9. Application:Denoising Signals

  10. 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

  11. 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

  12. Results (Haar) • Depend on how the wavelet transform compact the signal

  13. Haar vs. Coif30

  14. Choosing a Threshold Value Transform preserves the Gaussian nature of the noise

  15. Removing Pop andBackground Static • See description on pp. 63-4

  16. Types of Thresholding

  17. Soft vs. Hard Threshold on Image Denoising

  18. Measure amount of error between noisy data and the original Aim to provide quantitative evidence for the effectiveness of noise removal Wavelet-based measure Quantitative Measure of Error

  19. Error Measures (cont)

More Related