메뉴 건너뛰기




Volumn 59, Issue 4, 2011, Pages 1505-1517

Sampling and recovery of pulse streams

Author keywords

Blind deconvolution; compressive sensing; sparsity; union of subspaces

Indexed keywords

BLIND DECONVOLUTION; COMPRESSIVE SENSING; DECONVOLUTION ALGORITHM; LINEAR SIGNALS; LOWER BOUNDS; NUMBER OF DEGREES OF FREEDOM; NUMERICAL EXPERIMENTS; POLYNOMIAL-TIME; PULSE SHAPES; PULSE STREAM; SIGNAL INFORMATION; SIGNAL MODELS; SIGNAL RECOVERY; SPARSE REPRESENTATION; SPARSITY; SYNTHETIC AND REAL DATA; UNION OF SUBSPACES;

EID: 79952669339     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2103067     Document Type: Article
Times cited : (43)

References (31)
  • 1
    • 77949576096 scopus 로고    scopus 로고
    • Compressive sensing of streams of pulses
    • Control Signal Process. Allerton IL Sep.
    • C. Hegde and R. G. Baraniuk, "Compressive sensing of streams of pulses," presented at the Allerton Conf. Commun., Control, Signal Process., Allerton, IL, Sep. 2009.
    • (2009) Presented at the Allerton Conf. Commun
    • Hegde, C.1    Baraniuk, R.G.2
  • 3
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • Apr.
    • D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.L.1
  • 4
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • DOI 10.1109/TIT.2005.862083
    • E. J. 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
  • 5
    • 64649083745 scopus 로고    scopus 로고
    • Signal recovery from partial information via orthogonal matching pursuit
    • Dec.
    • J. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, pp. 4655-4666, Dec. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , pp. 4655-4666
    • Tropp, J.1    Gilbert, A.C.2
  • 8
    • 70350743173 scopus 로고    scopus 로고
    • Robust recovery of signals from a union of subspaces
    • Nov.
    • Y. Eldar and M. Mishali, "Robust recovery of signals from a union of subspaces," IEEE Trans. Inf. Theory, vol. 55, pp. 5302-5316, Nov. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , pp. 5302-5316
    • Eldar, Y.1    Mishali, M.2
  • 9
    • 62749175137 scopus 로고    scopus 로고
    • CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
    • D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, pp. 301-321, 2008.
    • (2008) Appl. Comput. Harmon. Anal. , vol.26 , pp. 301-321
    • Needell, D.1    Tropp, J.2
  • 10
    • 84878104490 scopus 로고    scopus 로고
    • Compressive sampling
    • Madrid Spain
    • E. J. Candès, "Compressive sampling," in Proc. Int. Congr. Math., Madrid, Spain, 2006, vol. 3, pp. 1433-1452.
    • (2006) Proc. Int. Congr. Math , vol.3 , pp. 1433-1452
    • Candès, E.J.1
  • 11
    • 64549135334 scopus 로고    scopus 로고
    • Sampling theorems for signals from the union of finite-dimensional linear subspaces
    • Apr.
    • T. Blumensath and M. E. Davies, "Sampling theorems for signals from the union of finite-dimensional linear subspaces," IEEE Trans. Inf. Theor., vol. 55, no. 4, pp. 1872-1882, Apr. 2009.
    • (2009) IEEE Trans. Inf. Theor. , vol.55 , Issue.4 , pp. 1872-1882
    • Blumensath, T.1    Davies, M.E.2
  • 12
    • 69949164527 scopus 로고    scopus 로고
    • Iterative hard thresholding for compressed sensing
    • T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 3, pp. 265-274, 2009.
    • (2009) Appl. Comput. Harmon. Anal. , vol.3 , pp. 265-274
    • Blumensath, T.1    Davies, M.E.2
  • 13
    • 85032750886 scopus 로고    scopus 로고
    • Sampling signals from a union of subspaces
    • Mar.
    • Y. M. Lu and M. N. Do, "Sampling signals from a union of subspaces," IEEE Signal Process. Mag., vol. 25, pp. 41-47, Mar. 2008.
    • (2008) IEEE Signal Process. Mag. , vol.25 , pp. 41-47
    • Lu, Y.M.1    Do, M.N.2
  • 15
    • 44949221599 scopus 로고    scopus 로고
    • Blind reconstruction of sparse images with unknown point spread function
    • K. Herrity, R. Raich, and A. O. Hero, "Blind reconstruction of sparse images with unknown point spread function," Proc. SPIE, vol. 6814, 2008.
    • (2008) Proc. SPIE , vol.6814
    • Herrity, K.1    Raich, R.2    Hero, A.O.3
  • 17
    • 0004209078 scopus 로고
    • Englewood Cliffs NJ: Prentice Hall
    • S. Haykin, Blind Deconvolution. Englewood Cliffs, NJ: Prentice- Hall, 1994.
    • (1994) Blind Deconvolution
    • Haykin, S.1
  • 18
    • 0034372766 scopus 로고    scopus 로고
    • Convergence of the alternating minimization algorithm for blind deconvolution
    • T. F. Chan and C. K.Wong, "Convergence of the alternating minimization algorithm for blind deconvolution," Linear Algebra Its Appl., vol. 316, no. 1-3, pp. 259-285, 2000.
    • (2000) Linear Algebra Its Appl. , vol.316 , Issue.1-3 , pp. 259-285
    • Chan, T.F.1    Wong, C.K.2
  • 20
    • 79952646072 scopus 로고    scopus 로고
    • An alternating minimization algorithm for non-negative matrix factorization
    • Online edu/∼jtropp/notes/Tro03-Alternating-Minimization.pdf Preprint
    • J. A. Tropp, "An alternating minimization algorithm for non-negative matrix factorization," 2003 [Online]. Available: . edu/∼jtropp/notes/ Tro03-Alternating-Minimization.pdf, Preprint
    • (2003) Available
    • Tropp, J.A.1
  • 22
    • 84876286608 scopus 로고    scopus 로고
    • NASA Online bw0405/about.shtml
    • NASA [Online]. Available: bw0405/about.shtml
    • Available
  • 23
    • 0036612082 scopus 로고    scopus 로고
    • Sampling signals with finite rate of innovation
    • DOI 10.1109/TSP.2002.1003065, PII S1053587X02043921
    • M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Process., vol. 50, no. 6, pp. 1417-1428, Jun. 2002. (Pubitemid 34822552)
    • (2002) IEEE Transactions on Signal Processing , vol.50 , Issue.6 , pp. 1417-1428
    • Vetterli, M.1    Marziliano, P.2    Blu, T.3
  • 24
    • 84876286608 scopus 로고    scopus 로고
    • Blind Compressed Sensing Feb. 2010 Online
    • S. Gleichman and Y. Eldar, Blind Compressed Sensing, Feb. 2010 [Online]. Available:
    • Available
    • Gleichman, S.1    Eldar, Y.2
  • 25
    • 66849115117 scopus 로고    scopus 로고
    • Dictionary learning for sparse approximations using the majorization method
    • Jun.
    • M. Yaghoobi, T. Blumensath, and M. E. Davies, "Dictionary learning for sparse approximations using the majorization method," IEEE Trans. Signal Process., vol. 57, no. 6, pp. 2178-2191, Jun. 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.6 , pp. 2178-2191
    • Yaghoobi, M.1    Blumensath, T.2    Davies, M.E.3
  • 29
    • 55649115527 scopus 로고    scopus 로고
    • A simple proof of the restricted isometry property for random matrices
    • Dec.
    • R. G. Baraniuk, M. Davenport, R. A. DeVore, and M. B. Wakin, "A simple proof of the restricted isometry property for random matrices," Const. Approx., vol. 28, pp. 253-263, Dec. 2008.
    • (2008) Const. Approx. , vol.28 , pp. 253-263
    • Baraniuk, R.G.1    Davenport, M.2    Devore, R.A.3    Wakin, M.B.4
  • 30
    • 0001654702 scopus 로고
    • Extensions of lipschitz maps into a hilbert space
    • W. B. Johnson and J. Lindenstrauss, "Extensions of Lipschitz maps into a hilbert space," Contemp. Math., vol. 26, pp. 189-206, 1984.
    • (1984) Contemp. Math. , vol.26 , pp. 189-206
    • Johnson, W.B.1    Lindenstrauss, J.2


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