paper-with-me

홈 › Papers

Bias and variance reduction and denoising for CTF Estimation

2019-08-09 · Ayelet Heimowitz, Joakim andén, Amit Singer

When using an electron microscope for imaging of particles embedded in vitreous ice, the objective lens will inevitably corrupt the projection images. This corruption manifests as a band-pass filter on the micrograph. In addition, it causes the phase of several frequency bands to be flipped and distorts frequency bands. As a precursor to compensating for this distortion, the corrupting point spread function, which is termed the contrast transfer function (CTF) in reciprocal space, must be estimated. In this paper, we will present a novel method for CTF estimation. Our method is based on the multi-taper method for power spectral density estimation, which aims to reduce the bias and variance of the estimator. Furthermore, we use known properties of the CTF and of the background of the power spectrum to increase the accuracy of our estimation. We will show that the resulting estimates capture the zero-crossings of the CTF in the low-mid frequency range.

📄 PDF Abstract BibTeX arXiv:1908.03454

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingDensity Estimation

Similar Papers 제목 키워드 기반

Robust Recommendation from Noisy Implicit Feedback: A GMM-Weighted Bayes-label Transition Matrix Framework

2026-05-20 · Zongyu Li, Xuanyu Liu, Gongce Cao, Shirui Sun 외 arxiv

Learning from implicit feedback in recommender systems is fundamentally challenged by pervasive label noise. While conventional denoising approaches often discard noisy instances to ensure robustness, this strategy inevi…

Refining Covariance Matrix Estimation in Stochastic Gradient Descent Through Bias Reduction

2026-04-23 · Ziyang Wei, Wanrong Zhu, Jingyang Lyu, Wei Biao Wu arxiv

We study online inference and asymptotic covariance estimation for the stochastic gradient descent (SGD) algorithm. While classical methods (such as plug-in and batch-means estimators) are available, they either require …

Variance Reduction in Gradient Exploration for Online Learning to Rank

2019-06-10 · Huazheng Wang, Sonwoo Kim, Eric McCord-Snook, Qingyun Wu 외

Online Learning to Rank (OL2R) algorithms learn from implicit user feedback on the fly. The key of such algorithms is an unbiased estimation of gradients, which is often (trivially) achieved by uniformly sampling from th…

Learning-To-Rank

Reward-estimation variance elimination in sequential decision processes

2018-11-15 · Sergey Pankov

Policy gradient methods are very attractive in reinforcement learning due to their model-free nature and convergence guarantees. These methods, however, suffer from high variance in gradient estimation, resulting in poor…

Policy Gradient MethodsReinforcement Learning

Kronecker Sum Decompositions of Space-Time Data

2013-07-27 · Kristjan Greenewald, Theodoros Tsiligkaridis, Alfred O. Hero III

In this paper we consider the use of the space vs. time Kronecker product decomposition in the estimation of covariance matrices for spatio-temporal data. This decomposition imposes lower dimensional structure on the est…