Biorthogonal partners and applications

Two digital filters H(z) and F(z) are said to be biorthogonal partners of each other if their cascade H(z)F(z) satisfies the Nyquist or zero-crossing property. Biorthogonal partners arise in many different contexts such as filterbank theory, exact and least squares digital interpolation, and multiresolution theory. They also play a central role in the theory of equalization, especially, fractionally spaced equalizers in digital communications. We first develop several theoretical properties of biorthogonal partners. We also develop conditions for the existence of biorthogonal partners and FIR biorthogonal pairs and establish the connections to the Riesz basis property. We then explain how these results play a role in many of the above-mentioned applications

Rotation and Scale Invariant Texture Classification

Texture classification is very important in image analysis. Content based image retrieval, inspection of surfaces, object recognition by texture, document segmentation are few examples where texture classification plays a major role. Classification of texture images, especially those with different orientation and scale changes, is a challenging and important problem in image analysis and classification. This thesis proposes an effective scheme for rotation and scale invariant texture classification. The rotation and scale invariant feature extraction for a given image involves applying a log-polar transform to eliminate the rotation and scale effects, but at same time produce a row shifted log-polar image, which is then passed to an adaptive row shift invariant wavelet packet transform to eliminate the row shift effects. So, the output wavelet coefficients are rotation and scale invariant. The adaptive row shift invariant wavelet packet transform is quite efficient with only O (n*log n) complexity. The experimental results, based on different testing data sets for images from Brodatz album with different orientations and scales, show that the implemented classification scheme outperforms other texture classification methods, its overall accuracy rate for joint rotation and scale invariance being 87.09 percent

Wavelet-Based Audio Embedding & Audio/Video Compression

With the decline in military spending, the United States relies heavily on state side support. Communications has never been more important. High-quality audio and video capabilities are a must. Watermarking, traditionally used for copyright protection, is used in a new and exciting way. An efficient wavelet-based watermarking technique embeds audio information into a video signal. Several highly effective compression techniques are applied to compress the resulting audio/video signal in an embedded fashion. This wavelet-based compression algorithm incorporates bit plane coding, first difference coding, and Huffman coding. To demonstrate the potential of this audio embedding audio/video compression system, an audio signal is embedded into a video signal and the combined signal is compressed. Results show that overall compression rates of 15:1 can be achieved. The video signal is reconstructed with a median PSNR of nearly 33dB. Finally, the audio signal is extracted with out error

Nearly orthogonal, doppler tolerant waveforms and signal processing for multi-mode radar applications

In this research, we investigate the design and analysis of nearly orthogonal, Doppler tolerant waveforms for diversity waveform radar applications. We then present a signal processing framework for joint synthetic aperture radar (SAR) and ground moving target indication (GMTI) processing that is built upon our proposed waveforms. ^ To design nearly orthogonal and Doppler tolerant waveforms, we applied direct sequence spread spectrum (DSSS) coding techniques to linear frequency modulated (LFM) signals. The resulting transmitted waveforms are rendered orthogonal using a unique spread spectrum code. At the receiver, the echo signal can be decoded using its spreading code. In this manner, transmit orthogonal waveforms can be matched filtered only with the intended receive signals. ^ Our proposed waveforms enable efficient SAR and GMTI processing concurrently without reconfiguring a radar system. Usually, SAR processing requires transmit waveforms with a low pulse repetition frequency (PRF) rate to reduce range ambigu- ity; on the other hand, GMTI processing requires a high PRF rate to avoid Doppler aliasing and ambiguity. These competing requirements can be tackled by employing some waveforms (with low PRF) for the SAR mission and other waveforms (with high PRF) for the GMTI mission. Since the proposed waveforms allow separation of individual waveforms at the receiver, we can accomplish both SAR and GMTI processing jointl

A new class of two-channel biorthogonal filter banks and wavelet bases

We propose a novel framework for a new class of two-channel biorthogonal filter banks. The framework covers two useful subclasses: i) causal stable IIR filter banks. ii) linear phase FIR filter banks. There exists a very efficient structurally perfect reconstruction implementation for such a class. Filter banks of high frequency selectivity can be achieved by using the proposed framework with low complexity. The properties of such a class are discussed in detail. The design of the analysis/synthesis systems reduces to the design of a single transfer function. Very simple design methods are given both for FIR and IIR cases. Zeros of arbitrary multiplicity at aliasing frequency can be easily imposed, for the purpose of generating wavelets with regularity property. In the IIR case, two new classes of IIR maximally flat filters different from Butterworth filters are introduced. The filter coefficients are given in closed form. The wavelet bases corresponding to the biorthogonal systems are generated. the authors also provide a novel mapping of the proposed 1-D framework into 2-D. The mapping preserves the following: i) perfect reconstruction; ii) stability in the IIR case; iii) linear phase in the FIR case; iv) zeros at aliasing frequency; v) frequency characteristic of the filters

Discrete multitone modulation with principal component filter banks

