论文信息 - The computation of two-dimensional cepstra

The computation of two-dimensional cepstra

In this paper we shall explore two methods of computing the complex cepstrum of a two-dimensional (2-D) signal. The two principal methods for computing 1-D cepstra, using discrete Fourier transforms (DFT's) and the complex logarithm function or using a recursion relation for minimum-phase signals, may be extended to two dimensions. These two algorithms are developed and simple examples of their use are given. As a matter of course, we shall also be drawn into considering the definitions of 2-D causality and 2-D minimum-phase signals. In addition, we shall explore the relationship among the nonzero regions of a signal, its inverse, and its cepstrum.

D. Dudgeon | D. Dudgeon

[1] N M Brenner,et al. THREE FORTRAN PROGRAMS THAT PERFORM THE COOLEY-TUKEY FOURIER TRANSFORM , 1967 .

[2] A. Oppenheim,et al. Nonlinear filtering of multiplied and convolved signals , 1968 .

[3] Peter Pistor,et al. Stability Criterion for Recursive Filters , 1974, IBM J. Res. Dev..

[4] D. Dudgeon. The existence of cepstra for two-dimensional rational polynomials , 1975 .

[5] Shmuel Winograd. On computing the Discrete Fourier Transform. , 1976 .

[6] M. Ekstrom,et al. Two-dimensional spectral factorization with applications in recursive digital filtering , 1976 .

[7] José Tribolet,et al. A new phase unwrapping algorithm , 1977 .

[8] M. Ekstrom,et al. A stability test for 2-D recursive digital filters using the complex cepstrum , 1977 .