Interpreting remotely-sensed data typically requires expensive, specialized computing machinery capable of storing and manipulating large amounts of data quickly. In this paper, we present a method for accurately analyzing and categorizing remotely-sensed data on much smaller, less expensive platforms. Data size is reduced in such a way as to retain the integrity of the original data, where the...

As part of the THIMP project (Telephony for HearingIMpaired People), we aim at automatically analyzing Cued Speech [1] and translating it into oral spoken language. This work focuses on vowel classification and will be part of this transcoding process as a preprocessing step of the input data analysis. Its objective is to identify vowels produced by a speaker pronouncing and coding in Cued Spee...

We consider the cell probe complexity of the polynomial evaluation problem with preprocessing of coeecients, for polynomials of degree at most n over a nite eld K. We show that the trivial cell probe algorithm for the problem is optimal if K is suuciently large compared to n. As an application, we give a new proof of the fact that P 6 = incr-TIME(o(log n= log log n)).

An original image is compressed with fuzzy transforms and is divided in images of sizes 2×2 on which we apply a known fragile watermarking process. A preprocessing phase is considered to determine the better compression rate for the coding process. We test this scheme in tamper detection analysis on a sample of images. The results are good in terms of accuracy for tamper detection with compress...

Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several basic ingredients. However, not all of those ingredients have been analyzed in a dynamic scenario where edge weights change after preprocessing. In this work, we present how one of those ingredients, i.e., Arc-Flags can be app...

In many situations involving analysis of experimental data, there exists a degree of redundancy. It is advantageous to identify and reduce the redundant elements of the data in order to reduce the dimensionality of the data, thus enabling better modelling or representation. The subsequent modelling may be performed using linear or nonlinear techniques, whose e ciency may be aided by the preproc...

By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in O(nk logn) time, assuming one curve has ply k. 1998 ACM Subject Classification F.2.2 [Nonnumerical Algorithms and Problems] Geometrical Problems and Computations