ASIC Design of DA-Based 2-D Inverse Discrete Cosine Transform

Aim To present an ASIC design of DA based 2 D IDCT. Methods\ In the design of 1 D IDCT is utilized a Chen based fast IDCT algorithm, and multiplier accumulators based on distributed algorithm contributes in reducing the hardware amount and in enhancing the speed performance. Results and Conclusion\ VHDL simulation, synthesis and layout design of system are implemented. This 2 D IDCT ASIC design owns best timing performance when compared with other better designs internationally. Results of design prove to be excellent.

Audio Zero-Watermark Scheme Based on Discrete Cosine Transform-Discrete Wavelet TransformSingular Value Decomposition

Traditional watermark embedding schemes inevitably modify the data in a host audio signal and lead to the degradation of the host signal.In this paper,a novel audio zero-watermarking algorithm based on discrete wavelet transform(DWT),discrete cosine transform(DCT),and singular value decomposition(SVD) is presented.The watermark is registered by performing SVD on the coefficients generated through DWT and DCT to avoid data modification and host signal degradation.Simulation results show that the proposed zero-watermarking algorithm is strongly robust to common signal processing methods such as requantization,MP3 compression,resampling,addition of white Gaussian noise,and low-pass filtering.

A Dual Tree Complex Discrete Cosine Harmonic Wavelet Transform (ADCHWT) and Its Application to Signal/Image Denoising

A new simple and efficient dual tree analytic wavelet transform based on Discrete Cosine Harmonic Wavelet Transform DCHWT (ADCHWT) has been proposed and is applied for signal and image denoising. The analytic DCHWT has been realized by applying DCHWT to the original signal and its Hilbert transform. The shift invariance and the envelope extraction properties of the ADCHWT have been found to be very effective in denoising speech and image signals, compared to that of DCHWT.

Implementation of Variable Tone Variable Bits Gray-Scale Image Stegnography Using Discrete Cosine Transform

Secure exchange of information is the basic need of modern digital world of e-communication which is achieved either by encrypting information or by hiding information in other information called cover media. Concealing information requires a well designed technique of Stegnography. This work presents a technique, variable tone variable bits (VTVB) Stegnography, to hide information in a cover image. The VTVB Stegnography hides variable data in discrete cosine transform (DCT) coefficients of the cover image. VTVB Stegnography provides variable data hiding capacity and variable distortion. Additional large data hiding this technique provide extra security due to the large key size making VTVB Stegnography technique much more immune to steganalysis. The hiding makes the existence of information imperceptible for steganalysis and the key of keeping a secret makes the recovering of information difficult for an intruder. The key size is depending on cover image and numbers of bits of discrete cosine transform (DCT) coefficients used for information embedding. This is a very flexible technique and can be used for low payload applications, e.g. watermarking to high payload applications, e.g. network Stegnography.

Peak-to-Average Power Ratio Performance Analysis for Orthogonal Chirp Division Multiplexing Multicarrier Systems Based on Discrete Fractional Cosine Transform

In doubly selective fading channels, the orthogonal frequency division multiplexing (OFDM) multicarrier system may fail. Chirp like basis (fractional Fourier transform-fractional cosine transform) may be used instead of complex exponential basis in this case to improve the system performance. However, in multicarrier transmission, the high peak to average power ratio (PAPR) of the transmitted signal is one of the difficult problems that face both the chirp and the exponential basis. In this paper, an evaluation for the PAPR performance of a multicarrier system based on the fractional cosine transform (FrCT) is introduced and then compared with DFrFT and FFT. Moreover, applying the SLAM technique over these systems is provided to understand the behaviour of these systems when applying SLAM. Simulations verify that this system obtains a better PAPR performance. Moreover, further PAPR reduction can be gained using the well-known PAPR reduction methods. Moreover, applying SLAM technique improves the performance of (dB) by 4 dB to 5 dB and all systems become as competitive to each other when SLAM is applied. Finally, BER performance comparison among OFDM, Discrete Cosine Transform MCM (DCT- MCM), Discrete Hartley Transform MCM (DHT-MCM), DFrFT-OCDM and DFrCT- OCDM MCM systems was done by means of simulation over 100,000 multicarrier blocks for each one and showed that our proposed scenario gave the best performance.

Multiple Image Watermarking with Discrete Cosine Transform

Multiple image watermarking is an advanced concept of singular watermarking techniques. The existing singular digital image watermarking techniques cannot obtain all the design goals, such as imperceptibility, robustness, security, and capacity simultaneously with perfection. Hence, the multiple image watermarking technique is designed that embeds several watermarks into the same host image for conveying multiple information. This paper proposed a multiple image watermarking technique with Discrete Cosine Transform (DCT) for ensuring the low computational time for embedding, encryption, decryption as well as extraction of the watermark images. Here, DCT is used to ensure the visual quality of the host image, and a random binary matrix is used to improve the security of the digital image. We have given a basic framework for multiple image watermarking. Our experimental results show satisfactory performance.

NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM

In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, instead of using 2N 1-D DCT’s as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.

Adaptive Biorthogonal Local Discrete Cosine Transform for Interference Excision in Direct Sequence Spread Spectrum Communications

