메뉴 건너뛰기
International Symposium on Image and Signal Processing and Analysis, ISPA
Volumn 2001-January, Issue , 2001, Pages 541-544
Finding sparse representation of quantized frame coefficients using 0-1 integer programming
Author keywords

[No Author keywords available]
Indexed keywords

EID: 53149129951     PISSN: 18455921     EISSN: 18492266     Source Type: Conference Proceeding    
DOI: 10.1109/ISPA.2001.938688     Document Type: Conference Paper
Times cited : (2)
References (12)
  • 1
    • 0033677071 scopus 로고    scopus 로고
    • Design of signal expansions for sparse representation
    • Istanbul, Turkey, June
    • S. O. Aase, K. Skretting, J. H. Husøy, and K. Engan. Design of signal expansions for sparse representation. In Proc. ICASSP 2000, pages 105-108, Istanbul, Turkey, June 2000.
    • (2000) Proc. ICASSP 2000 , pp. 105-108
    • Aase, S.O.1    Skretting, K.2    Husøy, J.H.3    Engan, K.4
  • 4
    • 0034299822 scopus 로고    scopus 로고
    • Multi-frame compression: Theory and design
    • Oct.
    • K. Engan, S. O. Aase, and J. H. Husøy. Multi-frame compression: Theory and design. Signal Processing, 80:2121-2140, Oct. 2000.
    • (2000) Signal Processing , vol.80 , pp. 2121-2140
    • Engan, K.1    Aase, S.O.2    Husøy, J.H.3
  • 5
    • 0012203272 scopus 로고    scopus 로고
    • Regularized FOCUSS for subset selection in noise
    • Sweden, June
    • K. Engan, B. Rao, and K. Kreutz-Delgado. Regularized FOCUSS for subset selection in noise. In Proc. of NORSIG 2000, pages 247-250, Sweden, June 2000.
    • (2000) Proc. of NORSIG 2000 , pp. 247-250
    • Engan, K.1    Rao, B.2    Kreutz-Delgado, K.3
  • 6
    • 0031625503 scopus 로고    scopus 로고
    • A fast orthogonal matching pursuit algorithm
    • Seattle, USA, May
    • M. Gharavi-Alkhansari and T. S. Huang. A fast orthogonal matching pursuit algorithm. In Proc. ICASSP '98, pages 1389-1392, Seattle, USA, May 1998.
    • (1998) Proc. ICASSP '98 , pp. 1389-1392
    • Gharavi-Alkhansari, M.1    Huang, T.S.2
  • 7
    • 0031102203 scopus 로고    scopus 로고
    • Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm
    • Mar.
    • I. F. Gorodnitsky and B. D. Rao. Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm. IEEE Trans. Signal Processing, 45:600-616, Mar. 1997.
    • (1997) IEEE Trans. Signal Processing , vol.45 , pp. 600-616
    • Gorodnitsky, I.F.1    Rao, B.D.2
  • 8
    • 0031647539 scopus 로고    scopus 로고
    • Quantized over-, complete expansions in RN: Analysis, synthesis, and algorithms
    • Jan.
    • V. K. Goyal, M. Vetterli, and N. T. Thao. Quantized over-, complete expansions in RN: Analysis, synthesis, and algorithms. IEEE Trans. Inform. Theory, 44:16-31, Jan. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 16-31
    • Goyal, V.K.1    Vetterli, M.2    Thao, N.T.3
  • 9
    • 0027842081 scopus 로고
    • Matching pursuits with timefrequency dictionaries
    • Dec.
    • S. G. Mallat and Z. Zhang. Matching pursuits with timefrequency dictionaries. IEEE Trans. Signal Processing, 41:3397-3415, Dec. 1993.
    • (1993) IEEE Trans. Signal Processing , vol.41 , pp. 3397-3415
    • Mallat, S.G.1    Zhang, Z.2
  • 10
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • Apr.
    • B. K. Natarajan. Sparse approximate solutions to linear systems. SIAM journal on computing, 24:227-234, Apr. 1995.
    • (1995) SIAM Journal on Computing , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 11
    • 0031640362 scopus 로고    scopus 로고
    • Signal processing with the sparseness constraint
    • Seattle, USA, May
    • B. D. Rao. Signal processing with the sparseness constraint. In Proc. ICASSP '98, pages 1861-1864, Seattle, USA, May 1998.
    • (1998) Proc. ICASSP '98 , pp. 1861-1864
    • Rao, B.D.1
  • 12
    • 0004180332 scopus 로고    scopus 로고
    • John Wiley and Sons, Inc., New York, 1st edition
    • L. A. Wolsey. Integer programming. John Wiley and Sons, Inc., New York, 1st edition, 1998.
    • (1998) Integer Programming
    • Wolsey, L.A.1

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