MINIMUM VOLUME ENCLOSING ELLIPSOIDS
暂无分享,去创建一个
Two different methods for computing the covering ellipses of a set of points are presented. The first method finds the optimal ellipsoids with the minimum volume. The second method uses the first and second moments of the data points to compute the parameters of an ellipsoid that covers most of the points. A MATLAB software is written to verify the results.
[1] Leonid Khachiyan,et al. Rounding of Polytopes in the Real Number Model of Computation , 1996, Math. Oper. Res..
[2] Luiz Velho,et al. Image moments-based structuring and tracking of objects , 2002, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing.
[3] Peng Sun,et al. Computation of Minimum Volume Covering Ellipsoids , 2002, Oper. Res..
[4] Piyush Kumar,et al. Minimum-Volume Enclosing Ellipsoids and Core Sets , 2005 .