QuickShiftAlgorithm: QuickShift algorithm (Vedaldi & Soatto, 2008)
In benja0x40/QuickShift: QuickShift

Description Usage Arguments Value References See Also

Implementation of the QuickShift algorithm using accelerated nearest neighbor queries from the FNN package.

1	QuickShiftAlgorithm(x, d, plot = FALSE, nn_alg = "kd_tree")

`x`	numeric matrix representing multivariate data where rows = observations and columns = measurement conditions.
`d`	numeric vector representing a density estimation at each observation.
`plot`	logical value allowing to visualize the construction of the QuickShift graph.
`nn_alg`	nearest neighbor searching algorithm (default = "kd_tree"). See get.knn for further explanations.

QuickShiftAlgorithm returns a graph object (see igraph package). The QuickShiftClusters function can extract clusters from such graph.

Vedaldi A., Soatto S. (2008) Quick Shift and Kernel Methods for Mode Seeking. In: Forsyth D., Torr P., Zisserman A. (eds) Computer Vision – ECCV 2008. ECCV 2008. Lecture Notes in Computer Science, vol 5305. Springer, Berlin, Heidelberg http://dx.doi.org/10.1007/978-3-540-88693-8_52

QuickShiftClusters, QuickShift

benja0x40/QuickShift documentation built on Jan. 22, 2021, 7:43 p.m.