RATIONALE AND OBJECTIVES The aim of this study was to investigate whether using a fractal dimension as an objective index (quantitative measure) to assess and control the "visual" or "texture" similarity of reference-image regions selected by a content-based image retrieval (CBIR) scheme would (or would not) affect the performance of the scheme in classification between image regions depicting ...

A stochastic perception-control coupling is introduced for anticipative road following on satellite-roadwayvehicle network. Based on the prediction of roadway pattern in the satellite image, maneuverable area is coded in terms of a fractal attractor confined in the image of observed scene by boundary probability. Random shift of the boundary probability is detected via the perception process an...

The main problem of fractal image compression is the long search time of the domain pool. For this reason, the dedicated ASIC architecture for fractal image coding is needed. In this paper, we propose an efcient parallel architecture for fractal image coding which is based on xed-size full-search algorithm. One of the main features of this architecture is that it uses only local communication s...

Many evolutionary algorithms have been presented in the last few decades, some of these algorithms were sufficiently tested and used in many researches and papers, such as: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution Algorithm (DEA). Other recently proposed algorithms were unknown and rarely used such as Stochastic Fractal Search (SFS), Symbiotic Organi...

Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor. Here we show analytically that despite this stochastic independence, there exists the degree-degree correlation (DDC) in the CBT and it is disassortative. Moreover, the skeletons of fractal networks, t...