The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
Open accessAbstract
We consider the problem of decomposing a signal into a linear combination of features, each a continuously translated version of one of a small set of elementary features. Although these constituents are drawn from a continuous family, most current signal decomposition methods rely on a finite dictionary of discrete examples selected from this family (e.g., shifted copies of a set of basic waveforms), and apply sparse optimization methods to select and solve for the relevant coefficients. Here, we generate a dictionary that includes auxiliary interpolation functions that approximate translates of features via adjustment of their coefficients. We formulate a constrained convex optimization problem, in which the full set of dictionary coefficients represents a linear approximation of the signal, the auxiliary coefficients are constrained so as to only represent translated features, and sparsity is imposed on the primary coefficients using an L1 penalty. The basis pursuit denoising (BP) method may be seen as a special case, in which the auxiliary interpolation functions are omitted, and we thus refer to our methodology as continuous basis pursuit (CBP). We develop two implementations of CBP for a one-dimensional translation-invariant source, one using a first-order Taylor approximation, and another using a form of trigonometric spline. We examine the tradeoff between sparsity and signal reconstruction accuracy in these methods, demonstrating empirically that trigonometric CBP substantially outperforms Taylor CBP, which, in turn, offers substantial gains over ordinary BP. In addition, the CBP bases can generally achieve equally good or better approximations with much coarser sampling than BP, leading to a reduction in dictionary dimensionality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
Fast Discrete Curvelet Transforms
Candès, E., Demanet, L., Donoho, D., & Ying, L. (2006) · Multiscale Modeling & Simulation · doi:10.1137/05064182x · Cited by 2,573
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“These methods are exemplified by the wellknown “matching pursuit” algorithm of Mallat and Zhang [14], and include a variety of more recent “iterative thresholding” methods [15], [16], [17], [18], [19].”
Method
Cited by
Channel Estimation and Hybrid Precoding for Millimeter Wave Cellular Systems
Alkhateeb, A., El Ayach, O., Leus, G., & Heath, R. W. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2334278 · Cited by 2,562
Efficient Algorithms for Convolutional Sparse Representations
Wohlberg, B. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2495260 · Cited by 413
Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors
Li, Y., & Chi, Y. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2496294 · Cited by 294
Metadata
- Authors
- Ekanadham, C., Tranchina, D., & Simoncelli, E. P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2011-10
- Volume
- 59
- Issue
- 10
- Pages
- 4735-4744
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2143148420
- Cited by
- 205
- References
- 3
- FWCI
- 14.52
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit. https://app.cochat.ai/papers/10.1109/tsp.2011.2160058
- The paper
- Ekanadham, C., Tranchina, D., & Simoncelli, E. P. (2011). Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2011.2160058
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.