Computer Vision, Graphics, and Image Processing
A New Parameterization of Digital Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing a shape's moments from its boundary
Pattern Recognition
Simple and fast computation of moments
Pattern Recognition
A new characterization of digital lines by least square fits
Pattern Recognition Letters
On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
IEEE Transactions on Pattern Analysis and Machine Intelligence
A general coding scheme for families of digital curve segments
CVGIP: Graphical Models and Image Processing
Digital approximation of moments of convex regions
Graphical Models and Image Processing
Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multigrid Convergence of Calculated Features in Image Analysis
Journal of Mathematical Imaging and Vision
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
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 all discrete triangles from a fixed discretizing set are determined uniquely by their 10 discrete moments which have the order up to 3. Of a particular interest is the case when S is the integer grid, i.e., S = Z2. The discretization of a real triangle on Z2 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 × m, within an O(log m) amount of memory space per coded digital triangle. That is the theoretical minimum. A possible extension of the proposed coding scheme for digital triangles to the coding digital convex k-gons and arbitrary digital convex shapes is discussed, as well.