Full gravity gradient tensors from vertical gravity by cosine transform

We present a method to calculate the full gravity gradient tensors from pre-existing vertical gravity data using the cosine transform technique and discuss the calculated tensor accuracy when the gravity anomalies are contaminated by noise. Gravity gradient tensors computation on 2D infinite horizontal cylinder and 3D ＂Y＂ type dyke models show that the results computed with the DCT technique are more accurate than the FFT technique regardless if the gravity anomalies are contaminated by noise or not. The DCT precision has increased 2 to 3 times from the standard deviation. In application, the gravity gradient tensors of the Hulin basin calculated by DCT and FFT show that the two results are consistent with each other. However, the DCT results are smoother than results computed with FFT. This shows that the proposed method is less affected by noise and can better reflect the fault distribution.

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.

Fabric Pattern Elements Retrieval Based on Cosine Transform

Fabric pattern contains many types of the available pattern elements, which not only can be used for the researchers, but also as the material for the designer. But existing method focus on the complete image retrieval, therefore lack methods of retrieving pattern elements. This article proposes a pattern elements retrieval algorithm based on cosine transform. Firstly, automatically segment the patterns according to size and location and filter the similar primary patterns, then, through cosine transform, analyze elements features in DCT domain, extract amplitude frequency and phase frequency. We employ 2-norm to measure the similarity, search 10 similar pattern elements in the sample library and save them in the design resources library. Experiment results indicate that this algorithm performs well while used in palace costume and carpet patterns, and got more than 75% of the average recall in 100 times experiments

Logarithmic Sine and Cosine Transforms and Their Applications to Boundary-Value Problems Connected with Sectionally-Harmonic Functions

Let stand for the polar coordinates in R2, ?be a given constant while satisfies the Laplace equation in the wedge-shaped domain or . Here αj(j = 1,2,...,n + 1) denote certain angles such that αj αj(j = 1,2,...,n + 1). It is known that if r = a satisfies homogeneous boundary conditions on all boundary lines ?in addition to non-homogeneous ones on the circular boundary , then an explicit expression of in terms of eigen-functions can be found through the classical method of separation of variables. But when the boundary?condition given on the circular boundary r = a is homogeneous, it is not possible to define a discrete set of eigen-functions. In this paper one shows that if the homogeneous condition in question is of the Dirichlet (or Neumann) type, then the logarithmic sine transform (or logarithmic cosine transform) defined by (or ) may be effective in solving the problem. The inverses of these transformations are expressed through the same kernels on or . Some properties of these transforms are also given in four theorems. An illustrative example, connected with the heat transfer in a two-part wedge domain, shows their effectiveness in getting exact solution. In the example in question the lateral boundaries are assumed to be non-conducting, which are expressed through Neumann type boundary conditions. The application of the method gives also the necessary condition for the solvability of the problem (the already known existence condition!). This kind of problems arise in various domain of applications such as electrostatics, magneto-statics, hydrostatics, heat transfer, mass transfer, acoustics, elasticity, etc.

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.

ON DOUBLE SINE AND COSINE TRANSFORMS,LIPSCHITZ AND ZYGMUND CLASSES

We consider complex-valued functions f ∈ L^1 （R^2＋）, where R＋ ：= [0,∞）, and prove sufficient conditions under which the double sine Fourier transform fss and the double cosine Fourier transform fcc belong to one of the two-dimensional Lipschitz classes Lip（a,β） for some 0 〈 α,β ≤ 1; or to one of the Zygmund classes Zyg（α,β） for some 0 〈 α,β ≤ 2. These sufficient conditions are best possible in the sense that they are also necessary for nonnegative-valued functions f ∈ L^1 （R^2＋）.

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.

基于分数阶Cosine和Sine变换说话人证实特征的提取

提出了基于分数阶Cosine变换和分数阶Sine变换用于说话人证实的新颖特征,即广义Bark平均能量差和主、从分数阶域间广义Bark平均能量差。为考核这些特征的实用性能,完成了一系列说话人证实实验。虽然上述特征的单一应用并未体现出极佳的准确率,但它们经过合理组合后的性能同原单一特征相比更能良好地描述说话人声音个性。

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).

求广义KP方程精确行波解的sine-cosine方法和推广的tanh方法

运用sine-cosine方法和推广的tanh方法求解广义KP方程,以获得其类孤立波解和紧孤子解,这2类精确解的主要特点是具有超强的稳定性,从而对非线性偏微分方程的研究具有重要的意义,sine-cosine方法和推广的tanh方法为众多的非线性偏微分方程的求解提供了有效的数学工具。

一种基于Logistic-Sine-Cosine映射的彩色图像加密算法

科技的飞速发展为拍摄和分享图像带来了便利,但随着图像数据的急剧增多,泄露和篡改等安全问题也频频发生,图像加密技术的应用迫在眉睫,尤其是彩色图像的加密急需改进与发展。传统的加密技术主要是针对数据流加密,其效率低、计算量大,存在一定的局限性。基于变换域加密将图像从空域变换到频域进行加密再变换到空域,属于一种有损加密。基于混沌的加密,密钥空间大,实现简单,加密速度快,一般需要采用多个混沌系统来增强加密的安全性。为此,文中设计了一种针对彩色图像RGB三通道的简单安全的空域加密算法,先由Logistic-Sine-Cosine映射生成较为安全的混沌序列,接着利用混沌序列设计4轮置乱和扩散像素,最后,在一系列安全性分析实验中验证了基于Logistic-Sine-Cosine映射的彩色图像加密算法的安全性和有效性。

基于Logistic-Sine-Cosine映射的图像加密算法

为了提高数字图像加密的速度和算法的安全性,提出了基于Fridrich框架的加密算法。通过Fisher-Yates变换置乱原始图像打破像素间的强相关性,再利用滤波器在RGB平面上进行滤波得到密文。Logistic-Sine-Cosine复合混沌系统具有良好的混沌特性,且时间复杂度低。密钥由输入参数和明文的SHA-512值共同决定,对明文高度敏感。二维滤波器扩散效果良好,其滤波器模板由明文和密钥决定并引入了伪随机像素值,在提升扩散效果的同时增强了系统抗差分攻击的能力。仿真结果表明,密文图像像素分布近似均匀、像素关联性弱、密钥空间足够大、密钥敏感性高,能够有效抵抗暴力、裁剪、差分等常见攻击,具有较高的安全性,且算法时间复杂度较低。

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.