For a given real triangle T its discretization on a discrete point set S consists of points from S which fall into T. If the number of such points is finite, the obtained discretization of T will be called discrete triangle.
In this paper we show that the discrete moments having the order up to 3 characterize uniquely the corresponding discrete triangle if the discretizationing set S is fixed.
Of a particular interest is the case when S is the integer grid, i.e., S = Z2. Then the discretization of a triangle T is called digital triangle. It turns out that the proposed characterization preserves a coding of digital triangles from an integer grid of a given size, say m x m within an O(log m) amount of memory space per coded digital triangle. That is the theoretical minimum.
Lindenbaum, M., Koplowitz, J.: A new parametrization of digital straight lines. IEEE Trans. Pattern Anal. Machine Intell. 13 (1991) 847–852.CrossRefGoogle Scholar
Mamistvalov, A. G.: n-Dimensional moment invariants and conceptual mathematical theory of recognition n-dimensional solids. IEEE Trans. Pattern Anal. Machine Intell. 20 (1998) 819–831.CrossRefGoogle Scholar
Nakamura, A., Aizawa, K.: Digital squares. Computer Vision, Graphics Image Processing 49 (1990) 357–368.CrossRefGoogle Scholar
Singer, M. H.: A general approach to moment calculation for polygons and line segments. Pattern Recognition. 26 (1993). 1019–1028.CrossRefMathSciNetGoogle Scholar
Worring, M., Smeulders, A. W. M.: Digitized circular arcs: Characterization and parameter estimation. IEEE Trans. Pattern Anal. Machine Intell. 17 (1995) 587–598.CrossRefGoogle Scholar
Žunić, J., Acketa, M. D.: A general coding scheme for families of digital curve segments. Graphical Models and Image Processing 60 (1998) 437–460.CrossRefMATHGoogle Scholar
Žunić, J., Sladoje, N.: Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments. IEEE Trans. Pattern Anal. Machine Intell. 22 (2000) 407–414.CrossRefGoogle Scholar