Multiple ellipse fitting by center-based clustering
نویسندگان
چکیده
This paper deals with the multiple ellipse fitting problem based on a given set of data points in a plane. The presumption is that all data points are derived from k ellipses that should be fitted. The problem is solved by means of center-based clustering, where cluster centers are ellipses. If the Mahalanobis distance-like function is introduced in each cluster, then the cluster center is represented by the corresponding Mahalanobis circle-center. The distance from a point a ∈ R to the Mahalanobis circle is based on the algebraic criterion. The well-known k-means algorithm has been adapted to search for a locally optimal partition of the Mahalanobis circle-centers. Several numerical examples are used to illustrate the proposed algorithm.
منابع مشابه
Direct Ellipse Fitting and Measuring Based on Shape Boundaries
Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extracted edges from real world images. We are interested in ellipse fitting and ellipticity measures which rely exclusively on shape boundary points which are practical in computer vision. They should also be calculated very...
متن کاملThe 3D position recognition of multiple coils using ellipse fitting with probabilistic edge detection with stereo cameras
The development of unmanned crane is an important issue of Factory Automation in steel industry. This paper focus on unmanned crane for picking up coils on a trailer although positions and diameters of coils is not fixed. In order to pick up those coils, unmanned crane should know exact 3D coil position. Therefore, in order to find out exact 3D coil’s centers, this paper propose the system that...
متن کاملDirect Least-squares Ellipse Fitting
Many biological and astronomical forms can be best represented by ellipses. While some more complex curves might represent the shape more accurately, ellipses have the advantage that they are easily parameterised and define the location, orientation and dimensions of the data more clearly. In this paper, we present a method of direct least-squares ellipse fitting by solving a generalised eigens...
متن کاملEye Location Based on Hough Transform and Direct Least Square Ellipse Fitting
Feature extraction and location of eye are very important in face expression recognition, human-computer interaction, face detection and identification etc. This paper presents a new efficient method for eye location. Firstly, gradient, integral image, and Hough transform are used to obtain location and radius of the pupil. Secondly, CANNY operator and ellipse fitting of direct least square are...
متن کاملGeometric Interpretation and Precision Analysis of Algebraic Ellipse Fitting Using Least Squares Method
This paper presents a new approach for precision estimation for algebraic ellipse fitting based on combined least squares method. Our approach is based on coordinate description of the ellipse geometry to determine the error distances of the fitting method. Since it is an effective fitting algorithm the well-known Direct Ellipse Fitting method was selected as an algebraic method for precision e...
متن کامل