Efficient Multidimensional Diracs Estimation With Linear Sample Complexity

DOI10.1109/TSP.2018.2858213zbMATH Open1415.94033OpenAlexW2883797206WikidataQ129494021 ScholiaQ129494021MaRDI QIDQ4622366FDOQ4622366

Authors Hanjie Pan, Thierry Blu, Martin Vetterli

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2018.2858213

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Efficient estimation of linear functionals of principal components
• Efficient estimation in sufficient dimension reduction
• Sample-optimal density estimation in nearly-linear time
• Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
• Efficient Sampling for Gaussian Linear Regression With Arbitrary Priors
• Vector efficiency in multiparameter estimation
• Optimal multilinear estimation of a random vector under constraints of causality and limited memory
• A fast mode estimator in multidimensional space
• Near-optimal sampling strategies for multivariate function approximation on general domains
• Fast and efficient computation of directional distance estimators

Cited in

(1)

• Optimal multilinear estimation of a random vector under constraints of causality and limited memory

This page was built for publication: Efficient Multidimensional Diracs Estimation With Linear Sample Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622366)