Abstract Modern physical experiments produce a lot of information in digital form, which must be stored and quickly processed. The process of data accumulation is often too long, especially when the experimenter has to scan many independent parameters. To solve this problem, we proposed a method of adaptive data acquisition. The whole multidimensional domain is iteratively divided into several subdomains and inside each subdomain the sample grid is adapted to the smoothness of an unknown data function. The grid is denser where the data function is highly alternated and sparser in the opposite, smoother parts. We choose cubic splines as the basic approximation functions. The procedure takes into account the presence of noise: the iterations have more stages when the noise is weak, and hence the unknown structure is revealed with many details, limited only by the technical resolution of the instrument. However, when the noise is high, the resolution is limited due to smoothing, the degree of which depends on the intensity of noise. The proposed algorithm is transformed in simple software and is illustrated by computer simulation.
[1]
M. Kunt,et al.
Second-generation image-coding techniques
,
1985,
Proceedings of the IEEE.
[2]
Peter No,et al.
Digital Coding of Waveforms
,
1986
.
[3]
Ling-Hwei Chen,et al.
A new image compression method using dynamic predictor based on current context
,
1991,
Signal Process..
[4]
P. Wintz.
Transform picture coding
,
1972
.
[5]
C. M. Kortman.
Redundancy reduction—A practical method of data compression
,
1967
.
[6]
L. Ehrman,et al.
Analysis of some redundancy removal bandwidth compression techniques
,
1967
.
[7]
J. Goodman.
Statistical Optics
,
1985
.
[8]
A.N. Netravali,et al.
Picture coding: A review
,
1980,
Proceedings of the IEEE.
[9]
Jae S. Lim,et al.
Two-Dimensional Signal and Image Processing
,
1989
.
[10]
C. A. Andrews,et al.
Adaptive data compression
,
1967
.
[11]
G. Alexits.
Approximation theory
,
1983
.