NEAREST DOMAIN BLOCK AS A ROOT OF FRACTAL IMAGE COMPRESSION
Journal Title: Наукові праці. Серія "Комп’ютерні технології" - Year 2016, Vol 287, Issue 275
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
- EP ID EP225519
- DOI -
- Views 82
- Downloads 0
FUNCTIONAL AND SCHEMOTECHNICAL MODELING OF PIEZOTRANSDUSERS FOR THE DETERMINATION OF THE EFFECT OF THE KOAND
In the article obtained functional and circuit-based models of bimorph piezoelements which are used to determine the Coand effect. Their amplitude-frequency, phase-frequency, and transient characteristics are investigate...
DISTRIBUTION OF LOAD BETWEEN MULTI-CORE PROCESSORS FOR PROBLEMS TAKING PLACE IN MEASURING INFORMATION NETWORKS
The problem of energy conservation for mobile objects of a wireless power independent measuring information network (WPEIMN) is formulated. The ways to solve this problem by means of optimizing the load on the processor...
COMPUTER RESEARCH OF THE MAIN PROBLEMS FOR INTERNAL BALLISTICS IN ARTILLERY TRUNK
COMPUTER RESEARCH OF THE MAIN PROBLEMS FOR INTERNAL BALLISTICS IN ARTILLERY TRUNK
MODELS AND METHODS PROCESSING OF DIGITAL TEXTURAL IMAGES IN AEROSPACE MONITORING SYSTEMS
Remote sensing of the land surface provides unique opportunities of operational data collection with high spatial, spectral and temporal resolution, which defines the great information opportunities of such systems. Auto...
INCREASE OF INFORMATIVE SAFETY OF THE TELECOMMUNICATION SYSTEM OF THE STATE EMERGENCY SERVICE OF UKRAINE BY MONITORING OF INCIDENTS AND ESTIMATION OF RISKS OF REALIZATION OF THREATS SAFETY
The purpose of work consists in the study of work of the modern systems of monitoring of in-cidents, development of system model of monitoring of incidents in the telecommunication sys-tem the State Emergency Service of...