This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments
April 2000 (vol. 22 no. 4)
pp. 407-414

Abstract—In this paper, our studies are focused on ellipses and problems related to their representation and reconstruction from the data resulting from their digitization. The main result of the paper is that a finite number of discrete moments, corresponded to digital ellipses, is in one-to-one correspondence with digital ellipses, which enables coding of digital ellipses with an asymptotically optimal amount of memory. In addition, the problem of reconstruction, based on the same parameters, is considered. Since the digitization of real shapes causes an inherent loss of information about the original objects, the precision of the original shape estimation from the corresponding digital data is limited. We derive a sharp upper bound for the errors in reconstruction of the center position and half-axes of the ellipse, in function of the applied picture resolution (i.e., the number of pixels per unit). An extension of these results to the $3D$ case is also given.

[1] L. Dorst and A.W.M. Smeulders, “Discrete Representation of Straight Lines,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 450-463, 1984.
[2] S. Fisk, “Separating Point Sets by Circles and the Recognition of Digital Disks,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 554-556, 1984.
[3] M.N. Huxley, “Exponential Sums and Lattice Points,” Proc. London Math. Soc., vol. 3, no. 60, pp. 471-502, 1990.
[4] H. Iwaniec and C.J. Mozzochi, “On the Divisor and Circles Problems,” J. Number Theory, vol. 29, pp. 60-93, 1988.
[5] C.E. Kim, “Digital Circles,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 372-374, 1984.
[6] R. Klette, I. Stojmenovic, and J. Zunic, “A Parametrization of Digital Planes by Least Square Fits and Generalizations,” Graphical Models and Image Processing, vol. 58, no. 3, pp. 295-300, 1996.
[7] J. Koplowitz and A.M. Bruckstein,“Design of perimeter estimators for digitized planar shapes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 611-622, 1989.
[8] V.A. Kovalevsky, New Definition and Fast Recognition of Digital Straight Segments and Arcs Proc. 10th Int'l Conf. Pattern Recognition (ICPR '90), vol. 2, pp. 31-34, 1990.
[9] M. Lindenbaum and J. Koplowitz, “A New Parametrization of Digital Straight Lines,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 847-852, 1991.
[10] R.A. Melter, I. Stojmenovic, and J. Zunic, “A New Characterization of Digital Lines by Least Square Fits,” Pattern Recognition Letters, vol. 14, pp. 83-88, 1993.
[11] A. Nakamura and K. Aizawa, “Digital Circles,” Computer Vision, Graphics and, Image Processing, vol. 26, pp. 242-255, 1984.
[12] P. Sauer, “On the Recognition of Digital Circles in Linear Time,” Computational Geometry: Theory and Applications, vol. 2, pp. 287-302, 1993.
[13] N. Sladoje and J. Zunic, “Ellipses Estimation from Their Digitization,” Discrete Geometry for Computer Imagery, vol. 1,347, pp. 187-198, 1997.
[14] M. Worring, “Shape Analysis of Digital Curves,” PhD thesis, Univ. of Amsterdam, 1995.
[15] M. Worring and A.W.M. Smeulders, "Digitized Circular Arcs: Characterization and Parameter Estimation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 587-598, 1995.

Index Terms:
Pattern analysis, computer vision, digital shapes, coding, parameter estimation.
Citation:
Jovisa Zunic, Natasa Sladoje, "Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 4, pp. 407-414, April 2000, doi:10.1109/34.845384
Usage of this product signifies your acceptance of the Terms of Use.