Pages that link to "Item:Q2423794"
From MaRDI portal
The following pages link to Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794):
Displaying 5 items.
- Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
- The DIRECT algorithm: 25 years later (Q2022319) (← links)
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem (Q2022324) (← links)
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem (Q2036141) (← links)
- 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) (← links)