September 2019
Intermediate to advanced
420 pages
10h 29m
English
The essential clustering algorithm that OpenCV provides is k-means clustering, which searches for a predestined number of k-clusters (or groups) from an unlabeled multi-dimensional data.
It achieves this by using two simple hypotheses about what optimal clustering should look like:
It's easiest to understand the algorithm by looking at a concrete example.
Read now
Unlock full access