Research Of Fast Algorithm On Sliding Window

The sliding window algorithm is a short time fast algorithm for discrete orthogonal transform.These algorithms use the time-domain overlapping sliding windows to intercept successive discrete signals and reduce the computational complexity by using the intermediate calculation result of the signal in the previous window.Orthogonal transform on sliding windows is an effective method to deal with non-stationary signals and is often used in real-time spectral analysis.The paper mainly focuses on the widely used Fourier-related sliding window transform and its application research.2-D multi-point sliding DFT algorithm is proposed in this paper.When the number of sliding points is more than one,the proposed algorithm has lower computational complexity than other Fourier-related algorithms.In this paper,the proposed 2-D multi-point sliding DFT algorithm is applied to image tampering blind detection.The paper also proposes an hybrid detection algorithm based on 2-D multi-point sliding DFT for image tampering detection.The experimental results show that the proposed algorithm achieves a good balance between detection speed and detection accuracy.In this paper,we study the Conjugate Symmetric Sequency-ordered Complex Hadamard Transform(CS-SCHT)algorithm on the sliding window,and implement the algorithm based on Gray-Code-Kemel(GCK).The sliding window CS-SCHT algorithm based on the GCK can save about 37%of the computational time compared with the sliding DFT algorithm.And the sliding CS-SCHT can obtain higher SNR than sliding DFT in adaptive filter.The reaserch in this paper provides an important experimental basis for the replacement of DFT by sliding CS-SCHT in the fields of signal and image processing.