Ideal decompositions and computation of tensor normal forms.
Idealized coinductive type systems for imperative object-oriented programs
In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...
Idealized coinductive type systems for imperative object-oriented programs
In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...
Idempotent operators on a finite chain.
This work is devoted to find and study some possible idempotent operators on a finite chain L. Specially, all idempotent operators on L which are associative, commutative and non-decreasing in each place are characterized. By adding one smoothness condition, all these operators reduce to special combinations of Minimum and Maximum.
Identical Dual Lattices and Subdivision of Space
Identifiability and estimation of pharmacokinetic parameters for the ligands of the macrophage mannose receptor
The aim of this paper is numerical estimation of pharmacokinetic parameters of the ligands of the macrophage mannose receptor, without knowing it a priori the values of these parameters. However, it first requires a model identifiability analysis, which is done by applying an algorithm implemented in a symbolic computation language. It is shown that this step can lead to a direct numerical estimation algorithm. In this way, a first estimate is computed from noisy simulated observations without it...
Identification d'un phénomène bactériologique
Identification of discrete chaotic maps with singular points.
Identifying codes with small radius in some infinite regular graphs.
Il funzionale di Totale Variazione nel problema dell’eliminazione del rumore da immagini digitali: dal modello al software matematico
Image Compression with Schauder Bases
As is known, color images are represented as multiple, channels, i.e. integer-valued functions on a discrete rectangle, corresponding to pixels on the screen. Thus, image compression, can be reduced to investigating suitable properties of such, functions. Each channel is compressed independently. We are, representing each such function by means of multi-dimensional, Haar and diamond bases so that the functions can be remembered, by their basis coefficients without loss of information. For, each...
Image deblurring, spectrum interpolation and application to satellite imaging
Image deblurring, spectrum interpolation and application to satellite imaging
This paper deals with two complementary methods in noisy image deblurring: a nonlinear shrinkage of wavelet-packets coefficients called FCNR and Rudin-Osher-Fatemi's variational method. The FCNR has for objective to obtain a restored image with a white noise. It will prove to be very efficient to restore an image after an invertible blur but limited in the opposite situation. Whereas the Total Variation based method, with its ability to reconstruct the lost frequencies by interpolation, is very...
Image dithering based on the wavelet transform.
Image location for screw dislocation. A new point of view.
Image pre-processing tool
Image processing for old movies by filters with motion detection
Old movies suffer from various types of degradation: severe noise, blurred edges of objects (low contrast), scratches, spots, etc. Finding an efficient denoising method is one of the most important and one of the oldest problems in image sequence processing. The crucial thing in image sequences is motion. If the motion is insignificant, then any motion noncompensated method of filtering can be applied. However, if the noise is significant, then this approach gives most often unsatisfactory results....
Image recall using a large scale generalized Brain-State-in-a-Box neural network
An image recall system using a large scale associative memory employing the generalized Brain-State-in-a-Box (gBSB) neural network model is proposed. The gBSB neural network can store binary vectors as stable equilibrium points. This property is used to store images in the gBSB memory. When a noisy image is presented as an input to the gBSB network, the gBSB net processes it to filter out the noise. The overlapping decomposition method is utilized to efficiently process images using their binary...
Image restoration through subimages and confidence images.
Image retrieval based on hierarchical Gabor filters
Content Based Image Retrieval (CBIR) is now a widely investigated issue that aims at allowing users of multimedia information systems to automatically retrieve images coherent with a sample image. A way to achieve this goal is the computation of image features such as the color, texture, shape, and position of objects within images, and the use of those features as query terms. We propose to use Gabor filtration properties in order to find such appropriate features. The article presents multichannel...