The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Multitask Compressive Sensing
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
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.415 · Cited by 4,388
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
Self-citation(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Wavelet-based statistical signal processing using hidden Markov models
Crouse, M. S., Nowak, R. D., & Baraniuk, R. G. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668544 · Cited by 1,643
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559 · cited 1×
“5A simple modification to (12) is available from [42] by exploiting the matrix inversion lemma, which leads to an operation per iteration.”
MethodSparse solutions to linear inverse problems with multiple measurement vectors
Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849172 · Cited by 1,393
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
Bayes and Empirical Bayes Methods for Data Analysis, Second Edition
Carlin, B., & Louis, T. (2000) · Chapman & Hall/CRC Texts in Statistical Science · doi:10.1201/9781420057669 · Cited by 959
Extensions of compressed sensing
Tsaig, Y., & Donoho, D. L. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.029 · Cited by 947
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
Wipf, D. P., & Rao, B. D. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894265 · Cited by 911
A Model of Inductive Bias Learning
Baxter, J. (2000) · Cited by 730
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Tropp, J. A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.031 · Cited by 691
A model of inductive bias learning
Baxter, J. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.731 · Cited by 582
Learning Gaussian processes from multiple tasks
Yu, K., Tresp, V., & Schwaighofer, A. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102479 · Cited by 380
Efficient, Low-Complexity Image Coding With a Set-Partitioning Embedded Block Coder
Pearlman, W. A., Islam, A., Nagaraj, N., & Said, A. (2004) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2004.835150 · Cited by 376
Learning to learn with the informative vector machine
Lawrence, N. D., & Platt, J. C. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015382 · Cited by 338
Simultaneous sparse approximation via greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. (2006) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2005.1416405 · Cited by 284
Robust Bayesian mixture modelling
Svensén, M., & Bishop, C. M. (2005) · Neurocomputing · doi:10.1016/j.neucom.2004.11.018 · Cited by 254
A Method for Combining Inference Across Related Nonparametric Bayesian Models
Müller, P., Quintana, F., & Rosner, G. (2004) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2004.05564.x · Cited by 171
A Bayesian Semiparametric Model for Random-Effects Meta-Analysis
Burr, D. L., & Doss, H. (2005) · Journal of the American Statistical Association · doi:10.1198/016214504000001024 · Cited by 94
Robust multi-task learning witht-processes
Yu, S., Volker Tresp, C., & Yu, K. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273635 · Cited by 77
On the use of a priori information for sparse signal approximations
Escoda, O. D., Granai, L., & Vandergheynst, P. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.879306 · Cited by 51
Combining information from several experiments with nonparametric priors
Mallick, B. K. (1997) · Biometrika · doi:10.1093/biomet/84.3.697 · Cited by 33
Combining Information from Related Regressions
Dominici, F., Parmigiani, G., Reckhow, K. H., & Wolpert, R. L. (1997) · Journal of Agricultural Biological and Environmental Statistics · doi:10.2307/1400448 · Cited by 28
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
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.