The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Nonlinear approximation and the space BV[inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="01i" /]
Abstract
.Given a function f 2 L 2 (Q), Q := [0; 1)² and a real number t ? 0, let U(f; t) := inf g2BV(Q) kf \\Gamma gk 2 L 2 (I) + t VQ (g); where the infimum is taken over all functions g 2 BV of bounded variation on I. This and related extremal problems arise in several areas of mathematics such as interpolation of operators and statistical estimation, as well as in digital image processing. Techniques for finding minimizers g for U(f; t) based on variational calculus and nonlinear partial differential equations have been put forward by several authors ([DMS], [LOR], [MS], [CL]). The main disadvantage of these approaches is that they are numerically intensive. On the other hand, it is well-known that more elementary methods based on wavelet shrinkage solve related extremal problems, for example, the above problem with BV replaced by the Besov space B 1 1 (L 1 (I)) (see e.g. [CDLL]). However, since BV has no simple description in terms of wavelet coefficients, it is not clear that mi...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Sparse geometric image representations with bandelets
Le Pennec, E., & Mallat, S. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.843753 · Cited by 860
Euler's Elastica and Curvature-Based Inpainting
Shen, J., Kang, S. H., & Chan, T. F. (2003) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139901390088 · Cited by 609
Metadata
- Authors
- Cohen, A., DeVore, R., Petrushev, P., & Xu, H.
- Venue
- American Journal of Mathematics
- Publisher
- Project MUSE
- Published
- 1999-06
- Volume
- 121
- Issue
- 3
- Pages
- 587-628
- ISSN
- 0002-9327 (ISSN-L)
- 1080-6377
- OpenAlex
- W1985517056
- Cited by
- 216
- References
- 1
- FWCI
- 5.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.