(قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم) - PowerPoint PPT Presentation

slide1 n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
(قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم) PowerPoint Presentation
Download Presentation
(قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم)

play fullscreen
1 / 34
(قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم)
976 Views
Download Presentation
nicole
Download Presentation

(قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم)

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. (قالوا سبحانك لا علم لنا الإ ما علمتنا إنك أنت العليم الحكيم) صدق الله العظيم سورة البقرة آيه 32

  2. Speech Compression Using Wavelet Packets Tree Nodes LPC Encoding and Best Tree Encoding (BTE) Features Presented by: Eng. Mohammed Yahia Mohammed

  3. Author Dr: Amr R. Gody Electrical Engineering Department Faculty of Engineering, Fayoum University Dr: Safy Ahmed Department of Engineering, Nuclear Research Center, Atomic Energy Authority, Egypt Dr: Tamer M. Barakat Electrical Engineering Department Faculty of Engineering, Fayoum University

  4. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) ProposedSystem 4 ExperimentsandResults Conclusion FutureWork

  5. OUTLINE Problem Description 5

  6. Problem Description Speech compression is one of the major areas in speech processing. Speech compression is a process of converting human speech into efficient encoded representations that can be decoded to produce a close approximation of the original signal. speech compression makes it possible for more users to share the available system. speech compression is needed in digital voice storage. compression makes it possible to store longer messages

  7. OUTLINE Problem Description Wavelet Packet Decomposition 7

  8. Wavelet Packet Decomposition Wavelet function is finite in time. It is also finite in frequency

  9. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) 9

  10. Best Tree Encoding (BTE)

  11. Best Tree Encoding (BTE)

  12. Best Tree Encoding (BTE)

  13. Best Tree Encoding (BTE) • Apply the encoding by considering clusters of 7 bands. • Each cluster will be encoded in 7 bits such that each bit is associated to a certain band.

  14. Best Tree Encoding (BTE) Apply the best tree algorithm to optimize the full binary tree. The optimization minimizes the number of tree nodes such that it best fit the information included in the speech signal.

  15. Best Tree Encoding (BTE) Real Example For one Frame BTE Code

  16. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) ProposedSystem 16

  17. ProposedSystem Encoder process

  18. ProposedSystem WPDEC Encoder process Speech Timewaveform Best Tree LPC for eachLeaf BTE

  19. ProposedSystem De-coder process BTE Decoder LPC Inverse Filters WPREC Speech Timewaveform

  20. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) ProposedSystem 20 ExperimentsandResults

  21. ExperimentsandResults • Three real speeches (male spoken, female spoken, music) have been used. • The encoding algorithm is compared with the original speech files using SNR, MSE and SD. • These experimental results were done on a PC with an Intel CORE i7 processor and 4 Mb RAM. • Using Daubechieswavelet family and using level 4 to decompose the speech signal.

  22. ExperimentsandResults Signal to Noise Ratio : Mean Square Error : Spectral distortion : Compression Ratio (CR) :

  23. ExperimentsandResults Output CR, SNR, MSE and SD for all wavelet filter for male speech

  24. ExperimentsandResults Output CR, SNR, MSE and SD for all wavelet filter for female speech

  25. ExperimentsandResults Output CR, SNR, MSE and SD for all wavelet filter for music speech

  26. ExperimentsandResults Output Waveform of male spoken with db4

  27. ExperimentsandResults Output Waveform of female spoken with db4

  28. ExperimentsandResults Output Waveform of music with db4

  29. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) ProposedSystem 29 ExperimentsandResults Conclusion

  30. Conclusion • The problem of having dynamic size feature vectors is solved by considering the 4 points encoding algorithm. • The negative value of SNR in the obtained results is due to some factors that will be considered in future work. • The main objective of this research is to explore the validity of BTE in such compression application. • Speech understanding was our target but not the quality of the produced speech.

  31. OUTLINE Problem Description Wavelet Packet Decomposition Best Tree Encoding (BTE) ProposedSystem 31 ExperimentsandResults Conclusion FutureWork

  32. FutureWork • Considering of the proper filter excitation source in the inverse LPC filter. • Speech quality will be our target.