Majority of image filtering techniques are designed under assumption that noise is of special, a priori known type and it is i.i.d., i.e. spatially uncorrelated. However, in many practical situations the latter assumption is not true due to several reasons. Moreover, spatial correlation properties of noise might be rather different and a priori unknown. Then the assumption that noise is i.i.d. ...

We study recursive algorithm for computing DCT of lengths N = q 2m (m, q ∈ N, q is odd) due to C. W. Kok [16]. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when m 6 2. We also show that C. W. Kok’s factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, a...

We extend multiplicative exponential linear logic (MELL) by a non-commutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We should then be able to extend the range of applications of MELL, by modelling a broad notion of s...

Lévy’s labelled λ-calculus has played an important role in the understanding of the Geometry of Interaction and its applications to the implementation of λ-evaluators: labels relate to the multiplicative information of paths. In this paper, we generalise the structure of labels, and the underlying term structure, in order to keep track of exponential information too. We first define two labelle...

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

The sequent calculus admits many proofs of the same conclusion that differ only by trivial permutations of inference rules. In order to eliminate this “bureaucracy” from sequent proofs, deductive formalisms such as proof nets or natural deduction are usually used instead of the sequent calculus, for they identify proofs more abstractly and geometrically. In this paper we recover permutative can...

We define a class of discrete operators that, in particular, include the delta and nabla fractional operators. Moreover, we prove fundamental theorem calculus for these