Multitask Compressive Sensing
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
Compressive sensing (CS) is a framework whereby one performs N nonadaptive measurements to constitute a vector v isin RNused to recover an approximation u isin RMdesired signal u isin RMwith NMtimesM. It has been demonstrated that with appropriate design of the compressive measurements used to define v, the decompressive mapping vrarru may be performed with error ||u-u||22having asymptotic properties analogous to those of the best adaptive transform-coding algorithm applied in the basis Psi. The mapping vrarru constitutes an inverse problem, often solved using l1regularization or related techniques. In most previous research, if L > 1 sets of compressive measurements {vi}i=1,Lare performed, each of the associated {ui}i=1,Lare recovered one at a time, independently. In many applications the L ldquotasksrdquo defined by the mappings virarruiare not statistically independent, and it may be possible to improve the performance of the inversion if statistical interrelationships are exploited. In this paper, we address this problem within a multitask learning setting, wherein the mapping vrarru for each task corresponds to inferring the parameters (here, wavelet coefficients) associated with the desired signal vi, and a shared prior is placed across all of the L tasks. Under this hierarchical Bayesian modeling, data from all L tasks contribute toward inferring a posterior on the hyperparameters, and once the shared prior is thereby inferred, the data from each of the L individual tasks is then employed to estimate the task-dependent wavelet coefficients. An empirical Bayesian procedure for the estimation of hyperparameters is considered; two fast inference algorithms extending the relevance vector machine (RVM) are developed. Example results on several data sets demonstrate the effectiveness and robustness of the proposed algorithms.
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
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
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
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
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
Caruana, R. (1997) · Machine Learning · doi:10.1023/a:1007379606734 · Cited by 6,636
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
A Bayesian Analysis of Some Nonparametric Problems
Ferguson, T. S. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342360 · Cited by 4,697
Cited by
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Generalized Coprime Array Configurations for Direction-of-Arrival Estimation
Qin, S., Zhang, Y. D., & Amin, M. G. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2393838 · Cited by 975
Uğurbil, K., Xu, J., Auerbach, E. J., Moeller, S., Vu, A. T., Duarte-Carvajalino, J. M., Lenglet, C., Wu, X., Schmitter, S., Van de Moortele, P. F., et al. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2013.05.012 · Cited by 812
Bayesian Compressive Sensing Using Laplace Priors
Babacan, S. D., Molina, R., & Katsaggelos, A. K. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2032894 · Cited by 804
Hou, R., & Xia, Y. (2021) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2020.115741 · Cited by 674
Huang, J., & Zhang, T. (2010) · The Annals of Statistics · doi:10.1214/09-aos778 · Cited by 521
Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing
He, L., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2022003 · Cited by 506
Self-citationCompressive Sensing in Electromagnetics - A Review
Massa, A., Rocca, P., & Oliveri, G. (2015) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2015.2397092 · Cited by 360
Compressed Sensing for Wireless Communications: Useful Tips and Tricks
Choi, J. W., Shim, B., Ding, Y., Rao, B., & Kim, D. I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2664421 · Cited by 351
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Learning with Structured Sparsity
Huang, J., Zhang, T., & Metaxas, D. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.3002 · Cited by 275
Directions-of-Arrival Estimation Through Bayesian Compressive Sensing Strategies
Carlin, M., Rocca, P., Oliveri, G., Viani, F., & Massa, A. (2013) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2013.2256093 · Cited by 268
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
Maleki, A., Anitori, L., Yang, Z., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252232 · Cited by 264
Dictionary Learning-Based Sparse Channel Representation and Estimation for FDD Massive MIMO Systems
Ding, Y., & Rao, B. D. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2843786 · Cited by 161
Multitask Sparse Bayesian Learning with Applications in Structural Health Monitoring
Huang, Y., Beck, J. L., & Li, H. (2019) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.12408 · Cited by 79
“For the purpose of Bayesian reconstructions of compressive sensing signals, a multitask SBL algorithm was proposed in Ji et al. (2009).”
BackgroundMethodResultInfluential(2011) · Cited by 42
Fractal dimension based damage identification incorporating multi-task sparse Bayesian learning
Huang, Y., Li, H., Wu, S., & Yang, Y. (2018) · Smart Materials and Structures · doi:10.1088/1361-665x/aac248 · Cited by 22
Metadata
- Authors
- Ji, S., Dunson, D., & Carin, L.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-01
- Volume
- 57
- Issue
- 1
- Pages
- 92-106
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2145856765
- Cited by
- 502
- References
- 34
- FWCI
- 12.25
- 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.