Discrete multitone (DMT) modulation is an attractive method for communication over a nonflat channel with possibly colored noise. The uniform discrete Fourier transform (DFT) filter bank and cosine modulated filter bank have in the past been used in this system because of low complexity. We show in this paper that principal component filter banks (PCFB) which are known to be optimal for data compression and denoising applications, are also optimal for a number of criteria in DMT modulation communication. For example, the PCFB of the effective channel noise power spectrum (noise psd weighted by the inverse of the channel gain) is optimal for DMT modulation in the sense of maximizing bit rate for fixed power and error probabilities. We also establish an optimality property of the PCFB when scalar prefilters and postfilters are used around the channel. The difference between the PCFB and a traditional filter bank such as the brickwall filter bank or DFT filter bank is significant for effective power spectra which depart considerably from monotonicity. The twisted pair channel with its bridged taps, next and fext noises, and AM interference, therefore appears to be a good candidate for the application of a PCFB. This is demonstrated with the help of numerical results for the case of the ADSL channel

An advanced image compression technique by using a coupled compression algorithms depend on different wavelet methods

Digital images need a large storage capacity, and as a result they need a large bandwidth for data transmission to deliver to the desired destination over the network. Image compression technologies not only reduce the size of stored data, but also maintain as much as possible the output image quality. In the proposed research we review a technique for image compression that uses a distinct two-stage image encoding method using different compression algorithms and wavelet transform methods, which combines two types of effective compression algorithms that give more ability to compress image data. The proposed compression technique which coupled two image compression algorithms that put to use premium characteristics from each algorithm. The wavelet transform methods contribute effectively to finding suitable solutions to supply better compression ratios for images with high resolution. The complete series of compression includes repeated stages of encoding and decoding, in addition to the wavelet processing itself. This study will have carried out an advanced compression technique that contain a coupled compression algorithms relying on the preferred wavelets to this work from practical experiments they are, biorthogonal and Haar wavelet transform, the performance metrics for tested true HD color image will be studied. The challenge for image compression algorithms is to detect a best solution between a low compression ratio and good visual perception results. An essential measure of achieved image compression process is taken by compression ratio CR and the ratio of bit-per-pixel BPP. The CR and BPP metrics are important components in image compression techniques. Through the results of the image compression metrics in two stages, the best practical results were obtained when the compression ratio metric CR was equal to 2.3%, and this metric indicates that the compressed image can be stored using 2.3% of the original image data size. While the BPP which represent the bit number that used to store one pixel of true color image is equal to 0.575

A Wavelet Visible Difference Predictor

In this paper, we describe a model of the human visual system (HVS) based on the wavelet transform. This model is largely based on a previously proposed model, but has a number of modifications that make it more amenable to potential integration into a wavelet based image compression scheme. These modifications include the use of a separable wavelet transform instead of the cortex transform, the application of a wavelet contrast sensitivity function (CSF), and a simplified definition of subband contrast that allows us to predict noise visibility directly from wavelet coefficients. Initially, we outline the luminance, frequency, and masking sensitivities of the HVS and discuss how these can be incorporated into the wavelet transform. We then outline a number of limitations of the wavelet transform as a model of the HVS, namely the lack of translational invariance and poor orientation sensitivity. In order to investigate the efficacy of this wavelet based model, a wavelet visible difference predictor (WVDP) is described. The WVDP is then used to predict visible differences between an original and compressed (or noisy) image. Results are presented to emphasize the limitations of commonly used measures of image quality and to demonstrate the performance of the WVDP. The paper concludes with suggestions on how the WVDP can be used to determine a visually optimal quantization strategy for wavelet coefficients and produce a quantitative measure of image quality

Statistically optimum pre- and postfiltering in quantization

We consider the optimization of pre- and postfilters surrounding a quantization system. The goal is to optimize the filters such that the mean square error is minimized under the key constraint that the quantization noise variance is directly proportional to the variance of the quantization system input. Unlike some previous work, the postfilter is not restricted to be the inverse of the prefilter. With no order constraint on the filters, we present closed-form solutions for the optimum pre- and postfilters when the quantization system is a uniform quantizer. Using these optimum solutions, we obtain a coding gain expression for the system under study. The coding gain expression clearly indicates that, at high bit rates, there is no loss in generality in restricting the postfilter to be the inverse of the prefilter. We then repeat the same analysis with first-order pre- and postfilters in the form 1+αz-1 and 1/(1+γz^-1 ). In specific, we study two cases: 1) FIR prefilter, IIR postfilter and 2) IIR prefilter, FIR postfilter. For each case, we obtain a mean square error expression, optimize the coefficients α and γ and provide some examples where we compare the coding gain performance with the case of α=γ. In the last section, we assume that the quantization system is an orthonormal perfect reconstruction filter bank. To apply the optimum preand postfilters derived earlier, the output of the filter bank must be wide-sense stationary WSS which, in general, is not true. We provide two theorems, each under a different set of assumptions, that guarantee the wide sense stationarity of the filter bank output. We then propose a suboptimum procedure to increase the coding gain of the orthonormal filter bank