Algorithmic selection of the best method for compressing map data strings
Communications of the ACM
Computer Approximations
Tabular representation of multivariate functions—with applications to topographic modeling
ACM '67 Proceedings of the 1967 22nd national conference
The Use of Algorithms of Piecewise Approximations for Picture Processing Applications
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The domain of a function f(x,y) is subdivided into regions D1, D2,...DM such that on each one of them f(x,y) can be approximated by a low order polynomial within a given tolerance. It is desirable to chose the boundaries of the regions in such a way as to minimize the amount of storage required for the approximate description of f(x,y). A suboptimal solution to this problem is presented. It is based on a two step procedure. First the optimal segmentation is obtained for profiles of f(x,y) along certain lines of its domain. The regions so obtained are then grouped together to form the final subdivisions. Examples of application of the method in the compression of topographical data are presented. Compression ratios of over 20:1 are obtained for RMS error 2%.