One of the main requirements in many signal processing applications is to have a “meaningful representation” in which signal’s characteristics are readily apparent. For example, for recognition, the representation should highlight salient features; for denoising, it should efficiently separate signal and noise; and for compression, it should capture a large part of signal using only a few coeff...

One of the main requirements in many signal processing applications is to have a “meaningful representation” in which signal’s characteristics are readily apparent. For example, for recognition, the representation should highlight salient features; for denoising, it should efficiently separate signal and noise; and for compression, it should capture a large part of signal using only a few coeff...

We construct a new method for approximating Hilbert transforms and their inverse throughout the complex plane. Both problems can be formulated as Riemann–Hilbert problems via Plemelj’s lemma. Using this framework, we rederive existing approaches for computing Hilbert transforms over the real line and unit interval, with the added benefit that we can compute the Hilbert transform in the complex ...

In this work we propose several parallel algorithms to compute the twodimensional discrete wavelet transform (2D-DWT), exploiting the available hardware resources. In particular, we will explore OpenMP optimized versions of 2DDWT over a multicore platform and we will also develop CUDA-based 2D-DWT algorithms which are able to run on GPUs (Graphics Processing Unit). The proposed algorithms are b...

The low voltage level synchrophasor measurement data are investigated to estimate the damping ratio and to detect any oscillation mode using Fast Fourier Transform (FFT) and Continuous Wavelet Transform (CWT). Complex Morlet (CM) is selected as a mother wavelet function considering its ability to reveal time and frequency localization simultaneously. A Two Area Four Machine System (TAFMS) model...

Recently, randomizing input transformations have been developed for streamlining Gaussian elimination. Multiplying by special sparse random matrices, these transformations produce an equivalent linear system which, with probability 1, Gaussian elimination can solve without any augmentation by pivoting. In this paper we study properties of the unitary Randomizing Discrete Fourier Transform (RDFT...

The application of the mixed-radix fast Fourier transform algorithm and the Winograd Fourier transform algorithm for solving a probabilistic production costing problem is proposed. The two algorithms are used to estimate the energy generated by each unit of a generation system directly in the Fourier domain which saves a considerable amount of computational time. A comparison between the two al...

Abstract Wavelet coding has been shown to achieve better compression than DCT coding. This method outperforms DCT JPEG codecs and moreover allows scalability. 2D DWT can be easily extended to 3D and thus applied to video coding [1, 2, 3, 4, 5, 6, 7, 8]. However, 3D subband coding of video suffers from two drawbacks. The first is the amount of memory required for coding large 3D blocks; the seco...

For the open unit disc $\mathbb{D}$ in complex plane, it is well known that if $\phi \in C(\overline{\mathbb{D}})$ then its Berezin transform $\widetilde{\phi}$ also belongs to $C(\overline{\mathbb{D}})$. We say BC-regular. In this paper we study BC-regularity of some pseudoconvex domains $\mathbb{C}^n$ and show boundary geometry plays an important role. establish a relationship between essenti...

As the next generation of video coding standard, High Efficiency Video Coding (HEVC) adopted many useful tools to improve coding efficiency. Sample Adaptive Offset (SAO), is a technique to reduce sample distortion by providing offsets to pixels in in-loop filter. In SAO, pixels in LCU are classified into several categories, then categories and offsets are given based on Rate-Distortion Optimiza...