The Use of Algorithms of Piecewise Approximations for Picture Processing Applications
- 1 December 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 2 (4), 305-321
- https://doi.org/10.1145/355705.355706
Abstract
Algorithms for piecewise approximations with variable breakpomts can be used for picture segmentation. The high computational requirements of many of the algorithms whmh search for optimal solutions make them unsuitable for such apphcations A fast scheme using a sphtand-merge procedure is described for functions of both one and two variables. Examples of its application on pictures are given. The present implementation is only for piecewise constant and piecewise linear approximations without continuity constraints. It can be readily extended to higher order approximations without constraints. Theoretically the spht-and-merge procedure can also be used with continuity constraints.Keywords
This publication has 25 references indexed in Scilit:
- Picture Segmentation by a Tree Traversal AlgorithmJournal of the ACM, 1976
- A syntactic algorithm for peak detection in waveforms with applications to cardiographyCommunications of the ACM, 1975
- The generation of polygonal outlines of objects from gray level picturesIEEE Transactions on Circuits and Systems, 1975
- Optimal Piecewise Polynomial L2Approximation of Functions of One and Two VariablesIEEE Transactions on Computers, 1975
- Uniform piecewise polynomial approximation with variable jointsJournal of Approximation Theory, 1974
- Scalar- and planar-valued curve fitting using splines under tensionCommunications of the ACM, 1974
- Masking in Visual Recognition: Effects of Two-Dimensional Filtered NoiseScience, 1973
- Characteristic properties of the segmented rational minmax approximation problemNumerische Mathematik, 1964
- Visual Pattern DiscriminationIEEE Transactions on Information Theory, 1962
- Some informational aspects of visual perception.Psychological Review, 1954