Uses of Package
org.openimaj.knn.approximate

Packages that use org.openimaj.knn.approximate

Package	Description
org.openimaj.feature.local.matcher
org.openimaj.knn.approximate
org.openimaj.ml.clustering.assignment.hard

Classes in org.openimaj.knn.approximate used by org.openimaj.feature.local.matcher

Class and Description
ByteNearestNeighboursKDTree Fast Nearest-Neighbours for byte data using an ensemble of Best-Bin-First KDTrees.

Classes in org.openimaj.knn.approximate used by org.openimaj.knn.approximate

Class and Description
ByteKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for byte data.
ByteKDTreeEnsemble.ByteKDTreeNode An internal node of the KDTree
ByteNearestNeighboursKDTree Fast Nearest-Neighbours for byte data using an ensemble of Best-Bin-First KDTrees.
DoubleKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for double data.
DoubleKDTreeEnsemble.DoubleKDTreeNode An internal node of the KDTree
DoubleNearestNeighboursKDTree Fast Nearest-Neighbours for double data using an ensemble of Best-Bin-First KDTrees.
FloatKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for float data.
FloatKDTreeEnsemble.FloatKDTreeNode An internal node of the KDTree
FloatNearestNeighboursKDTree Fast Nearest-Neighbours for float data using an ensemble of Best-Bin-First KDTrees.
IntKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for int data.
IntKDTreeEnsemble.IntKDTreeNode An internal node of the KDTree
IntNearestNeighboursKDTree Fast Nearest-Neighbours for int data using an ensemble of Best-Bin-First KDTrees.
LongKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for long data.
LongKDTreeEnsemble.LongKDTreeNode An internal node of the KDTree
LongNearestNeighboursKDTree Fast Nearest-Neighbours for long data using an ensemble of Best-Bin-First KDTrees.
ShortKDTreeEnsemble Ensemble of Best-Bin-First KDTrees for short data.
ShortKDTreeEnsemble.ShortKDTreeNode An internal node of the KDTree
ShortNearestNeighboursKDTree Fast Nearest-Neighbours for short data using an ensemble of Best-Bin-First KDTrees.

Classes in org.openimaj.knn.approximate used by org.openimaj.ml.clustering.assignment.hard

Class and Description
ByteNearestNeighboursKDTree Fast Nearest-Neighbours for byte data using an ensemble of Best-Bin-First KDTrees.
DoubleNearestNeighboursKDTree Fast Nearest-Neighbours for double data using an ensemble of Best-Bin-First KDTrees.
FloatNearestNeighboursKDTree Fast Nearest-Neighbours for float data using an ensemble of Best-Bin-First KDTrees.
IntNearestNeighboursKDTree Fast Nearest-Neighbours for int data using an ensemble of Best-Bin-First KDTrees.
LongNearestNeighboursKDTree Fast Nearest-Neighbours for long data using an ensemble of Best-Bin-First KDTrees.
ShortNearestNeighboursKDTree Fast Nearest-Neighbours for short data using an ensemble of Best-Bin-First KDTrees.