A novel time-frequency domain interference excision technique is proposed. The technique is based on adaptive biorthogonal local discrete cosine trans form (BLDCT). It uses a redundant library of biorthogonal local discrete cosine bases and an efficient concave cost function to match the transform basis to the interfering signal. The main advantage of the algorithm over conventional trans form domain excision algorithms is that the basis functions are not fixed but ca n be adapted to the time-frequency structure of the interfering signal. It is w e ll suited to transform domain compression and suppression of various types of in terference. Compared to the discrete wavelet transform (DWT) that provides logar ithmic division of the frequency bands, the adaptive BLDCT can provide more flex ible frequency resolution. Thus it is more insensitive to variations of jamming frequency. Simulation results demonstrate the improved bit error rate (BER) perf ormance and the increased robustness of the receiver.

Experiments in Parallelizing the Type IV Discrete Cosine Transform

The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method for computing Fourier transforms, the authors present parallel implementations of two new algorithms developed for the type IV Discrete Cosine Transform （DCT-IV） which support the new interleaved fast Fourier transform method. The authors discuss the realizations of their implementations using two paradigms. The first involved commodity equipment and the Message-Passing Interface （MPI） library. The second utilized the RapidMind development platform and the Cell Broadband Engine （BE） processor. These experiments indicate that the authors＇ rotation-based algorithm is preferable to their lifting-based algorithm on the platforms tested, with increased efficiency demonstrated by their MPI implementation for large data sets. Finally, the authors outline future work by discussing an architecture-oriented method for computing DCT-IVs which promises further optimization. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.

FPGA Implementation of Approximate 2D Discrete Cosine Transforms

Discrete cosine transform (DCT) is frequently used in image and video signal processing due to its high energy compaction property. Humans are able to perceive and identify the information from slightly erroneous images. It is enough to produce approximate outputs rather than absolute outputs which in turn reduce the circuit complexity. Numbers of applications like image and video processing need higher dimensional DCT algorithms. So the existing architectures of one dimensional (1D) approximate DCTs are reviewed and extended to two dimensional (2D) approximate DCTs. Approximate 2D multiplier-free DCT architectures are coded in Verilog, simulated in Modelsim to evaluate the correctness, synthesized to evaluate the performance and implemented in virtexE Field Programmable Gate Array (FPGA) kit. A comparative analysis of approximate 2D DCT architectures is carried out in terms of speed and area.

A Discrete Cosine Adaptive Harmonic Wavelet Packet and Its Application to Signal Compression

A new adaptive Packet algorithm based on Discrete Cosine harmonic wavelet transform (DCHWT), (DCAHWP) has been proposed. This is realized by the Discrete Cosine Harmonic Wavelet transform (DCHTWT) which exploits the good properties of DCT viz., energy compaction (low leakage), frequency resolution and computational simplicity due its real nature, compared to those of DFT and its harmonic wavelet version. Hence the proposed wavelet packet is advantageous both in terms of performance and computational efficiency compared to those of existing DFT harmonic wavelet packet. Further, the new DCAHWP also enjoys the desirable properties of a Harmonic wavelet transform over the time domain WT, viz., built in decimation without any explicit antialiasing filtering and easy interpolation by mere concatenation of different scales in frequency (DCT) domain with out any image rejection filter and with out laborious delay compensation required. Further, the compression by the proposed DCAHWP is much better compared to that by adaptive WP based on Daubechies-2 wavelet (DBAWP). For a compression factor (CF) of 1/8, the ratio of the percentage error energy by proposed DCAHWP to that by DBAWP is about 1/8 and 1/5 for considered 1-D signal and speech signal, respectively. Its compression performance is better than that of DCHWT, both for 1-D and 2-D signals. The improvement is more significant for signals with abrupt changes or images with rapid variations (textures). For compression factor of 1/8, the ratio of the percentage error energy by DCAHWP to that by DCHWT, is about 1/3 and 1/2, for the considered 1-D signal and speech signal, respectively. This factor for an image considered is 2/3 and in particular for a textural image it is 1/5.

Numerical Approximation of Real Finite Nonnegative Function by the Modulus of Discrete Fourier Transform

The numerical algorithms for finding the lines of branching and branching-off solutions of nonlinear problem on mean-square approximation of a real finite nonnegative function with respect to two variables by the modulus of double discrete Fourier transform dependent on two parameters, are constructed and justified.

Hankel矩阵的离散Cosine变换的快速算法

在图像和信号处理研究邻域,经常会涉及到结构矩阵的离散sine、快速傅里叶变换(FFT)及离散cosine变换.文献[6]的作者利用FFT给出了离散cosine变换的一个算法,计算变换矩阵的M个元素所需的计算量和存贮空间分别为O(N2logN)+O(M)和O(N2).本文利用Hankel矩阵的结构特点导出一递推关系式(见式(8)),给出了Hankel矩阵的离散cosine变换(DCT)的一个快速算法.该算法所需要的存贮空间为O(N),计算变换矩阵的M个元素所需的计算量为O(NlogN)+O(M).

