Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Informatika i Ee Primeneniya [Informatics and its Applications], 2021, Volume 15, Issue 3, Pages 51–56
DOI: https://doi.org/10.14357/19922264210307
(Mi ia743)
 

This article is cited in 2 scientific papers (total in 2 papers)

Thresholding functions in the noise suppression methods based on the wavelet expansion of the signal

O. V. Shestakovabc

a Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
b Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
c Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
Full-text PDF (166 kB) Citations (2)
References:
Abstract: When transmitted over communication channels, signals are usually contaminated with noise. Noise suppression methods based on thresholding of wavelet expansion coefficients have become popular due to their simplicity, speed, and ability to adapt to nonstationary signals. The analysis of the errors of these methods is an important practical task, since it makes it possible to assess the quality of both the methods themselves and the equipment used for processing. The most popular types of thresholding are hard and soft thresholding but each has its own drawbacks. In an attempt to address these shortcomings, various alternative thresholding methods have been proposed in recent years. The paper considers a model of a signal contaminated with additive Gaussian noise and discusses the general formulation of the thresholding problem with a thresholding function belonging to a certain class. An algorithm for calculating the threshold that minimizes the unbiased risk estimate is described. Conditions are also given under which this risk estimate is asymptotically normal and strongly consistent.
Keywords: wavelets, thresholding, adaptive threshold, unbiased risk estimate.
Funding agency Grant number
Russian Foundation for Basic Research 19-07-00352
Ministry of Science and Higher Education of the Russian Federation 075-15-2019-1621
The work was partly supported by the Russian Foundation for Basic Research (project No. 19-07-00352). The paper was published with the financial support of the Ministry of Education and Science of the Russian Federation as a part of the Program of the Moscow Center for Fundamental and Applied Mathematics under agreement No. 075-15-2019-1621.
Received: 24.07.2021
Document Type: Article
Language: Russian
Citation: O. V. Shestakov, “Thresholding functions in the noise suppression methods based on the wavelet expansion of the signal”, Inform. Primen., 15:3 (2021), 51–56
Citation in format AMSBIB
\Bibitem{She21}
\by O.~V.~Shestakov
\paper Thresholding functions in~the~noise suppression methods based on~the~wavelet expansion of~the~signal
\jour Inform. Primen.
\yr 2021
\vol 15
\issue 3
\pages 51--56
\mathnet{http://mi.mathnet.ru/ia743}
\crossref{https://doi.org/10.14357/19922264210307}
Linking options:
  • https://www.mathnet.ru/eng/ia743
  • https://www.mathnet.ru/eng/ia/v15/i3/p51
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:129
    Full-text PDF :50
    References:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024