Une mesure d'information caractérisant la loi de Poisson
Unified Treatment of Subnetworks in Symbolic Analysis of Linear Electric Circuits and Systems
Uniform a priori estimates for discrete solution of nonlinear tensor diffusion equation in image processing
This paper concerns with the finite volume scheme for nonlinear tensor diffusion in image processing. First we provide some basic information on this type of diffusion including a construction of its diffusion tensor. Then we derive a semi-implicit scheme with the help of so-called diamond-cell method (see [Coirier1] and [Coirier2]). Further, we prove existence and uniqueness of a discrete solution given by our scheme. The proof is based on a gradient bound in the tangential direction by a gradient...
Uniform limit power-type function spaces.
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word's duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite duplication...
Uniformly synchronous limited codes.
Unifying approach to observer-filter design
The paper examines similarities between observer design as introduced in Automatic Control Theory and filter design as established in Signal Processing. It is shown in the paper that there are obvious connections between them in spite of different aims for their design. Therefore, it is prospective to make them be compatible from the structural point of view. Introduced error invariance and error convergence properties of both of them are unifying tools for their design. Lyapunov's stability theory,...
Unique Reconstruction of Band-limited Signals by a Mallat-Zhong Wavelet Transform Algorithm.
Uniqueness of the spherical code.
Unit rectangle visibility graphs.
Universal codes and unimodular lattices
Binary quadratic residue codes of length produce via construction and density doubling type II lattices like the Leech. Recently, quaternary quadratic residue codes have been shown to produce the same lattices by construction modulo . We prove in a direct way the equivalence of these two constructions for . In dimension 32, we obtain an extremal lattice of type II not isometric to the Barnes-Wall lattice . The equivalence between construction modulo plus density doubling and construction...
Universal parallel composition laws and their representations.
Universally typical sets for ergodic sources of multidimensional data
We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a multidimensional lattice setting. We use techniques of packings and coverings with multidimensional windows to construct sequences of multidimensional array sets which in the limit build the generated samples of any ergodic source of entropy rate below an with...
Univerzální logické funkce a syntéza booleovských funkcí pomocí univerzálních modulů
Upper and lower set formulas: restriction and modification of the Dempster-Pawlak formalism
A modification of Dempster's and Pawlak's constructs forms a new foundation for the identification of upper and lower sets formulas. Also, in this modified Dempster-Pawlak construct we require that subsets of the power set be restricted to the well-known information granules of the power set. An aggregation of upper information granules amongst each other and lower information granules amongst each other determine upper and lower set formulas for both crisp and fuzzy sets. The results are equivalent...
Variable rate multi-channel (Papoulis) sampling expansion (via sub-channel analysis)
Variance bound of ACF estimation of one block of fGn with LRD.
Variantes sur un théorème de Candès, Romberg et Tao
Le théorème CRT dit comment reconstruire un signal à partir d’un échantillonnage de fréquences parcimonieux. L’hypothèse sur le signal, considéré comme porté par un groupe cyclique d’ordre , est qu’il est porté par un petit nombre de points, , et la méthode est de choisir aléatoirement fréquences et de minimiser dans l’algèbre de Wiener le prolongement à de la transformée de Fourier du signal réduite à ces fréquences. Quand est grand, la probabilité de reconstruire le signal est voisine...
Variational approximation for detecting point-like target problems
The aim of this paper is to provide a rigorous variational formulation for the detection of points in 2-d biological images. To this purpose we introduce a new functional whose minimizers give the points we want to detect. Then we define an approximating sequence of functionals for which we prove the Γ-convergence to the initial one.
Variational approximation for detecting point-like target problems*
The aim of this paper is to provide a rigorous variational formulation for the detection of points in 2-d biological images. To this purpose we introduce a new functional whose minimizers give the points we want to detect. Then we define an approximating sequence of functionals for which we prove the Γ-convergence to the initial one.