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

FIBER-OPTICAL SENSOR OF METHANE

For the construction of the system of safety in surrounding environment it is necessary to carry out reliable control of methane. Existent controls not in a complete measure after the metrology and technical by descripti...

Impact of transients in case of pursuit system technical means exploration on efficiency process changes

In the process of technical system functioning of technical equipments of reconnaissance in the contraction conditions, attention was draw by the additional factors. It was expected that in case of means of defense and c...

AUTONOMOUS WATER QUANTITY COUNTER

Accounting for water consumption is an important task for today. This counter is designed for regular meter readings and auto-mated data transmission to managing organizations (Housing and communal services). The propose...

COMPARATIVE ANALYSIS OF OLAP-SYSTEMS BUILDING METHODS USING MS SQL SERVER AND ORACLE

The article is considering some problems, related to big data amounts storing and processing, expounding data warehouses conception and methodology of future accounting creation with using of on-line analytical processin...

CONSTRUCTION OF AUTOMATIC CONTROL OF A COMPUTER SYSTEM OBJECT WITH LIMITED COM-PUTING AND ENERGY RESOURCES, USING FUZZY LOGIC

In this paper constructing a computer automatic control system design, with limited computing and energy resources using fuzzy logic, resistant to unpredictable fluctuations, or other influences and inter-ference environ...

Download PDF file
  • EP ID EP225519
  • DOI -
  • Views 102
  • 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