메뉴 건너뛰기




Volumn , Issue , 2012, Pages 3613-3616

On vector L0 penalized multivariate regression

Author keywords

cyclic descent; l o; multiple measurement vectors; multivariate regression; sparsity

Indexed keywords

COEFFICIENT VECTOR; CYCLIC DESCENTS; LINEAR REGRESSION PROBLEMS; MULTIPLE MEASUREMENT VECTORS; MULTIVARIATE REGRESSION; OPTIMALITY CONDITIONS; PENALTY PARAMETERS; SPARSITY; UNDER-DETERMINED;

EID: 84867619200     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2012.6288698     Document Type: Conference Paper
Times cited : (22)

References (24)
  • 2
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242, 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , pp. 2231-2242
    • Tropp, J.A.1
  • 3
    • 0028386025 scopus 로고
    • 2 norms, with application to bayesian estimation
    • 2 norms, with application to bayesian estimation," IEEE Trans. Sig. Proc., vol. 42, pp. 618-627, 1994.
    • (1994) IEEE Trans. Sig. Proc. , vol.42 , pp. 618-627
    • Alliney, S.1    Ruzinsky, S.A.2
  • 4
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani, "Regression shrinkage and selection via the lasso," Jl. Roy. Stat. Soc. B, vol. 58, pp. 267-288, 1996.
    • (1996) Jl. Roy. Stat. Soc. B , vol.58 , pp. 267-288
    • Tibshirani, R.1
  • 5
    • 0032712352 scopus 로고    scopus 로고
    • An affine scaling methodology for best basis selection
    • B. D. Rao and K. Kreutz-Delgado, "An affine scaling methodology for best basis selection," IEEE Trans.Sig.Proc., vol. 47, pp. 187-200, 1999.
    • (1999) IEEE Trans.Sig.Proc. , vol.47 , pp. 187-200
    • Rao, B.D.1    Kreutz-Delgado, K.2
  • 9
    • 0028805010 scopus 로고
    • Neuromagnetic source imaging with focuss: A recursive weighted minimum norm algorithm
    • I. F. Gorodnitsky, J. S. George, and B. D. Rao, "Neuromagnetic source imaging with focuss: a recursive weighted minimum norm algorithm," Electroen. Clin. Neuro., vol. 95, pp. 231-251, 1995.
    • (1995) Electroen. Clin. Neuro. , vol.95 , pp. 231-251
    • Gorodnitsky, I.F.1    George, J.S.2    Rao, B.D.3
  • 11
    • 0033149076 scopus 로고    scopus 로고
    • Reduced complexity decision feedback equalization for multipath channels with large delay spreads
    • I. J. Fevrier, S. B. Gelfand, and M. P. Fitz, "Reduced complexity decision feedback equalization for multipath channels with large delay spreads," IEEE Trans. Commun., vol. 47, pp. 927-937, 1999.
    • (1999) IEEE Trans. Commun. , vol.47 , pp. 927-937
    • Fevrier, I.J.1    Gelfand, S.B.2    Fitz, M.P.3
  • 12
    • 0031639913 scopus 로고    scopus 로고
    • Sparse inverse solution methods for signal and image processing applications
    • B. D. Jeffs, "Sparse inverse solution methods for signal and image processing applications," ICASSP, Seattle, Washington, U.S.A., vol. 3, pp. 1885-1888, 1998.
    • (1998) ICASSP, Seattle, Washington, U.S.A. , vol.3 , pp. 1885-1888
    • Jeffs, B.D.1
  • 13
    • 30844445842 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. part i: Greedy pursuit
    • J. A. Tropp, A. C. Gilbert, , and M. J. Strauss, "Algorithms for simultaneous sparse approximation. part i: Greedy pursuit," Sig. Proc., vol. 86, pp. 572-588, 2006.
    • (2006) Sig. Proc. , vol.86 , pp. 572-588
    • Tropp, J.A.1    Gilbert, A.C.2    Strauss, M.J.3
  • 14
    • 57349143370 scopus 로고    scopus 로고
    • Atoms of all channels, unite! average case analysis of multi-channel sparse recovery using greedy algorithms
    • R. Gribonval, H. Rauhut, K. Schnass, and P. Vandergheynst, "Atoms of all channels, unite! average case analysis of multi-channel sparse recovery using greedy algorithms," Jl. of Fourier Anal. Applic., vol. 14, pp. 655-687, 2008.
    • (2008) Jl. of Fourier Anal. Applic. , vol.14 , pp. 655-687
    • Gribonval, R.1    Rauhut, H.2    Schnass, K.3    Vandergheynst, P.4
  • 15
    • 30844461481 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. part ii: Convex relaxation
    • J. A. Tropp, "Algorithms for simultaneous sparse approximation. part ii: Convex relaxation," Sig. Proc., vol. 86, pp. 589-602, 2006.
    • (2006) Sig. Proc. , vol.86 , pp. 589-602
    • Tropp, J.A.1
  • 16
    • 25444450079 scopus 로고    scopus 로고
    • A sparse signal reconstruction perspective for source localization with sensor arrays
    • D. Malioutov, M. Cetin, and A. S. Willsky, "A sparse signal reconstruction perspective for source localization with sensor arrays," IEEE Trans. Sig. Proc., vol. 53, pp. 3010-3022, 2005.
    • (2005) IEEE Trans. Sig. Proc. , vol.53 , pp. 3010-3022
    • Malioutov, D.1    Cetin, M.2    Willsky, A.S.3
  • 17
    • 23844477225 scopus 로고    scopus 로고
    • Sparse solutions to linear inverse problems with multiple measurement vectors
    • S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Sig. Proc., vol. 53, pp. 2477-2488, 2005.
    • (2005) IEEE Trans. Sig. Proc. , vol.53 , pp. 2477-2488
    • Cotter, S.F.1    Rao, B.D.2    Engan, K.3    Kreutz-Delgado, K.4
  • 18
    • 53149111169 scopus 로고    scopus 로고
    • Reduce and boost: Recovering arbitrary sets of jointly sparse vectors
    • M. Mishali and Y. C. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors," IEEE Trans. Sig. Proc., vol. 56, pp. 4692-4702, 2008.
    • (2008) IEEE Trans. Sig. Proc. , vol.56 , pp. 4692-4702
    • Mishali, M.1    Eldar, Y.C.2
  • 19
    • 33947142837 scopus 로고    scopus 로고
    • Theoretical results on sparse representations of multiple-measurement vectors
    • J. Chen and X. Huo, "Theoretical results on sparse representations of multiple-measurement vectors," IEEE Trans. Sig. Proc., vol. 54, pp. 4634-4643, 2006.
    • (2006) IEEE Trans. Sig. Proc. , vol.54 , pp. 4634-4643
    • Chen, J.1    Huo, X.2
  • 20
    • 73849109362 scopus 로고    scopus 로고
    • Average case analysis of multichannel sparse recovery using convex relaxation
    • Y. C. Eldar and H. Rauhut, "Average case analysis of multichannel sparse recovery using convex relaxation," IEEE Trans. Inf. Theory, vol. 56, pp. 505-519, 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , pp. 505-519
    • Eldar, Y.C.1    Rauhut, H.2
  • 21
    • 57349145416 scopus 로고    scopus 로고
    • Iterative thresholding for sparse approximation
    • T. Blumensath and M.E. Davies, "Iterative thresholding for sparse approximation," Jl. of Fourier Anal. Applic., vol. 14, pp. 629-654, 2008.
    • (2008) Jl. of Fourier Anal. Applic. , vol.14 , pp. 629-654
    • Blumensath, T.1    Davies, M.E.2
  • 23
    • 1542498779 scopus 로고    scopus 로고
    • Limitations of the l-curve method in ill-posed problems
    • M. Hanke, "Limitations of the l-curve method in ill-posed problems," BIT Numerical Mathematics, vol. 36, pp. 287-301, 1996.
    • (1996) BIT Numerical Mathematics , vol.36 , pp. 287-301
    • Hanke, M.1
  • 24
    • 0001041472 scopus 로고    scopus 로고
    • Non-convergence of the l-curve regularization parameter selection method
    • C. R. Vogel, "Non-convergence of the l-curve regularization parameter selection method," Inverse Probl., vol. 12, pp. 535-547, 1996.
    • (1996) Inverse Probl. , vol.12 , pp. 535-547
    • Vogel, C.R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.