Simulation of signal oriented algorithm with lossy data compression
Year: 2015
Type: article
Abstract: In this paper the additive algorithm of spectral analysis is considered. This algorithm con- sists of algebraic summation of samples of basis functions taken at certain points of an in- terval of an independent variable of a given function. Two variants of simulation of the additive algorithm are considered. In the first variant the process of receiving discrete val- ues of continuous spectrum of a continuous function is considered. The second variant uses the additive algorithm for Discrete Cosine Transform (DCT), which is widely used in prac- tice for converting graphic images. The conception of the accelerated calculation of the DCT is considered on examples of real two dimensional graphic images. The fragments of proposed programs for simulation of the additive algorithm for continuous signals and for image processing are represented in meta language. Lossy data compression gives a possibility to obtain a compact representation of data with enough satisfactory accuracy. There is a significant number of publications that are devoted to problems of construction of numerical schemes for the rapid compression of in- formation. The vast majority of them are devoted to methods of rapid compression and de- compression of image information. Among this stream of publications it should be allocated those ones which propose ways to increase computing speed due to some loss of reliability of image reconstruction, after the transformation. In these publications it was shown how due to some loss of accuracy to obtain a high and, in some cases, very high speed processing of information. Part of publications is devoted to constructing algorithms for performing transformation with using reduced number of arithmetic operations (1-5), with reduced number of bits in representation graphical information (6), with reduced size of representa- tion of pixels (7) and so on (8, 9). In other part of these publications the number of opera- tions is reduced by means of eliminations of multiplications during the performing transformation by using only algebraic addition operations. These algorithms are called ad- ditive (10-13). There are two kinds of additive algorithms for the fast calculation of the Fourier integral using additive formulas, which are respectively called direct additive formulas and dual ad- ditive formulas (10, 12). Implementation of the second kind of the additive algorithms for computing the Fourier integral is done by means of algebraic summing basis functions taken at the points which are determined by calculating a definite integral of a function and com-
Source: Applied Computer Science
Authors: Nadiya Gubareni, Aleksandr Katkow
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $109
OpenAlex ID: W2505203952