메뉴 건너뛰기




Volumn 39, Issue 2, 1991, Pages 544-546

A Two-Dimensional Fast Cosine Transform Algorithm Based on Hou's Approach

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0026107649     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.80854     Document Type: Article
Times cited : (32)

References (12)
  • 1
    • 84902748454 scopus 로고
    • Discrete cosine transform
    • Jan.
    • N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90–93, Jan. 1974.
    • (1974) IEEE Trans. Comput , vol.C-23 , pp. 90-93
    • Ahmed, N.1    Natarajan, T.2    Rao, K.R.3
  • 4
    • 0024738552 scopus 로고
    • The structure of vector radix fast Fourier transforms
    • Sept.
    • H. R. Wu and F. J. Paoloni, “The structure of vector radix fast Fourier transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 1415–1424, Sept. 1989.
    • (1989) IEEE Trans. Acoust., Speech, Signal Processing , vol.37 , pp. 1415-1424
    • Wu, H.R.1    Paoloni, F.J.2
  • 5
    • 0020175688 scopus 로고
    • Fast algorithms for the 2-D discrete cosine transform
    • Sept.
    • F. A. Kamangar and K. R. Rao, “Fast algorithms for the 2-D discrete cosine transform,” IEEE Trans. Comput., vol. C-31, p p. 899–906, Sept. 1982.
    • (1982) IEEE Trans. Comput , vol.C-31 , pp. 899-906
    • Kamangar, F.A.1    Rao, K.R.2
  • 6
    • 0022214130 scopus 로고
    • A two-dimensional fast cosine transform
    • M. A. Hague, “A two-dimensional fast cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1532–1539, 1539, 1985.
    • (1985) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-33 , pp. 1532-1539
    • Hague, M.A.1
  • 7
    • 0021619710 scopus 로고
    • A new algorithm to compute the discrete cosine transform
    • Dec.
    • B. G. Lee, “A new algorithm to compute the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1243–1245, Dec. 1984.
    • (1984) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-32 , pp. 1243-1245
    • Lee, B.G.1
  • 8
    • 84939329730 scopus 로고
    • A two-dimensional fast cosine transform algorithm—A structural approach
    • (Singapore), Sept.
    • H. R. Wu and F. J. Paoloni, “A two-dimensional fast cosine transform algorithm—A structural approach,” in Proc. Int. Conf. Image Processing (Singapore), Sept. 1989, pp. 50–54.
    • (1989) Proc. Int. Conf. Image Processing , pp. 50-54
    • Wu, H.R.1    Paoloni, F.J.2
  • 9
    • 84943728327 scopus 로고
    • A fast recursive algorithm for computing the discrete cosine transform
    • H. S. Hou, “A fast recursive algorithm for computing the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1455–1461, 1987.
    • (1987) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-35 , pp. 1455-1461
    • Hou, H.S.1
  • 10
    • 84958494438 scopus 로고
    • A fast recursive two-dimensional cosine transform
    • C. Ma, “A fast recursive two-dimensional cosine transform,” Proc. SPIE Int. Soc. Opt. Eng., vol. 1002, pp. 541–548, 1988.
    • (1988) Proc. SPIE Int. Soc. Opt. Eng , vol.1002 , pp. 541-548
    • Ma, C.1
  • 12
    • 0017538003 scopus 로고
    • A fast computational algorithm for the discrete cosine transform
    • W. H. Chen, C. H. Smith, and S. C. Fralick, “A fast computational algorithm for the discrete cosine transform,” IEEE Trans. Commun., vol. COM-25, pp. 1004–1009, 1977.
    • (1977) IEEE Trans. Commun , vol.COM-25 , pp. 1004-1009
    • Chen, W.H.1    Smith, C.H.2    Fralick, S.C.3


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