Computation of the area in the discrete plane: Green’s theorem revisited - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Journal of Electronic Imaging Année : 2017

Computation of the area in the discrete plane: Green’s theorem revisited

Résumé

The detection of the contour of a binary object is a common problem; however, the area of a region, and its moments, can be a significant parameter. In several metrology applications, the area of planar objects must be measured. The area is obtained by counting the pixels inside the contour or using a discrete version of Green's formula. Unfortunately, we obtain the area enclosed by the polygonal line passing through the centers of the pixels along the contour. We present a modified version of Green's theorem in the discrete plane, which allows for the computation of the exact area of a two-dimensional region in the class of polyominoes. Penalties are introduced and associated with each successive pair of Freeman displacements along the contour in an eight-connectivity system. The proposed equation is shown to be true and properties of the equation related to the topology of the regions are presented. The proposed approach is adapted for faster computation than the combinatorial approach proposed in the literature. (C) The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. DIGITAL PICTURES; POLYOMINOES; GEOMETRY

Dates et versions

hal-01858610 , version 1 (21-08-2018)

Identifiants

Citer

Alain Chalifour, Fathallah Nouboud, Yvon Voisin. Computation of the area in the discrete plane: Green’s theorem revisited. Journal of Electronic Imaging, 2017, 26 (06), pp.063022. ⟨10.1117/1.JEI.26.6.063022⟩. ⟨hal-01858610⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More