Recent results by Van Buskirk et al. have broken the record set by Yavne in 1968 for the lowest arithmetic complexity (exact count of real additions and multiplications) to compute a power-of-two discrete Fourier transform. Here, we present a simple recursive modification of the split-radix algorithm that computes the DFT with asymptotically about 6% fewer operations than Yavne, matching the co...

In this paper all basic image compression techniques have been discussed. The image compression techniques which are useful in their related areas are analyzed. Compression methods DCT and DWT recently used for image compression which gives better compression ratio. This review paper gives clear idea about basic compression techniques and method. Keywords— MDP, KLT, SIFT, S-PCA

In this article a review on the definition of the X- ray transform and some ofits applications in Nano crystallography is presented. We shall show that the X- raytransform is a special case of the Radon transform on homogeneous spaces when thetopological group E(n)- the Euclidean group - acts on ℝ2 transitively. First someproperties of the Radon transform are investigated then the relationship ...

Image fusion is defined as the process of combining tw o or more different images into a new single image retaining important features from each image w ith extended information content. There are two approaches to image fusion, namely Spatial Fusion and Transform fusion. In Spatial fusion, the pixel values from the source images are directly summed up and taken average to form the pixel of the...

Due to the efficiency in implementation, the Walsh (Hadamard) transform plays an important role in signal analysis and communication. Recently, Lee generalized the Walsh transform into the Jacket transform. Since the entries of the Jacket transform can be ±2, it is more flexible than the Walsh transform. Both the Walsh transform and the Jacket transform are defined for the case where the length...

This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced. The FFDCT pair in GF(p) is defined, having blocklengths that are divisors of (p+1)/2. A special case is the Mersenne FFDCT, defined when p is a Mersenne pri...

It is known that the Williamson construction for Hadamard matrices can be generalized to constructions using sums of tensor products. This paper describes a specific construction using real monomial representations of Clifford algebras, and its connection with graphs of amicability and anti-amicability. It is proven that this construction works for all such representations where the order of th...