Ellipse fitting is widely used in image processing, machine vision and other fields. Aiming at the problems of large data computation, high complexity and longtime consumption in the implementation of ellipse fitting algorithm by programmable gate array (FPGA), this paper proposes an FPGA implementation method of ellipse fitting based on least squares. This method is based on the principle of least squares. In the ellipse fitting problem under constraints, the generalized eigenvalue and eigenvector problem of the sixth-order matrix is avoided, and it is transformed into the eigenvalue and eigenvector of the general third-order matrix. Householder transformation and Givens rotation are used to greatly reduce the computational complexity. The simulation results show that the method still has high accuracy when using fixed-point number calculation.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.