메뉴 건너뛰기




Volumn 59, Issue 3, 2011, Pages 936-952

Online sparse system identification and signal reconstruction using projections onto weighted ℓ1 balls

Author keywords

adaptive filtering; compressive sensing; projections; Sparsity

Indexed keywords

ADAPTATION MECHANISM; CLOSED CONVEX SETSS; COMPRESSIVE SENSING; COST CRITERIA; DATA MISMATCH; LINEAR DEPENDENCE; NUMERICAL RESULTS; OBSERVED DATA; PROJECTION OPERATOR; PROJECTIONS; SELECTION OPERATORS; SPARSE SIGNALS; SPARSE SYSTEM IDENTIFICATION; SPARSITY;

EID: 79951590814     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2090874     Document Type: Article
Times cited : (148)

References (38)
  • 1
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • DOI 10.1109/TIT.2005.862083
    • E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.2 , pp. 489-509
    • Candes, E.J.1    Romberg, J.2    Tao, T.3
  • 2
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , pp. 1289-1306
    • Donoho, D.L.1
  • 3
    • 84878104490 scopus 로고    scopus 로고
    • Compressive sampling
    • E. Candès, "Compressive sampling," Proc. ICM, vol. 3, pp. 1433-1452, 2006.
    • (2006) Proc. ICM , vol.3 , pp. 1433-1452
    • Candès, E.1
  • 4
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • DOI 10.1109/TIT.2005.858979
    • E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, 2005. (Pubitemid 41800353)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 5
    • 85032751965 scopus 로고    scopus 로고
    • Compressive sensing [lecture notes]
    • August
    • R. G. Baraniuk, "Compressive sensing [lecture notes]," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118-121, August 2007.
    • (2007) IEEE Signal Process. Mag. , vol.24 , Issue.4 , pp. 118-121
    • Baraniuk, R.G.1
  • 6
    • 70349216427 scopus 로고    scopus 로고
    • Sparse LMS for system identification
    • Y. Chen, Y. Gu, and A. O. Hero, "Sparse LMS for system identification," in Proc. IEEE ICASSP, 2009, pp. 3125-3128.
    • (2009) Proc. IEEE ICASSP , pp. 3125-3128
    • Chen, Y.1    Gu, Y.2    Hero, A.O.3
  • 7
    • 70349223782 scopus 로고    scopus 로고
    • RLS-weighted Lasso for adaptive estimation of sparse signals
    • D. Angelosante and G. B. Giannakis, "RLS-weighted Lasso for adaptive estimation of sparse signals," in Proceedings of the IEEE ICASSP, 2009, pp. 3245-3248.
    • (2009) Proceedings of the IEEE ICASSP , pp. 3245-3248
    • Angelosante, D.1    Giannakis, G.B.2
  • 8
    • 61549095738 scopus 로고    scopus 로고
    • Asympotic achievability of the Cramer-Rao bound for noisy compressive sampling
    • B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asympotic achievability of the Cramer-Rao bound for noisy compressive sampling," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236, 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.3 , pp. 1233-1236
    • Babadi, B.1    Kalouptsidis, N.2    Tarokh, V.3
  • 9
    • 77954901517 scopus 로고    scopus 로고
    • A sparse adaptive filtering using time-varying soft-thresholding techniques
    • Dallas, TX, Mar.
    • Y. Murakami, M. Yamagishi, M. Yukawa, and I. Yamada, "A sparse adaptive filtering using time-varying soft-thresholding techniques," in Proc. IEEE ICASSP, Dallas, TX, Mar. 2010, pp. 3734-3737.
    • (2010) Proc. IEEE ICASSP , pp. 3734-3737
    • Murakami, Y.1    Yamagishi, M.2    Yukawa, M.3    Yamada, I.4
  • 12
    • 0027541192 scopus 로고
    • The foundations of set theoretic estimation
    • P. L. Combettes, "The foundations of set theoretic estimation," Proc. IEEE, vol. 81, no. 2, pp. 182-208, 1993.
    • (1993) Proc. IEEE , vol.81 , Issue.2 , pp. 182-208
    • Combettes, P.L.1
  • 13
    • 11144235357 scopus 로고    scopus 로고
    • Adaptive projected subgradient method for asymptotic Minimization of sequence of nonnegative convex functions
    • DOI 10.1081/NFA-200045806
    • I. Yamada and N. Ogura, "Adaptive Projected Subgradient Method for asymptotic minimization of sequence of nonnegative convex functions," Numer. Funct. Anal. Optim., vol. 25, no. 7 and 8, pp. 593-617, 2004. (Pubitemid 40050078)
    • (2004) Numerical Functional Analysis and Optimization , vol.25 , Issue.7-8 , pp. 593-617
    • Yamada, I.1    Ogura, N.2
  • 14
    • 34547495662 scopus 로고    scopus 로고
    • The adaptive projected subgradient method over the fixed point set of strongly attracting nonexpansive mappings
    • K. Slavakis, I. Yamada, and N. Ogura, "The adaptive projected subgradient method over the fixed point set of strongly attracting nonexpansive mappings," Numer. Funct. Anal. Optim., vol. 27, no. 7 and 8, pp. 905-930, 2006.
    • (2006) Numer. Funct. Anal. Optim. , vol.27 , Issue.7-8 , pp. 905-930
    • Slavakis, K.1    Yamada, I.2    Ogura, N.3
  • 18
    • 77952743265 scopus 로고    scopus 로고
    • Compressed channel sensing: A new approach to estimating sparse multipath channels
    • Jun.
    • W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, "Compressed channel sensing: A new approach to estimating sparse multipath channels," Proc. IEEE, Jun. 2010.
    • (2010) Proc. IEEE
    • Bajwa, W.1    Haupt, J.2    Sayeed, A.3    Nowak, R.4
  • 19
    • 85032752365 scopus 로고    scopus 로고
    • Adaptive learning in a world of projections: A unifying framework for linear and nonlinear classification and regression tasks
    • S. Theodoridis, K. Slavakis, and I. Yamada, "Adaptive learning in a world of projections: A unifying framework for linear and nonlinear classification and regression tasks," IEEE Signal Process. Mag., vol. 28, no. 1, pp. 97-123, 2011.
    • (2011) IEEE Signal Process. Mag. , vol.28 , Issue.1 , pp. 97-123
    • Theodoridis, S.1    Slavakis, K.2    Yamada, I.3
  • 21
    • 0001336448 scopus 로고
    • The method of successive projections for finding a common point of convex sets
    • L. M. Bregman, "The method of successive projections for finding a common point of convex sets," Soviet Math. Dokl., vol. 6, pp. 688-692, 1965.
    • (1965) Soviet Math. Dokl. , vol.6 , pp. 688-692
    • Bregman, L.M.1
  • 22
    • 33845708830 scopus 로고
    • The method of projections for finding the common point of convex sets
    • L. G. Gubin, B. T. Polyak, and E. V. Raik, "The method of projections for finding the common point of convex sets," USSR Comput. Math. Phys., vol. 7, pp. 1-24, 1967.
    • (1967) USSR Comput. Math. Phys. , vol.7 , pp. 1-24
    • Gubin, L.G.1    Polyak, B.T.2    Raik, E.V.3
  • 23
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, Sep. 1996. (Pubitemid 126599619)
    • (1996) SIAM Review , vol.38 , Issue.3 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2
  • 25
    • 70450233513 scopus 로고    scopus 로고
    • Adaptive constrained learning in Reproducing Kernel Hilbert Spaces: The robust beamforming case
    • Dec.
    • K. Slavakis, S. Theodoridis, and I. Yamada, "Adaptive constrained learning in Reproducing Kernel Hilbert Spaces: The robust beamforming case," IEEE Trans. Signal Process., vol. 57, no. 12, pp. 4744-4764, Dec. 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.12 , pp. 4744-4764
    • Slavakis, K.1    Theodoridis, S.2    Yamada, I.3
  • 26
    • 46749118074 scopus 로고    scopus 로고
    • Online kernel-based classification using adaptive projection algorithms
    • K. Slavakis, S. Theodoridis, and I. Yamada, "Online kernel-based classification using adaptive projection algorithms," IEEE Trans. Signal Process., vol. 56, no. 7, pp. 2781-2796, 2008.
    • (2008) IEEE Trans. Signal Process. , vol.56 , Issue.7 , pp. 2781-2796
    • Slavakis, K.1    Theodoridis, S.2    Yamada, I.3
  • 27
    • 0036571426 scopus 로고    scopus 로고
    • An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques
    • DOI 10.1109/78.995065, PII S1053587X02032208
    • I. Yamada, K. Slavakis, and K. Yamada, "An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques," IEEE Trans. Signal Process., vol. 50, no. 5, pp. 1091-1101, 2002. (Pubitemid 34515269)
    • (2002) IEEE Transactions on Signal Processing , vol.50 , Issue.5 , pp. 1091-1101
    • Yamada, I.1    Slavakis, K.2    Yamada, K.3
  • 29
    • 57349127864 scopus 로고    scopus 로고
    • Accelerated projected gradient method for linear inverse problems with sparsity constraints
    • Dec.
    • I. Daubechies, M. Fornasier, and I. Loris, "Accelerated projected gradient method for linear inverse problems with sparsity constraints," J. Fourier Anal. Applicat., vol. 14, no. 5-6, pp. 764-792, Dec. 2008.
    • (2008) J. Fourier Anal. Applicat. , vol.14 , Issue.5-6 , pp. 764-792
    • Daubechies, I.1    Fornasier, M.2    Loris, I.3
  • 30
    • 33846114377 scopus 로고    scopus 로고
    • The adaptive lasso and its oracle properties
    • Dec.
    • H. Zou, "The adaptive lasso and its oracle properties," J. Amer. Statist. Assoc., vol. 101, pp. 1418-1429, Dec. 2006.
    • (2006) J. Amer. Statist. Assoc. , vol.101 , pp. 1418-1429
    • Zou, H.1
  • 31
    • 65649137930 scopus 로고    scopus 로고
    • Probing the pareto frontier for basis pursuit solutions
    • E. van den Berg and M. P. Friedlander, "Probing the pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput., vol. 31, no. 2, pp. 890-912, 2008.
    • (2008) SIAM J. Sci. Comput. , vol.31 , Issue.2 , pp. 890-912
    • Van Den Berg, E.1    Friedlander, M.P.2
  • 33
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, aMATLAB toolbox for optimization over symmetric cones
    • Aug.
    • J. F. Sturm, "Using SeDuMi 1.02, aMATLAB toolbox for optimization over symmetric cones," Optim. Meth. Softw., vol. 11-12, pp. 625-653, Aug. 1999.
    • (1999) Optim. Meth. Softw. , vol.11-12 , pp. 625-653
    • Sturm, J.F.1
  • 38
    • 0035351666 scopus 로고    scopus 로고
    • A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces
    • H. H. Bauschke and P. L. Combettes, "A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces," Math. Oper. Res., vol. 26, no. 2, pp. 248-264, May 2001. (Pubitemid 34050614)
    • (2001) Mathematics of Operations Research , vol.26 , Issue.2 , pp. 248-264
    • Bauschke, H.H.1    Combettes, P.L.2


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