IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v56y2012i9p2771-2781.html
   My bibliography  Save this article

A doubly optimal ellipse fit

Author

Listed:
  • Al-Sharadqah, A.
  • Chernov, N.

Abstract

We study the problem of fitting ellipses to observed points in the context of Errors-In-Variables regression analysis. The accuracy of fitting methods is characterized by their variances and biases. The variance has a theoretical lower bound (the KCR bound), and many practical fits attend it, so they are optimal in this sense. There is no lower bound on the bias, though, and in fact our higher order error analysis (developed just recently) shows that it can be eliminated, to the leading order. Kanatani and Rangarajan recently constructed an algebraic ellipse fit that has no bias, but its variance exceeds the KCR bound; so their method is optimal only relative to the bias. We present here a novel ellipse fit that enjoys both optimal features: the theoretically minimal variance and zero bias (both to the leading order). Our numerical tests confirm the superiority of the proposed fit over the existing fits.

Suggested Citation

  • Al-Sharadqah, A. & Chernov, N., 2012. "A doubly optimal ellipse fit," Computational Statistics & Data Analysis, Elsevier, vol. 56(9), pages 2771-2781.
    • Handle: RePEc:eee:csdana:v:56:y:2012:i:9:p:2771-2781
    DOI: 10.1016/j.csda.2012.02.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947312001107
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2012.02.028?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kanatani, Kenichi & Rangarajan, Prasanna, 2011. "Hyper least squares fitting of circles and ellipses," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2197-2208, June.
    2. Chernov, N. & Lesort, C., 2004. "Statistical efficiency of curve fitting algorithms," Computational Statistics & Data Analysis, Elsevier, vol. 47(4), pages 713-728, November.
    3. Kukush, Alexander & Markovsky, Ivan & Van Huffel, Sabine, 2004. "Consistent estimation in an implicit quadratic measurement error model," Computational Statistics & Data Analysis, Elsevier, vol. 47(1), pages 123-147, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. N. Chernov, 2011. "Fitting circles to scattered data: parameter estimates have no moments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 73(3), pages 373-384, May.
    2. Kanatani, Kenichi & Rangarajan, Prasanna, 2011. "Hyper least squares fitting of circles and ellipses," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2197-2208, June.
    3. Kanatani, Kenichi & Sugaya, Yasuyuki, 2007. "Performance evaluation of iterative geometric fitting algorithms," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 1208-1222, October.
    4. Al-Sharadqah, A. & Ho, K.C., 2018. "Constrained Cramér–Rao Lower Bound in Errors-In Variables (EIV) models: Revisited," Statistics & Probability Letters, Elsevier, vol. 135(C), pages 118-126.
    5. Manolopoulou, Ioanna & Kepler, Thomas B. & Merl, Daniel M., 2012. "Mixtures of Gaussian wells: Theory, computation, and application," Computational Statistics & Data Analysis, Elsevier, vol. 56(12), pages 3809-3820.
    6. Hans Schneeweiss & Thomas Augustin, 2006. "Some recent advances in measurement error models and methods," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 90(1), pages 183-197, March.
    7. Shklyar, Sergiy & Kukush, Alexander & Markovsky, Ivan & Van Huffel, Sabine, 2007. "On the conic section fitting problem," Journal of Multivariate Analysis, Elsevier, vol. 98(3), pages 588-624, March.
    8. Greco, Luca & Pacillo, Simona & Maresca, Piera, 2023. "An impartial trimming algorithm for robust circle fitting," Computational Statistics & Data Analysis, Elsevier, vol. 181(C).
    9. Chernov, N. & Sapirstein, P.N., 2008. "Fitting circles to data with correlated noise," Computational Statistics & Data Analysis, Elsevier, vol. 52(12), pages 5328-5337, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:56:y:2012:i:9:p:2771-2781. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.