Image sampling with quasicrystals.
Image segmentation using gray-scale morphology and marker-controlled watershed transformation.
Image segmentation with a finite element method
Image segmentation with a finite element method
The Mumford-Shah functional for image segmentation is an original approach of the image segmentation problem, based on a minimal energy criterion. Its minimization can be seen as a free discontinuity problem and is based on Γ-convergence and bounded variation functions theories. Some new regularization results, make possible to imagine a finite element resolution method. In a first time, the Mumford-Shah functional is introduced and some existing results are quoted. Then, a discrete formulation...
Imbalances in Arnoux-Rauzy sequences
In a 1982 paper Rauzy showed that the subshift generated by the morphism , and is a natural coding of a rotation on the two-dimensional torus , i.e., is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in each domain being translated by the same vector modulo a lattice. It was believed more generally that each sequence of block complexity satisfying a combinatorial criterion known as the condition of Arnoux and Rauzy codes the orbit of a point...
Imitation learning of car driving skills with decision trees and random forests
Machine learning is an appealing and useful approach to creating vehicle control algorithms, both for simulated and real vehicles. One common learning scenario that is often possible to apply is learning by imitation, in which the behavior of an exemplary driver provides training instances for a supervised learning algorithm. This article follows this approach in the domain of simulated car racing, using the TORCS simulator. In contrast to most prior work on imitation learning, a symbolic decision...
Immunity and simplicity for exact counting and other counting classes
Immunity and Simplicity for Exact Counting and Other Counting Classes
Ko [26] and Bruschi [11] independently showed that, in some relativized world, PSPACE (in fact, ⊕P) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of relativized separations with immunity for PH and the counting classes PP, , and ⊕P in all possible pairwise combinations. Our main result is that there is an oracle A relative to which contains a set that is immune BPP⊕P. In particular, this set is immune to PHA and to ⊕PA. Strengthening...
Immunity and simplicity in relativizations of probabilistic complexity classes
Implementation of adaptive generalized sidelobe cancellers using efficient complex valued arithmetic
Low complexity realizations of Least Mean Squared (LMS) error, Generalized Sidelobe Cancellers (GSCs) applied to adaptive beamforming are considered. The GSC method provides a simple way for implementing adaptive Linear Constraint Minimum Variance (LCMV) beamformers. Low complexity realizations of adaptive GSCs are of great importance for the design of high sampling rate, and/or small size and low power adaptive beamforming systems. The LMS algorithm and its Transform Domain (TD-LMS) counterpart...
Implementation of an XML based system for content generation and library catalogue cards display.
Implementation of directed acyclic word graph
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i. e. vertices,...
Implementation of penalty function methods in LISP
Implémentation optimale d'une relation dans une base de données relationnelle par un système de projecteurs
Implementing an interior point method for linear programs on a CPU-GPU system.
Implementing Dynamic Visualization as an Alternative Interface to a Digital Mathematics Library
This paper presents an alternative interface for browsing in the Czech Digital Mathematics Library (DML-CZ) using our Visual Browser web browsing tool. Using dynamic visualization, we have created a tool for browsing the library graphically. Visualization can help users orient themselves in complex data and at the same time reveal sometimes unexpected relationships among units; it at least speeds up browsing. This work follows the metadata processing undertaken on DML-CZ and visualizes all reasonable...
Implementing term rewriting by jungle evaluation
Implicitly Representing Arrangements of Lines or Segments.
Imposing restrictions on density functions utilised in computing with words
Applying the generalised extension principle within the area of Computing with Words typically leads to complex maximisation problems. If distributed quantities-such as, e.g., size distributions within human populations-are considered, density functions representing these distributions become involved. Very often the optimising density functions do not resemble those found in nature; for instance, an optimising density function could consist of two single Dirac pulses positioned near the opposite...
Improved bounds on the length of maximal abelian square-free words.