Evidence for deep connections between number theory and random matrix theory has been noticed since the Montgomery-Dyson encounter in 1972 : the function fields case was studied by Katz and Sarnak, and the moments of the Riemann zeta function along its critical axis were conjectured by Keating and Snaith, in connection with similar calculations for randommatrices on the unitary group. This thes...

In this paper a new multivariate regression estimate is introduced. It is based on ideas derived in the context of wavelet estimates and is constructed by hard thresholding of estimates of coefficients of a series expansion of the regression function. Multivariate functions constructed analogously to the classical Haar wavelets are used for the series expansion. These functions are orthogonal i...

Abstract—The system is designed to show images which are related to the query image. Extracting color, texture, and shape features from an image plays a vital role in content-based image retrieval (CBIR). Initially RGB image is converted into HSV color space due to its perceptual uniformity. From the HSV image, Color features are extracted using block color histogram, texture features using Haa...

The traditional mean-squared-error and peak-signal-to-noise-ratio error measures are mainly focused on the pixel-by-pixel difference between the original and compressed images. Such metrics are improper for subjective quality assessment, since human perception is very sensitive to specific correlations between adjacent pixels. In this work, we explore the Haar wavelet to model the space–frequen...

A method for the design of Fast Haar wavelet for signal processing & image processing has been proposed. In the proposed work, the analysis bank and synthesis bank of Haar wavelet is modified by using polyphase structure. Finally, the Fast Haar wavelet was designed and it satisfies alias free and perfect reconstruction condition. Computational time and computational complexity is reduced in Fas...

In this paper we consider a special class of polymorphisms with invariant measure, the algebraic polymorphisms of compact groups. A general polymorphism is — by definition — a many-valued map with invariant measure, and the conjugate operator of a polymorphism is a Markov operator (i.e., a positive operator on L of norm 1 which preserves the constants). In the algebraic case a polymorphism is a...

Imposing a group structure on the set of random orders, the paper reformulates and characterizes the random order value and more generally semi-value operators in a uni ed framework that encompasses games with nite and continuum of players and allows symmetry of the operators to be with respect to a subgroup of automorphisms. A set of orderings of players equipped with a group structure induced...

The automaton transformation of infinite words over alphabet Fp = {0, 1, . . . , p− 1}, where p is a prime number, coincide with the continuous transformation (with respect to the p-adic metric) of a ring Zp of p-adic integers. The objects of the study are non-Archimedean dynamical systems generated by automata mappings on the space Zp. Measure-preservation (with the respect to the Haar measure...

This paper describes a similarity measure for images to be used in image-based localization for autonomous robots with low computational resources. We propose a novel signature to be extracted from the image and to be stored in memory. The proposed signature allows, at the same time, memory saving and fast similarity calculation. The signature is based on the calculation of the 2D Haar Wavelet ...