The αβ associative memories recently developed in Ref. 10 have proven to be powerful tools for memorizing and recalling patterns when they appear distorted by noise. However they are only useful in the binary case. In this paper we show that it is possible to extend these memories now to the gray-level case. To get the desired extension, we take the original operators α and β, foundation of the...

Framework for Similarity-Based Methods (SBMs) allows to create many algorithms that differ in important aspects. Although no single learning algorithm may outperform other algorithms on all data an almost optimal algorithm may be found within the SBM framework. To avoid tedious experimentation a meta-learning search procedure in the space of all possible algorithms is used to build new algorith...

Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed, there is an increased need for fast and robust techniques to automatically compute least-distorted parameterizations of large meshes. In this paper, we present new theoretical and practical results on t...

Gentropy is a genetic programming system that evolves two-dimensional procedural textures. It synthesizes textures by combining mathematical and image manipulation functions into formulas. A formula can be reevaluated with arbitrary texture-space coordinates, to generate a new portion of the texture in texture space. Most evolutionary art programs are interactive, and require the user to repeat...

This paper presents the predicted polar mapping that is to improve the efficiency of an unexpected moving obstacle detecting system in a single vision-based robot. The polar mapping is used to simplify the segmentation of moving objects from the background and is performed with the focus of expansion (FOE) as the center. When the movement of the robot per a step becomes a bit large, then static...

We present an incremental method for concurrent mapping and localization for mobile robots equipped with 2D laser range finders. The approach uses a fast implementation of scan-matching for mapping, paired with a sample-based probabilistic method for localization. Compact 3D maps are generated using a multi-resolution approach adopted from the computer graphics literature, fed by data from a du...