Copyright protection has become a need in today’s world. To achieve a secure copyright protection we embedded some information in images and videos and that image or video is called copyright protected. The embedded information can’t be detected by human eye but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright prot...

This paper is concerned with the approach to teaching an introductory course on Fourier theory for engineers. Commonly called Signals and Systems (or some variation), this course generally introduces four transforms: the Fourier Transform, the Fourier Series, the Discrete-Time Fourier Transform (DTFT), and the Discrete Fourier Transform (DFT). Our concern is that the method and order of topic p...

In traditional watermarking algorithms, the insertion of watermark into the host signal inevitably introduces some perceptible quality degradation. Another problem is the inherent conflict between imperceptibility and robustness. Zero-watermarking technique can solve these problems successfully. Instead of embedding watermark, the zero-watermarking technique extracts some essential characterist...

In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...

The widely known Discrete Fourier Transform (DFT), the frequency-domain representation of a finite-length time-domain sequence is an orthogonal transform and has been for very long time found many application. popularity DFT increased tremendously after publication Fast (FFT) algorithm by Cooley Tukey in 1965 <xref ref-type="bibr" rid="ref1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:...

Four Fourier transforms are usually defined, the Integral Fourier transform, the Discrete-Time Fourier transform (DTFT), the Discrete Fourier transform (DFT) and the Integral Fourier transform for periodic functions. However, starting from their definitions, we show that all four Fourier transforms can be reduced to actually only one Fourier transform, the Fourier transform in the distributiona...

A method that performs multiresolution enhancement, adaptive to breast components, for optimal visualization of the entire breast area is presented. The method includes an edge detection step to distinguish breast area from mammogram background and employs Gaussian mixture modeling to segment breast components (uncompressed fat, fat and dense). The original image is decomposed using a redundant...

In this article, a new technique for features extraction from SAR interferograms is presented. The technique combines the properties of auto-associative neural networks with those of more traditional approaches such as discrete Fourier transform or discrete wavelet transform. The feature extraction is chained to another neural module performing the estimation of the fault parameters characteriz...

This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DFRST are based on the eigen decomposition of DCT and DST kernels. This is the same idea as that of the discrete fractional Fourier transform (DFRFT); the eigenvalue and eigenvector relationships between the DFRCT, DFRS...

We show that a stationary signal concept such as the Fourier transform (FT) can be linked to a time-varying (TV) concept such as linear TV filtering. In particular, we give a continuous-time and discrete-time linear TV filter interpretation to continuous-time FT and discrete Fourier transform (DFT), respectively. As a consequence, important variants such as warped DFT, DCT, DST also can be view...