Applications of nonlinear diffusion in image processing and computer vision.
Applied mathematics meets signal processing.
Approximate algorithm for determining pulse edges of a PWM inverter based on natural sampling.
Approximation of signals (functions) belonging to the weighted -class by linear operators.
Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials
We obtain lower bounds on degree and additive complexity of real polynomials approximating the discrete logarithm in finite fields of even characteristic. These bounds complement earlier results for finite fields of odd characteristic.
Asymptotic behaviour of empirical multiinformation
Asymptotic distribution of the useful informational energy
Asymptotic equipartition properties for simple hierarchical and networked structures
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Asymptotic equipartition properties for simple hierarchical and networked structures
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Asymptotic stability, ergodicity and other asymptotic properties of the nonlinear filter
Asymptotical behaviour of some non-uniform measures
Automatic speech signal segmentation based on the innovation adaptive filter
Average convergence rate of the first return time
The convergence rate of the expectation of the logarithm of the first return time , after being properly normalized, is investigated for ergodic Markov chains. I. Kontoyiannis showed that for any β > 0 we have a.s. for aperiodic cases and A. J. Wyner proved that for any ε >0 we have eventually, a.s., where is the probability of the initial n-block in x. In this paper we prove that converges to a constant depending only on the process where is the modified first return time with...
Axiomatic characterizations of the measures of inaccuracy and information.
-valuations of graphs
Baire classification and infinite perceptrons
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Basic equations for source coding with side information at the decoder and encoder
Basic relations valid for the Bernstein spaces and their extensions to larger function spaces via a unified distance concept
Some basic theorems and formulae (equations and inequalities) of several areas of mathematics that hold in Bernstein spaces are no longer valid in larger spaces. However, when a function f is in some sense close to a Bernstein space, then the corresponding relation holds with a remainder or error term. This paper presents a new, unified approach to these errors in terms of the distance of f from . The difficult situation of derivative-free error estimates is also covered.