Digital Approximation of Moments of Convex Regions

Abstract Representation of real regions by corresponding digital pictures causes an inherent loss of information. There are infinitely many different real regions with an identical corresponding digital picture. So, there are limitations in the reconstruction of the originals and their properties from digital pictures. The problem which will be studied here is the impact of a digitization process on the efficiency in the reconstruction of the basic geometric properties of a planar convex region from the corresponding digital picture: position (usually described by the gravity center or centroid), orientation (usually described by the axis of the least second moment), and elongation (usually calculated as the ratio of the minimal and maximal second moments values w.r.t. the axis of the least second moment). Note that the size (area) estimation of the region (mostly estimated as the number of digital points belonging to the considered region) is a problem with an extensive history in number theory. We start with smooth convex regions, i.e., regions, whose boundaries have a continuous third-order derivative and positive curvature (at every point), and show that if such a planar convex region is represented by a binary picture with resolution r, then the mentioned features can be reconstructed with an absolute upper error bound of O ( 1 r 15/11−ϵ )≈ O ( 1 r 1.3636... ), in the worst case. Since r is the number of pixels per unit, 1 r is the pixel size. This result can be extended to regions which may be obtained from the previously described convex regions by finite applications of unions, intersections, or set differences. The upper error bound remains the same and converges to zero with increases in grid resolution. The given description of the speed of convergence is very sharp. Only smooth, curved regions are studied because if the considered region contains a straight section, the worst-case errors in the above estimations have 1 r as their order of magnitude. This is a trivial result—The derivation is based on the estimation of the difference between the real moments (of the first and second order) and the corresponding discrete moments. The derived estimation can be a necessary mathematical tool in the evaluation of other procedures in the area of digital image analysis based on moment calculations.

[1]  Jovisa D. Zunic,et al.  A General Coding Scheme for Families of Digital Curve Segments , 1998, Graph. Model. Image Process..

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  Herbert Süße,et al.  The Method of Normalization to Determine Invariants , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[5]  Fritz Albregtsen,et al.  Fast Computation of Three-Dimensional Geometric Moments Using a Discrete Divergence Theorem and a Generalization to Higher Dimensions , 1997, CVGIP Graph. Model. Image Process..

[6]  Herbert Süße,et al.  Invariant Fitting of Planar Objects by Primitives , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  M. Huxley EXPONENTIAL SUMS AND LATTICE POINTS II , 1993 .

[8]  Ivan Stojmenovic,et al.  A Parametrization of Digital Planes by Least-Squares Fits and Generalizations , 1996, CVGIP Graph. Model. Image Process..

[9]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[10]  Henryk Iwaniec,et al.  On the divisor and circle problems , 1988 .

[11]  Roland T. Chin,et al.  On digital approximation of moment invariants , 1986, Computer Vision Graphics and Image Processing.

[12]  Robert B. McGhee,et al.  Aircraft Identification by Moment Invariants , 1977, IEEE Transactions on Computers.

[13]  Lawrence O'Gorman,et al.  Subpixel Precision of Straight-Edged Shapes for Registration and Measurement , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Henk J. A. M. Heijmans,et al.  Similarity and Symmetry Measures for Convex Shapes Using Minkowski Addition , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Pei Soo-Chang,et al.  Using moments to acquire the motion parameters of a deformable object without correspondences , 1994 .

[16]  Marcel Worring,et al.  Digitized Circular Arcs: Characterization and Parameter Estimation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  M. Huxley Exponential sums and lattice points III , 2003 .

[18]  Natasa Sladoje,et al.  A Characterization of Digital Disks by Discrete Moments , 1997, CAIP.

[19]  Horst Bunke,et al.  Simple and fast computation of moments , 1991, Pattern Recognit..

[20]  Soo-Chang Pei,et al.  Using moments to acquire the motion parameters of a deformable object without correspondences , 1994, Image Vis. Comput..

[21]  Matthias Gruber,et al.  Moment-Based Image Normalization With High Noise-Tolerance , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Behrooz Kamgar-Parsi,et al.  Evaluation of quantization error in computer vision , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[23]  Dinggang Shen,et al.  Generalized Affine Invariant Image Normalization , 1997, IEEE Trans. Pattern Anal. Mach. Intell..