The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Time-Frequency Energy Distributions Meet Compressed Sensing
Abstract
In the case of multicomponent signals with amplitude and frequency modulations, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent advances in optimal recovery from sparsity constraints thus suggest to revisit the issue of TF localization by exploiting sparsity, as adapted to the specific context of (quadratic) TF distributions. Based on classical results in TF analysis, it is argued that the relevant information is mostly concentrated in a restricted subset of Fourier coefficients of the Wigner-Ville distribution neighboring the origin of the ambiguity plane. Using this incomplete information as the primary constraint, the desired distribution follows as the minimum -norm solution in the transformed TF domain. Possibilities and limitations of the approach are demonstrated via controlled numerical experiments, its performance is assessed in various configurations and the results are compared with standard techniques. It is shown that improved representations can be obtained, though at a computational cost which is significantly increased.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
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
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
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
Lustig, M., Donoho, D. L., Santos, J. M., & Pauly, J. M. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914728 · Cited by 2,246
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
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Time-Frequency/Time-Scale Analysis
(1999) · Wavelet analysis and its applications · doi:10.1016/s1874-608x(99)x8001-0 · Cited by 899
11-magic : Recovery of sparse signals via convex programming
Candès, E. J. (2005) · Medical Entomology and Zoology · Cited by 725
Measuring time-frequency information content using the Renyi entropies
Baraniuk, R. G., Flandrin, P., Janssen, A. J. E. M., & Michel, O. J. J. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923723 · Cited by 493
Self-citationSparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. (2006) · Cited by 419
The Wigner distribution : theory and applications in signal processing
Mecklenbräuker, W., & Hlawatsch, F. (1997) · Elsevier eBooks · Cited by 311
Some features of time-frequency representations of multicomponent signals
Flandrin, P. (2005) · ICASSP '84. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1984.1172741 · Cited by 239
Self-citationApplications in Time-Frequency Signal Processing
(2002) · Electrical engineering and applied signal processing series/The electrical engineering and applied signal processing series · doi:10.1201/9781420042467 · Cited by 230
Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints
Daubechies, I., Fornasier, M., Loris, I., & Natuurkunde, D. T. (2004) · Cited by 230
Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints
Daubechies, I., Fornasier, M., & Loris, I. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9039-8 · Cited by 190
Signal-dependent time-frequency analysis using a radially Gaussian kernel
Baraniuk, R. G., & Jones, D. L. (1993) · Signal Processing · doi:10.1016/0165-1684(93)90001-q · Cited by 165
Decomposition of the Wigner-Ville distribution and time-frequency distribution series
Qian, S., & Chen, D. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324750 · Cited by 138
Bounds on the volume and height distributions of the ambiguity function
Price, R. M., & Hofstetter, E. M. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053746 · Cited by 87
Geometry of Affine Time–Frequency Distributions
Flandrin, P., & Gonçalvès, P. (1996) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.1996.0002 · Cited by 84
Self-citationSelf-sorting in-place FFT algorithm with minimum working space
Qian, Z., Lu, C., An, M. H., & Tolimieri, R. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324749 · Cited by 47
Time-Frequency Localization from Sparsity Constraints
Borgnat, P., & Flandrin, P. (2008) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2008.4518477 · Cited by 39
Self-citationSparse time-frequency distributions of chirps from a compressed sensing perspective
Flandrin, P., & Borgnat, P. (2008) · HAL · Cited by 4
Self-citation
Metadata
- Authors
- Flandrin, P., & Borgnat, P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-06
- Volume
- 58
- Issue
- 6
- Pages
- 2974-2982
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2126133656
- Cited by
- 264
- References
- 32
- FWCI
- 8.21
- 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.