Abstract
In this paper we are interested in problems related to the encoding of partitions of discrete sets in R n with the restriction to the partitions which can be realized by a number of hyperplanes. A particular attention is given to the partitions of subsets of a planar integer grid of a given size, which is a model for a binary picture of a given size.
An application of the used encoding method to the encoding of linear threshold functions is given, as well. It turns out, that the obtained O(n 2) code is asymptotically optimal with respect to the required memory space.
The author is also member of the Mathematical institute of Serbian Academy of Sciences, under project 04M02
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andres, E., Acharya, R., Sibata C.: Discrete Analytical Hyperplanes. Graphical Models and Image Processing 59 (1997) 302–309.
Courrieu, P.: Two Methods for Encoding Clusters. Neural Networks 14 (2001) 175–183.
Cover, M. T.: Geometric and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electron. Comput. EC-14 (1965) 326–334.
Klette, R., Stojmenović, I., Žunić, J.: A New Parametrization of Digital Planes by Least Squares Plane Fit and Generalizations. Graphical Models and Image Processing. 58 (1996) 295–300.
Koplowitz, J., Lindenbaum, M., Bruckstein, A.: The number of Straight Lines on an n × n grid. IEEE Trans. on Information Theory. 36 (191990) 192–197.
Krueger, R. F.: Comments on Takiyama’s Analysis of the Multithreshold Threshold Element. IEEE Trans. Pattern Anal. Machine Intell. 8 (1986) 760–761.
Ngom, A., Stojmenović, I., Žunić.: On the Number of Multilinear Partitions and Computing Capacity of Multiple-Valued Multiple Threshold Perceptrons. Proceedings of 29th IEEE International Symposium on Multiple-Valued Logic, Freiburg in Breisgau (Germany), (1999) 208–213.
Ojha, C. P.: Enumeration of Linear Threshold Functions from the Lattice of Hyperplane Intersections. IEEE Trans. on Neural Networks 11 (2000) 839–850.
’Olafsson, S., Abu-Mostafa, S. Y.: The Capacity of Multilevel Threshold Functions. IEEE Trans. Pattern Anal. Machine Intell. 10 (1988) 277–281.
Reveilles, J.-P.: Geometrie Discrete, calcul en nombres entiers et algorithmique. State thesis (in French), Universite Louis Pasteur, Strasbourg, Dec. 1991.
Winder, R. O.: Chow Parameters in Threshold Logic. Journal of ACM 18 (1971) 265–289.
Zuev, A. Y.: Asymptotics of the Logarithm of the Number of Threshold Functions of the Algebra of Logic. Sov. Math. Dok. 39 (1989) 512–513.
Žunić, J., Acketa, M. D.: A General Coding Scheme for Families of Digital Curve Segments. Graphical Models and Image Processing 60 (1998) 437–460.
Žunić, J.: Encoding of Linear and Multi-linear Threshold Functions of n-dimesional Binary Inputs. Submitted (2001).
Žunić, J., Sladoje, N.: Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments. IEEE Trans. Pattern Anal. Machine Intell. 22 (2000) 407–414.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Žunić, J. (2001). Digital Partitions Encoding. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43079-7
Online ISBN: 978-3-540-45576-9
eBook Packages: Springer Book Archive