V. Melnik, K. Egiazarian, I. Shmulevich, P. Kuosmanen
{"title":"A tree of median pyramidal decompositions with an application to signal denoising","authors":"V. Melnik, K. Egiazarian, I. Shmulevich, P. Kuosmanen","doi":"10.1109/ICASSP.2000.861879","DOIUrl":null,"url":null,"abstract":"We propose to generate a library of median pyramidal decompositions organized as a tree. It is shown that the best decomposition on this tree can be chosen using the techniques developed in wavelet theory. Based on the tree of decompositions, a denoising algorithm is introduced. Numerical simulations have shown that the proposed algorithm is more effective for signal denoising than the method based on the traditional median pyramidal transform.","PeriodicalId":164817,"journal":{"name":"2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2000.861879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
We propose to generate a library of median pyramidal decompositions organized as a tree. It is shown that the best decomposition on this tree can be chosen using the techniques developed in wavelet theory. Based on the tree of decompositions, a denoising algorithm is introduced. Numerical simulations have shown that the proposed algorithm is more effective for signal denoising than the method based on the traditional median pyramidal transform.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
