pith. sign in

arxiv: 0801.3490 · v1 · submitted 2008-01-23 · 🧮 math.ST · stat.TH

Beyond Thresholding: Analysis and Improvements for Deterministic Parameter Estimation

classification 🧮 math.ST stat.TH
keywords estimatorshard-thresholdpiecewise-linearthresholdinganalysisdeterministicestimationestimator
0
0 comments X
read the original abstract

Hard-threshold estimators are popular in signal processing applications. We provide a detailed study of using hard-threshold estimators for estimating an unknown deterministic signal when additive white Gaussian noise corrupts observations. The analysis, depending heavily on Cram{\'e}r-Rao bounds, motivates piecewise-linear estimation as a simple improvement to hard thresholding. We compare the performance of two piecewise-linear estimators to a hard-threshold estimator. When either piecewise-linear estimator is optimized for the decay rate of the basis coefficients, its performance is better than the best possible with hard thresholding.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.