The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. (Q2280464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The adaptation of the k-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. |
scientific article; zbMATH DE number 7144732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. |
scientific article; zbMATH DE number 7144732 |
Statements
The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. (English)
0 references
18 December 2019
0 references
multiple ellipses detection problem
0 references
globally optimal \(k\)-partition
0 references
Lipschitz continuous function
0 references
DIRECT
0 references
\(k\)-means
0 references
0 references
0 references
0 references
0.83753073
0 references
0.8317617
0 references
0.82962084
0 references
0.8218805
0 references
0.81854177
0 references
0 references
