| 書目名稱 | Efficient Algorithms for Discrete Wavelet Transform |
| 副標(biāo)題 | With Applications to |
| 編輯 | K. K. Shukla,Arvind K. Tiwari |
| 視頻video | http://file.papertrans.cn/303/302959/302959.mp4 |
| 概述 | Describes a mathematical model to predict the errors introduced in the implementation of the discrete wavelet transform (DWT) on fixed-point processors.Explores the application of DWT on benchmark sig |
| 叢書名稱 | SpringerBriefs in Computer Science |
| 圖書封面 |  |
| 描述 | Due to its inherent time-scale locality characteristics, the discrete wavelet transform (DWT) has received considerable attention in signal/image processing. Wavelet transforms have excellent energy compaction characteristics and can provide perfect reconstruction. The shifting (translation) and scaling (dilation) are unique to wavelets. Orthogonality of wavelets with respect to dilations leads to multigrid representation. As the computation of DWT involves filtering, an efficient filtering process is essential in DWT hardware implementation. In the multistage DWT, coefficients are calculated recursively, and in addition to the wavelet decomposition stage, extra space is required to store the intermediate coefficients. Hence, the overall performance depends significantly on the precision of the intermediate DWT coefficients. This work presents new implementation techniques of DWT, that are efficient in terms of computation, storage, and with better signal-to-noise ratio in the reconstructed signal. |
| 出版日期 | Book 2013 |
| 關(guān)鍵詞 | Discrete Wavelet Transform; Efficient Algorithms; Error Analysis; Fuzzy Expert Systems; Image Processing |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4471-4941-5 |
| isbn_softcover | 978-1-4471-4940-8 |
| isbn_ebook | 978-1-4471-4941-5Series ISSN 2191-5768 Series E-ISSN 2191-5776 |
| issn_series | 2191-5768 |
| copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag London L |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 15:52
發(fā)表于 2025-3-21 16:28:35
