Sentence examples for a minimum spanning forest from inspiring English sources

For constructing a minimum spanning forest (MSF), a B-band hyperspectral image is given, which can be considered as a set of n-pixel vectors X = {x j ∈ R B, j = 1, 2, …, n}.

Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset.

In fact, our algorithms also solve the minimum spanning forest problem.

This paper aimed to present a new method for the spectral-spatial classification of hyperspectral images, based on the idea of modified minimum spanning forest (MMSF).

Definition 2. Minimum spanning tree [35]: given a connected weighted graph, a minimum spanning tree covers all the vertices (contains edges) of that has minimal total edge weight.

A polynomial approximation algorithm was presented by constructing a minimum spanning tree [25].

It finds a minimum spanning tree using a greedy strategy based on COST l.

A minimum spanning haplotype network also supported separation into three lineages.

Finally, a minimum spanning tree is built to highlight the crack and remove the noise.

A minimum spanning tree projection was used to randomly select the projection nodes [22].

For this, a minimum spanning tree clustering algorithm is applied, which is detailed in [36].