This paper presents a new Quality-Controlled, wavelet based, compression method for electrocardiogram (ECG) signals. Initially, an ECG signal is decomposed using the wavelet transform. Then, the resulting coefficients are iteratively thresholded to guarantee that a predefined goal percent root mean square difference (GPRD) is matched within tolerable boundaries. The quantization strategy of ext...

We investigate degenerate saddle point problems, which can be viewed as limit cases of standard mixed formulations of symmetric problems with large jumps in coefficients. We prove that they are well-posed in a standard norm despite the degeneracy. By wellposedness we mean a stable dependence of the solution on the right-hand side. A known approach of splitting the saddle point problem into sepa...

We have previously reported on a novel number representation using 2 bases which we refer to as the double-base number system (DBNS). Our preferred implementation uses the relatively prime bases {2,3}. If we allow the exponents of the bases to be arbitrarily large signed integers, then we can represent any real number to any arbitrary precision by a single digit DBNS representation. By represen...

This paper addresses the use of low power techniques applied to FIR filter and FFT dedicated datapath architectures. New low power arithmetic operators are used as basic modules. In FIR filter and FFT algorithms, 2’s complement is the most common encoding for signed operands. We use a new architecture for signed multiplication, which maintains the pure form of an array multiplier. This architec...

Texture can be interpreted as a measure of the 'edginess' about a pixel and can thus be described by edge co-occurrence matrices. The matrix can be decomposed using 2-dimensional orthogonal Hermite functions, the coefficients of which provide a low order feature vector which is characteristic of the texture. The Hermite coefficients for 240 hand-segmented regions of grass, trees, sky and river ...

A method for designing fast multidimensional filters using genetic algorithms is described. The filter is decomposed into component filters where coefficients can be sparsely scattered using filter networks. Placement of coefficients in the filters is done by genetic algorithms and the resulting filters are optimized using an alternating least squares approach. The method is tested on a 2-D qua...

This report introduces a novel sparse decomposition model for hyperspectral image reconstruction. The model integrates two well-known sparse structures of hyperspectral images: a small set of signature spectral vectors span all spectral vectors (one at each pixel), and like a standard image, a hyperspectral image is spatially redundant. In our model, a threedimensional hyperspectral cube X is f...

The boundary value problem (BVP) for the varying coefficient linear Caputo-type fractional differential equation subject to mixed conditions on interval 0≤x≤1 was considered. First, BVP converted into an equivalent differential–integral merging conditions. Then, shifted Chebyshev polynomials and collocation method were used solve equation. Varying coefficients also decomposed truncated series s...

Digital watermarking is the process to hide digital pattern directly into a digital content. Digital watermarking techniques are used to address digital rights management, protect information and conceal secrets. An invisible non-blind watermarking approach for gray scale images is proposed in this paper. The host image is decomposed into 3-levels using Discrete Wavelet Transform. Based on the ...

if the polynomial has no roots in [−1, 1]. If the inverse polynomial is decomposed into partial fractions, the an are linear combinations of simple functions of the polynomial roots. If the first k of the coefficients an are known, the others become linear combinations of these with expansion coefficients derived recursively from the bj ’s. On a closely related theme, finding a polynomial with ...