The Gabor transform has been recognized as being very useful in diverse areas such as speech and image processing, radar, sonar and seismic data processing and interpretation;however, its real time applications were l...
详细信息
ISBN:
(纸本)0819447145
The Gabor transform has been recognized as being very useful in diverse areas such as speech and image processing, radar, sonar and seismic data processing and interpretation;however, its real time applications were limited due to its high computational complexity. To reduce the computational complexity, the real-valued discrete Gabor transform (RDGT) was presented in our previous work. In this paper, firstly, the 2-D RDGT and its simple relationship with the 2-D complex-valued discrete Gabor transform (CDGT) will be briefly reviewed;secondly, time-recursive algorithms for the efficient and fast computation of the 2-D RDGT coefficients of an image and for the fast reconstruction of the original image from the coefficients will be developed;thirdly, two-layer parallel lattice structures for the implementation of the algorithms will be studied;and finally, the computational complexity of the proposed algorithms will be analyzed and compared with that of the existing 2-D CDGT algorithms, which points out that the parallel implementation of the proposed algorithms are very attractive for real time image processing.
In this paper, a time-recursive algorithm for the computation of discrete-time, discrete-frequency, auto-ambiguity function is given, which in turn is used to compute the Wigner time-frequency distribution. We use the...
详细信息
In this paper, a time-recursive algorithm for the computation of discrete-time, discrete-frequency, auto-ambiguity function is given, which in turn is used to compute the Wigner time-frequency distribution. We use the Richman-Parks-Shenoy's definition of the discrete-time, discrete-frequency, auto-ambiguity function for finite data sequences. Block diagram implementation of the time-recursive algorithm is described, computational complexity with respect to increasing block size is compared with straight forward computation, and the proper time-recursive block size is suggested.
The problems of efficient computation of generalized Gabor transforms are considered in this work. Block time-recursive Gabor transforms are defined for both complex and real data sequences, fast algorithms are derive...
详细信息
The problems of efficient computation of generalized Gabor transforms are considered in this work. Block time-recursive Gabor transforms are defined for both complex and real data sequences, fast algorithms are derived through two different approaches, one by the finite Zak transform, the other by biorthogonal functions. All the block time-recursive algorithms for the computation of generalized Gabor transforms can be unified by a parallel lattice structure, The unified lattice structure computes the transformed data sequentially with data sliding into/out-of a block of size N at a time. Gabor transform computation is based on the most recent L-point data, where L = MN. This model accommodates timely processing of the sequentially received data in digital signal transmission, Implementation on parallel computer system will be discussed. (C) 1997 Elsevier Science B.V.
暂无评论