The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution
Abstract
An algorithm is proposed for the reconstruction of a sparse spike train from an incomplete set of its Fourier components. It is shown that as little as 20-25 percent of the Fourier spectrum is sufficient in practice for a high-quality reconstruction. The method employs linear programming to minimize the L 1 -norm of the output, because minimization of this norm favors solutions with isolated spikes.Given a wavelet, this technique can be used to perform deconvolution of noisy seismograms when the desired output is a sparse spike series. Relative reliability of the data is assessed in the frequency domain, and only the reliable spectral data are included in the calculation of the spike series. Equations for the unknown spike amplitudes are solved to an accuracy compatible with the uncertainties in the reliable data. In examples with 10 percent random noise, the output is superior to that obtained using conventional least-squares techniques.
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
Deconvolution with the l 1 norm
Taylor, H. L., Banks, S. C., & McCoy, J. F. (1979) · Geophysics · doi:10.1190/1.1440921 · Cited by 436
Cited by
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Towards a Mathematical Theory of Super‐resolution
Candès, E. J., & Fernandez‐Granda, C. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21455 · Cited by 1,169
Uncertainty Principles and Signal Recovery
Donoho, D. L., & Stark, P. B. (1989) · SIAM Journal on Applied Mathematics · doi:10.1137/0149053 · Cited by 1,054
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Linear Inversion of Band-Limited Reflection Seismograms
Santosa, F., & Symes, W. W. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907087 · Cited by 713
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Non-linear inversion using general measures of data misfit and model structure
Farquharson, C. G., & Oldenburg, D. W. (1998) · Geophysical Journal International · doi:10.1046/j.1365-246x.1998.00555.x · Cited by 423
Exact Support Recovery for Sparse Spikes Deconvolution
Duval, V., & Peyré, G. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9228-6 · Cited by 300
Superresolution via Sparsity Constraints
Donoho, D. L. (1992) · SIAM Journal on Mathematical Analysis · doi:10.1137/0523074 · Cited by 298
Metadata
- Authors
- Levy, S., & Fullagar, P. K.
- Venue
- Geophysics
- Publisher
- Society of Exploration Geophysicists
- Published
- 1981-09-01
- Volume
- 46
- Issue
- 9
- Pages
- 1235-1243
- ISSN
- 0016-8033 (ISSN-L)
- 1942-2156
- OpenAlex
- W2168335598
- Cited by
- 258
- References
- 1
- FWCI
- 3.80
- 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.