Image coding by multistep, adaptive flux interpolation

The authors describe and discuss the new technique, multistep adaptive flux interpolation (MAFI), and its application to image data for coding. When applied to an image, MAFI produces an output which is also in an image form, but which has a more uniform feature density and a greatly reduced size. MAFI warps the input image by removing those rows and columns which contain a majority of redundant pixels. The side information required for reconstruction is minimal, and the image can be further compressed using conventional coders, making the compression ratio even higher. Because of its warped nature, the MAFI output's statistics are also more consistent with the properties assumed by block-based discrete cosine transform (DCT) methods     

Dynamic programming implementation on array processor architectures

Dynamic Programming (DP) applies to many signal and image processing applications including boundary following, the Viterbi algorithm, dynamic time warping, etc. This paper presents an array processor implementation of generic dynamic programming. Our architecture is a SIMD array attached to a host computer. The processing element of the architecture is based on an ASIC design opting for maximum speed-up. By adopting a torus interconnection network, a dual buffer structure, and a multilevel pipeline, the performance of the DP chip is expected to reach the order of several GOPS. The paper discusses both the dedicated hardware design and the data flow control of the DP chip and the total array.This work was supported in part by the NATO, Scientific and Environmental Affairs Division, Collaborative Research Grant SA.5-2-05(CRG.960201)424/96/JARC-501.     

Letters to the Editor

The Mathematical Intelligencer encourages comments about the material in this issue. Letters to the editor should be sent to either of the editors-in-chief, Chandler Davis or Marjorie Senechal.     

Profile dependence and measurement of absolute Raman scattering cross-section in optical fibres

A simple measurement method for the absolute Raman scattering cross-section of an optical fibre is presented. This method does not require a high power pump laser and it measures the fibre directly. It is also shown that the calculation of the cross-section depends on the fibre structure, such as its refractive index profile and the differential attenuation between the pump wavelength and Raman wavelength.<>     

Variant superfield representations

We discuss some variant superfield representations which can arise by the replacement of some of the usual fields in a multiplet with p-form gauge fields.     

Estimates for transition probabilities on a compact manifold

The purpose of this note is to describe a procedure for transferring familiar estimates for transition probabilities on RN to transition probabilities on compact manifolds.     

QRS feature extraction using linear prediction

This communication proposes a method called linear prediction (a high performant technique in digital speech processing) for analyzing digital ECG signals. There are several significant properties indicating that ECG signals have an important feature in the residual error signal obtained after processing by Durbin's linear prediction algorithm. This communication also indicates that the prediction order need not be more than two for fast arrhythmia detection. The ECG signal classification puts an emphasis on the residual error signal. For each ECG's QRS complex, the feature for recognition is obtained from a nonlinear transformation which transforms every residual error signal to a set of three states pulse-code train relative to the original ECG signal. The pulse-code train has the advantage of easy implementation in digital hardware circuits to achieve automated ECG diagnosis. The algorithm performs very well in feature extraction in arrhythmia detection. Using this method, our studies indicate that the PVC (premature ventricular contraction) detection has at least a 92 percent sensitivity for MIT/BIH arrhythmia database.     

Fast search techniques for use in vector quantisation and related pattern matching applications

Two techniques for the design and fast search of a vector quantiser codebook are proposed. These classify speech data vectors according to (i) the sign and (ii) the slope between successive samples. With both techniques the performance obtained is superior to that obtained from a conventional gain/shape vector quantiser and comparable to that of a full search vector quantiser. A major attraction of both approaches is that they significantly reduce the number of computations required for the codebook search.