登入選單
返回Google圖書搜尋
出版University of Edinburgh, Department of Artificial Intelligence, 1996
URLhttp://books.google.com.hk/books?id=aHV_GwAACAAJ&hl=&source=gbs_api
註釋Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b2=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html."