Search results for "Crete"

Discrete wavelet transform implementation in Fourier domain for multidimensional signal

2002

Wavelet transforms are often calculated by using the Mallat algorithm. In this algorithm, a signal is decomposed by a cascade of filtering and downsampling operations. Computing time can be important but the filtering operations can be speeded up by using fast Fourier transform (FFT)-based convolutions. Since it is necessary to work in the Fourier domain when large filters are used, we present some results of Fourier-based optimization of the sampling operations. Acceleration can be obtained by expressing the samplings in the Fourier domain. The general equations of the down- and upsampling of digital multidimensional signals are given. It is shown that for special cases such as the separab…

A Robust Wrap Reduction Algorithm for Fringe Projection Profilometry and Applications in Magnetic Resonance Imaging.

2017

In this paper, we present an effective algorithm to reduce the number of wraps in a 2D phase signal provided as input. The technique is based on an accurate estimate of the fundamental frequency of a 2D complex signal with the phase given by the input, and the removal of a dependent additive term from the phase map. Unlike existing methods based on the discrete Fourier transform (DFT), the frequency is computed by using noise-robust estimates that are not restricted to integer values. Then, to deal with the problem of a non-integer shift in the frequency domain, an equivalent operation is carried out on the original phase signal. This consists of the subtraction of a tilted plane whose slop…

Real-Time Vector Automata

2013

We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations

2009

We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with respect to its length. Thus the finite satisfiability problem for two-variable logic over the class of structures with two equivalence relations is decidable in nondeterministic triply exponential time. We also show that replacing one of the equivalence relations in the considered class of structures by a relation which is only required to be transitive leads to undecidability. This sharpens the earlier result that two-variable logic is undecidable over the class of structures with two transitive relations.

Le filtre de Kalman étendu à grand-gain adaptatif et ses applications

2010

The work concerns the “observability problem”—the reconstruction of a dynamic process’s full state from a partially measured state— for nonlinear dynamic systems. The Extended Kalman Filter (EKF) is a widely-used observer for such nonlinear systems. However it suffers from a lack of theoretical justifications and displays poor performance when the estimated state is far from the real state, e.g. due to large perturbations, a poor initial state estimate, etc. . . We propose a solution to these problems, the Adaptive High-Gain (EKF). Observability theory reveals the existence of special representations characterizing nonlinear systems having the observability property. Such representations ar…

Discrete Dynamics of Nonlinear Systems in Nature and Society

2019

On the geometric structure of the class of planar quadratic differential systems

2002

In this work we are interested in the global theory of planar quadratic differential systems and more precisely in the geometry of this whole class. We want to clarify some results and methods such as the isocline method or the role of rotation parameters. To this end, we recall how to associate a pencil of isoclines to each quadratic differential equation. We discuss the parameterization of the space of regular pencils of isoclines by the space of its multiple base points and the equivariant action of the affine group on the fibration of the space of regular quadratic differential equations over the space of regular pencils of isoclines. This fibration is principal, with a projective group…

An answer to a question of Isaacs on character degree graphs

2006

Abstract Let N be a normal subgroup of a finite group G. We consider the graph Γ ( G | N ) whose vertices are the prime divisors of the degrees of the irreducible characters of G whose kernel does not contain N and two vertices are joined by an edge if the product of the two primes divides the degree of some of the characters of G whose kernel does not contain N. We prove that if Γ ( G | N ) is disconnected then G / N is solvable. This proves a strong form of a conjecture of Isaacs.

ApproximatingL 2-invariants by their finite-dimensional analogues

1994

LetX be a finite connectedCW-complex. Suppose that its fundamental group π is residually finite, i.e. there is a nested sequence ... ⊂ Г m + 1 ⊂ Г m ⊂ ... ⊂ π of in π normal subgroups of finite index whose intersection is trivial. Then we show that thep-thL 2-Betti number ofX is the limit of the sequenceb p(Xm)/[π:Г m ] whereb p(Xm) is the (ordinary)p-th Betti number of the finite covering ofX associated with Г m .

Generalizations of the periodicity Theorem of Fine and Wilf

2005

We provide three generalizations to the two-dimensional case of the well known periodicity theorem by Fine and Wilf [4] for strings (the one-dimensional case). The first and the second generalizations can be further extended to hold in the more general setting of Cayley graphs of groups. Weak forms of two of our results have been developed for the design of efficient algorithms for two-dimensional pattern matching [2, 3, 6].