This paper presents an abstraction layer for short vector SIMD ISA extensions like Intel’s SSE, AMD’s 3DNow!, Motorola’s AltiVec, and IBM’s Double Hummer. It provides unified access to short vector instructions via intermediate level building blocks. These primitives are C macros that allow, for instance, portable and highly efficient implementations of discrete linear transforms like FFTs and ...

A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider stability and optimality. To address these problems, we propose methodologies to design stable and optimal PLUS factorization algorithms. Firstly, we propose three stable PLUS factorization algorithms, prove the stabi...

A new recursive algorithm for fast computation of twodimensional discrete cosine transforms (2-D DCT) is derived by converting the 2-D data matrices into 1-D vectors and then using different partition methods for the time and frequency indices. The algorithm first computes the 2-D complex DCT (2-D CCT) and then produces two 2-D DCT outputs simultaneously through a post-addition step. The decomp...

This study is a contribution to the field of visual speech processing. It focuses on the automatic extraction of Speech lip features from natural lips. The method is based on the direct prediction of these features from predictors derived from an adequate transformation of the pixels of the lip region of interest. The transformation is made of a 2-D Discrete Cosine Transform combined with a Pri...

Insoluble Dendronized Chitosan (DCTS) was prepared to improve the adsorption capacity of chitosan (CTS) as well as to lower its solubility at lower pH for efficient removal of acid dye, Acid Blue 9 (AB 9) from aqueous solutions. Dendronized chitosan was prepared by grafting ‘dendrimer-like’ Polyamidoamine (PAMAM) onto CTS surface using Michael addition reaction followed by amidation reaction. T...

Correct recognition of human action is the basis for home service robots. Human action recognition is a research hotspot unsolved completely at present. This paper presents a new way of human action recognition. RBF (Radial Basis Function) neural networks-based methodology using silhouette as a representative descriptor of human posture to achieve daily human actions recognition is proposed. Th...

The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFTs of size k and m. In this paper we present a theorem that decomposes a polynomial transform into smaller polynomial transforms, and show that the FFT is obtained as a special case. Then we use this theorem to derive a new class of recursive algorithms for the discrete cosine transforms (...

Recent compressive sensing results show that it is possible to accurately reconstruct certain compressible signals from relatively few linear measurements via solving nonsmooth convex optimization problems. In this paper, we propose a simple and fast algorithm for signal reconstruction from partial Fourier data. The algorithm minimizes the sum of three terms corresponding to total variation, `1...