메뉴 건너뛰기




Volumn 3, Issue , 1998, Pages 1877-1880

Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; BACKWARD ELIMINATION; BANDLIMITED EXTRAPOLATIONS; GLOBALLY CONVERGENT; ITERATIVE ALGORITHM; LINEAR INVERSE PROBLEMS; SPARSE FILTER DESIGNS; SUB-OPTIMAL ALGORITHMS;

EID: 0031642386     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.1998.681830     Document Type: Conference Paper
Times cited : (19)

References (13)
  • 1
    • 0011629158 scopus 로고
    • Superresolution via sparsity constraints
    • Sep.
    • D. L. Donoho, "Superresolution via sparsity constraints," SIAM J. Math. Anal, vol. 23, pp. 1309-1331,Sep. 1992
    • (1992) SIAM J. Math. Anal , vol.23 , pp. 1309-1331
    • Donoho, D.L.1
  • 2
    • 0032002170 scopus 로고    scopus 로고
    • Globally convergent edge preserving regularization: An application to limited angle tomography
    • Feb.
    • A. H. Delaney and Y. Bresler. "Globally convergent edge preserving regularization: An application to limited angle tomography," IEEE Trans. Image Process., vo1. 7 Feb. 1998
    • (1998) IEEE Trans. Image Process. , vol.7
    • Delaney, A.H.1    Bresler, Y.2
  • 5
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • B. K. Natarajan, "Sparse approximate solutions to linear systems", SIAMJ. Comp., vol. 24, pp. 227-234,1995
    • (1995) SIAMJ. Comp. , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 6
    • 0029725338 scopus 로고    scopus 로고
    • Dictionaty-based decomposition of linear mixtures of Gaussian processes
    • May
    • C. Couvreur and Y. Bresler. Dictionaty-based decomposition of linear mixtures of Gaussian processes. Proc. ICASSP, pp. 2519-2522,May 1996
    • (1996) Proc. ICASSP , pp. 2519-2522
    • Couvreur, C.1    Bresler, Y.2
  • 7
    • 0029746763 scopus 로고    scopus 로고
    • Optimal susbet selection for adaptive signal representation
    • May
    • M. Nafie, M. Ali, and A. H. Tewfik. Optimal susbet selection for adaptive signal representation. Proc. ICASSP, May 1996
    • (1996) Proc. ICASSP
    • Nafie, M.1    Ali, M.2    Tewfik, A.H.3
  • 8
    • 0029725619 scopus 로고    scopus 로고
    • A new algorithm for computing sparse solutions to linear inverse problems
    • May
    • G. Harikumar and Y. Bresler, "A new algorithm for computing sparse solutions to linear inverse problems,'' P m ICASSP, May 1996, vol. 111, pp. 1331-1334
    • (1996) Pm ICASSP , vol.111 , pp. 1331-1334
    • Harikumar, G.1    Bresler, Y.2
  • 10
    • 0031102203 scopus 로고    scopus 로고
    • Sparse signal reconstructions from limited data using FOCUSS: A re-weighted minimum norm algorithm
    • March
    • I. Gorodnitsky and B. D. Rao, "Sparse signal reconstructions from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., pp. 600-616, March 1997
    • (1997) IEEE Trans. Signal Process. , pp. 600-616
    • Gorodnitsky, I.1    Rao, B.D.2
  • 11
    • 0029753038 scopus 로고    scopus 로고
    • Design of nonuniformly spaced linear phase FIR filters using mixed integer linear programming
    • Jan.
    • J. T. Lim, W. J. Oh, and Y. H. Lee, "Design of nonuniformly spaced linear phase FIR filters using mixed integer linear programming," IEEE Trans. Signal Process., pp. 123-126, Jan. 1996
    • (1996) IEEE Trans. Signal Process. , pp. 123-126
    • Lim, J.T.1    Oh, W.J.2    Lee, Y.H.3
  • 13
    • 84892159134 scopus 로고    scopus 로고
    • Optimalilty of the backward greedy algorithm for the subset selection problem
    • 1994
    • C. Couvreur and Y. Bresler, "Optimalilty of the Backward Greedy Algorithm for the Subset Selection Problem", submitted SIAM J. Mat. An. Appl., 1998. pp. 549-568,1994.
    • (1998) SIAM J. Mat. An. Appl. , pp. 549-568
    • Couvreur, C.1    Bresler, Y.2


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