Many aspects of visual coding have been successfully predicted by starting from the statistics of natural scenes and then asking how the stimulus could be efficiently represented. We started from the representation of color characterized by uniform color spaces, and then asked what type of color environment they implied. These spaces are designed to represent equal perceptual differences in col...

In this paper, the strong solutions (X,L) of multidimensional stochastic differential equations with reflecting boundary and possible anticipating initial random variables is established. The key is to obtain some substitution formula for Stratonovich integrals via a uniform convergence of the corresponding Riemann sums and to prove continuity of functionals of (X,L). MSC(2000): Primary 60H07, ...

This paper presents the concepts of $(L,M)$-fuzzy Q-convergence spaces and stratified $(L,M)$-fuzzy Q-convergence spaces. It is shown that the category of stratified $(L,M)$-fuzzy Q-convergence spaces is a bireflective subcategory of the category of $(L,M)$-fuzzy Q-convergence spaces, and the former is a Cartesian-closed topological category. Also, it is proved that the category of stratified $...

In cite{Kats84}, Katsaras introduced a method for constructing a Hu-tton $[0,1]$-quasi-uniformity from a crisp uniformity. In this paper we present other different methods for making this based mainly in the concept of a fuzzy uniform structure. Furthermore, we prove that some of these methods preserve the completeness property of the quasi-uniformity.  Moreover, we also show that Katsaras' con...

where Kθ is the matrix that warps latent image L to the transformed copy at a sampled pose θ and S denotes the set of sampled camera poses. While these algorithms show promising results, they entail high computational cost as the high-dimensional camera motion space and the latent image have to be computed during the iterative optimization procedures. In this paper, we propose a fast single-ima...

A h-uniform hypergraph H = (V,E) is called (l, k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly l of its vertices v ∈ e such that no vertex is assigned more than k hyperedges. Let Hn,m,h be a hypergraph, drawn uniformly at random from the set of all h-uniform hypergraphs with n vertices and m edges. In this paper, we determine the threshold of the existence of a (l...