REVIEW 1 cited by
Approximation Theory of Total Variation Minimization for Data Completion
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Approximation Theory of Total Variation Minimization for Data Completion
read the original abstract
Total variation (TV) minimization is one of the most important techniques in modern signal/image processing, and has wide range of applications. While there are numerous recent works on the restoration guarantee of the TV minimization in the framework of compressed sensing, there are few works on the restoration guarantee of the restoration from partial observations. This paper is to analyze the error of TV based restoration from random entrywise samples. In particular, we estimate the error between the underlying original data and the approximate solution that interpolates (or approximates with an error bound depending on the noise level) the given data that has the minimal TV seminorm among all possible solutions. Finally, we further connect the error estimate for the discrete model to the sparse gradient restoration problem and to the approximation to the underlying function from which the underlying true data comes.
Forward citations
Cited by 1 Pith paper
-
Exponential-Family Tensor Completion via Nonconvex Dual Total-Variation Regularization
Introduces nonconvex dual-TV regularizers based on transformed L1 for exponential-family tensor completion and proves error bounds of order O(n3 rt (max sk^2) log / n) that approach minimax rates up to O(max sk^2 / ma...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.