Abstract:
Moments have been widely used in shape recognition and identification. In general, the (k,l)-moment, denoted by mk,l(S), of a planar measurable set S is defined by mk,l(S) = sxkyl dx dy We assume situations in image analysis and pattern recognition where real objects are acquired (by thresholding, segmentation etc.) as binary images D(S), i.e. as digital sets or digital regions. For a set S, in this paper its digitization is defined to be the set of all grid points with integer coordinates which belong to the region occupied by the given set S. Since in image processing applications, the exact values of the moments mk,l(S) remain unknown, they are usually approximated by discrete moments µk,l(S) where µk,l(S) = S(i,j)D(S)ik.jl = Si,jareintegers(i,j)S ik.jl. Moments of order up to two (i.e. k + l 2) are frequently used and our attention is focused on them, i.e. on the limitation in their estimation from the corresponding digital picture. In this paper it is proved that mk,l(S)-1/rk+l+2.µµ,l(r.S)=O(1/r15/11+e) O (1/r1.363636...) for k + l = 2, where S is a convex set in the plane with a boundary having continuous third derivative and positive curvature at every point, r is the number of pixels per unit (i.e. 1/r is the size of the pixel), while r S denotes the dilation of S by factor r.
Description:
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s).