NEAREST DOMAIN BLOCK AS A ROOT OF FRACTAL IMAGE COMPRESSION

Abstract

Using domain block for issuing of fractal image compression. Nearest blocks are taking crucial role in fractal image compression. Hash functions need to be used in case of compression process. The prob-lem of finding the nearest neighbor element is that for a given set of domain blocks to build a structure data to range for this range mR could quickly find the nearest to mR domain block. Due to the proper-ties of space-sensitive hash functions at the confluence of the hash values for the range and domain vec-tors there is a very high probability that these vectors are close to each other in a given metric space. For domain blocks found candidate performed the calculation error and select the most appropriate block. Thus, we avoid the need to solve the problem by least squares for each pair of domain-range blocks, we select a few candidates who are likely to give close to optimum solution. This is achieved by significantly increasing time efficiency of the algorithm. Search of domain-range matching is the most time consuming operation in fractal image coding. In the classical approach to all possible combinations of domain and range areas need to solve the problem of finding optimal coefficients by least squares and choose the best option. And, although this method gives the best solution, its temporal efficiency is unacceptable from a practical point of view. However, the problem of fractal image coding can be reduced to the problem of finding the nearest neighboring elements in the multidimensional space. In the article the approach to the construction of algorithms that implement the fractal compression by a combination of the two ideas.

Authors and Affiliations

I. Khimichenko

Keywords

Related Articles

DISTRIBUTED DATABASE STRUCTURE DESIGN BASED ON SQL-QUERY PARSING

In measures of research, the specificity of operational records associated with the transition from local to distributed database was discussed. This trend is motivated by the presence of different accounting types, by e...

UNCERTAINTY MODELS IN GROUP EXPERT JUDGMENTS

The mathematical models of group expert judgments allows to process the results of an expert survey under uncertainty and con-flicting (contradictory, non-conforming) expert judgments have been proposed in the article. I...

ADAPTIVE MANAGEMENT SYSTEM OF HIGH-VOLTAGE DEVICE FOR CLEANING POURING BASED FUZZY REGULATOR

This paper presents research and development of adaptive control system of electrical discharge fettling a casting device, which is based on system of fuzzy logic resume and neuro-fuzzy networks usage for indices of effe...

COMPUTER RESEARCH OF THE MAIN PROBLEMS FOR INTERNAL BALLISTICS IN ARTILLERY TRUNK

COMPUTER RESEARCH OF THE MAIN PROBLEMS FOR INTERNAL BALLISTICS IN ARTILLERY TRUNK

SYSTEM OF MONITORING OF THE ROUT TAXI

The article deals with the hardware and software complex of monitoring of public transport movement (in the priority of monitoring the route taxi) on the basis of the theory of mass service systems. The prototype of a mo...

Download PDF file
  • EP ID EP225519
  • DOI -
  • Views 97
  • Downloads 0

How To Cite

I. Khimichenko (2016). NEAREST DOMAIN BLOCK AS A ROOT OF FRACTAL IMAGE COMPRESSION. Наукові праці. Серія "Комп’ютерні технології", 287(275), 111-115. https://europub.co.uk/articles/-A-225519