A Novel De-noising Method Based on Discrete Cosine Transform and Its Application in the Fault Feature Extraction of Hydraulic Pump

Aiming at the existing problems of discrete cosine transform(DCT) de-noising method, we introduce the idea of wavelet neighboring coefficients(WNC) de-noising method, and propose the cosine neighboring coefficients(CNC) de-noising method. Based on DCT, a novel method for the fault feature extraction of hydraulic pump is analyzed. The vibration signal of pump is de-noised with CNC de-noising method, and the fault feature is extracted by performing Hilbert-Huang transform(HHT) to the output signal. The analysis results of the simulation signal and the actual one demonstrate that the proposed CNC de-noising method and the fault feature extraction method have more superior ability than the traditional ones.

基于深度学习的多模态人脸篡改识别

深度伪造技术是一种基于深度学习的图像和音视频合成技术。它使用深度神经网络生成高度逼真的虚构内容,尤其在人脸篡改方面,已对日常生活产生了不良影响。随着深度学习的发展,传统的卷积神经网络难以准确识别当前的人脸篡改行为。为应对该挑战,提出了一种多模态人脸篡改识别方法,创新性地结合了频域处理、错误水平分析以及语义信息进行检测。经过在FaceForensics++数据集上进行实验测试,结果表明,该方法的准确率高达83.10%,是一种有效的人脸篡改检测方法。

Combining discrete cosine transform with clipping for PAPR reduction in intensity-modulated OFDM systems

In this paper, the peak-to-average power ratio(PAPR) of orthogonal frequency division multiplexing(OFDM) signal is reduced by combining the discrete cosine transform(DCT) with clipping in optical intensity-modulated direct-detection(IM/DD) OFDM systems. First, the data are transformed into new modified data by DCT. Second, the proposed scheme utilizes the clipping technique to further reduce the PAPR of OFDM signal. We experimentally demonstrate that the optical OFDM transmission system with this proposed scheme can achieve significant performance improvement in terms of PAPR and bit error rate(BER) compared with the original optical OFDM systems.

基于DCT自适应量化的频谱数据有损压缩算法

针对由于我国频谱监测设备数量激增产生了海量频谱监测数据的存储和传输难题,提出一种基于DCT自适应量化的频谱数据有损压缩算法。首先将多帧频谱监测数据组合并经过灰度空间映射形成一幅时频图,后将时频图数据矩阵按列三等分,将等分后的数据作为RGB三通道合成一幅彩色图像并对其进行二维DCT变换,利用BP神经网络估计量化阈值后进行量化,最后经过游程编码与二次熵编码完成频谱监测数据的压缩。通过对真实接收机采集的频谱数据的压缩处理,压缩率约为10%,数据恢复后的百分比均方根误差约为11%。实验结果表明,所提算法具有稳定的压缩率和较小的恢复误差,能够有效地对实际采集的频谱数据进行压缩。

A fast algorithm for n-D discrete cosine transform

A generalized fast computational algorithm for the n -dimensional discrete cosine transform ( n- D DCT) of length N=2 m(m≥2) is presented. The developed algorithm is theoretically proved and its efficiency is evaluated. The theoretical results show that compared with the conventional method to compute the 1-D DCTs in n directions, the number of multiplications needed by this algorithm is only 1/n of that required by the conventional method; for the total number of additions, it is a bit more when N≤8 and much less when N≥16 than the coventional one. To validate the proposed algorithm, the case when n=3 is taken as an example and applied to the motion picture compression. The results show that the proposed method is superior to MPEG-2.

Smoothing Non-Stationary Time Series Using the Discrete Cosine Transform

This paper considers the problem of smoothing a non-stationary time series(having either deterministic and/or stochastic trends) using the discrete cosine transform(DCT).The DCT is a powerful tool which has found fruitful applications in filtering and smoothing as it can closely approximate the optimal Karhunen-Loeve transform(KLT).In fact,it is known that it almost corresponds to the KLT for first-order autoregressive processes with a root close to unity:This is the case with most economic and financial time series.A number of new results are derived in the paper:(a) The explicit form of the linear smoother based on the DCT,which is found to have time-varying weights and that uses all observations;(b) the extrapolation of the DCT-smoothed series;(c) the form of the average frequency response function,which is shown to approximate the frequency response of the ideal low pass filter;(d) the asymptotic distribution of the DCT coefficients under the assumptions of deterministic or stochastic trends;(e) two news method for selecting an appropriate degree of smoothing,in general and under the assumptions in(d).These findings are applied and illustrated using several real world economic and financial time series.The results indicate that the DCT-based smoother that is proposed can find many useful applications in economic and financial time series.

Fast 2-D 8×8 discrete cosine transform algorithm for image coding

A new fast two-dimension 8×8 discrete cosine transform （2D 8×8 DCT） algorithm based on the characteristics of the basic images of 2D DCT is presented. The new algorithm computes each DCT coefficient in turn more independently. Hence, the new algorithm is suitable for 2D DCT pruning algorithm of pruning away any number of high-frequency components of 2D DCT. The proposed pruning algorithm is more efficient than the existing pruning 2D DCT algorithms in terms of the number of arithmetic operations, especially the number of multiplications required in the computation.