نتایج جستجو برای: sparse code shrinkage enhancement method

تعداد نتایج: 1924896  

2014
Diksha Sharma Rupinder Kaur

One implicit assumption the speech enhancement algorithms is that the representation of speech in a transform domain or over a redundant dictionary is sparse, while that of noise is dense. Based on this assumption, clean speech can be recovered by finding the sparse representations. However, some kinds of noise are also found sparse in the above representation scenarios, which results in degrad...

Journal: :IEEE Open Journal of the Communications Society 2021

1999
Hsin-Cheng Huang Noel Cressie

Wavelet shrinkage methods, introduced by Donoho and John-, are a powerful way to carry out signal denoising, especially when the underlying signal has a sparse wavelet representation. Wavelet shrinkage based on the Bayesian approach involves specifying a prior distribution for the wavelet coeecients. In this chapter, we consider a Gaussian prior with nonzero means for wavelet coeecients, which ...

Journal: :Inf. Process. Lett. 1996
Úlfar Erlingsson Mukkai S. Krishnamoorthy T. V. Raman

We present a new scheme for building static search trees, using multiway radix search. We apply this method to the problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three branches for the average search. We give timing results that show that in practice our method ru...

Journal: :CoRR 2017
Jean Barbier Mohamad Dia Nicolas Macris

Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the AWGN channel under optimal maximum-likelihood decoding as well as under various efficient iterative decoding schemes equipped with power alloca...

Journal: :CoRR 2015
Tsung-Yu Lin Tsung-Wei Ke Tyng-Luh Liu

We address the problem of converting large-scale highdimensional image data into binary codes so that approximate nearest-neighbor search over them can be efficiently performed. Different from most of the existing unsupervised approaches for yielding binary codes, our method is based on a dimensionality-reduction criterion that its resulting mapping is designed to preserve the image relationshi...

2012
M. BOUFENAR M. REZIG

Detection of the weak signature of degradation of the Reactor Coolant Pump (RCP) at early stage gives more time for maintenance reaction, safety decision-making and also provides economic benefits. An integrated and improved method to detect and identify abnormality using continuous wavelet transform based sparse code shrinkage de-noising algorithm is suggested in this work. For RCP roller bear...

Journal: :The KIPS Transactions:PartA 2005

2008
Zaiwen Wen Wotao Yin

where x ∈ R, A ∈ R, M ∈ R, and b ∈ R, and μ > 0 is the regularization parameter. It is based upon the active-set algorithm with a continuation strategy described in [1, 2]. FPC AS is a successor of FPC [3]. While FPC AS still performs shrinkage iterations and continuation as its predecessor, most of the code has been rewritten. Compared to FPC, which has good performance on large-scale problems...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید