Package | Description |
---|---|
org.openimaj.knn | |
org.openimaj.knn.approximate | |
org.openimaj.knn.lsh | |
org.openimaj.knn.pq | |
org.openimaj.ml.clustering.kmeans |
K-Means in OpenIMAJ is designed to be both extremely fast and flexible.
|
Modifier and Type | Interface and Description |
---|---|
interface |
NearestNeighboursFactory<T extends NearestNeighbours<DATA,?,?>,DATA>
Interface for factory objects that can produce
NearestNeighbours
objects for some given data. |
Modifier and Type | Interface and Description |
---|---|
interface |
IncrementalNearestNeighbours<DATA,DISTANCES,PAIR_TYPE>
Extension to K-nearest-neighbour that allows database points to be added
dynamically.
|
Modifier and Type | Class and Description |
---|---|
class |
ByteNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with byte[] data.
|
class |
ByteNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
class |
DoubleNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with double[] data.
|
class |
DoubleNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
class |
FloatNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with float[] data.
|
class |
FloatNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
class |
IntNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with int[] data.
|
class |
IntNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
class |
LongNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with long[] data.
|
class |
LongNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
class |
ObjectNearestNeighbours<T>
Abstract base class for k-nearest-neighbour calculations with any form of
object that can be compared with a
DistanceComparator . |
class |
ObjectNearestNeighboursExact<T>
Exact (brute-force) k-nearest-neighbour implementation for objects with a
compatible
DistanceComparator . |
class |
ShortNearestNeighbours
Abstract base class for k-nearest-neighbour calculations with short[] data.
|
class |
ShortNearestNeighboursExact
Exact (brute-force) k-nearest-neighbour implementation.
|
Modifier and Type | Class and Description |
---|---|
class |
ByteNearestNeighboursKDTree
Fast Nearest-Neighbours for byte data using an ensemble of Best-Bin-First KDTrees.
|
class |
DoubleNearestNeighboursKDTree
Fast Nearest-Neighbours for double data using an ensemble of Best-Bin-First KDTrees.
|
class |
FloatNearestNeighboursKDTree
Fast Nearest-Neighbours for float data using an ensemble of Best-Bin-First KDTrees.
|
class |
IntNearestNeighboursKDTree
Fast Nearest-Neighbours for int data using an ensemble of Best-Bin-First KDTrees.
|
class |
LongNearestNeighboursKDTree
Fast Nearest-Neighbours for long data using an ensemble of Best-Bin-First KDTrees.
|
class |
ShortNearestNeighboursKDTree
Fast Nearest-Neighbours for short data using an ensemble of Best-Bin-First KDTrees.
|
Modifier and Type | Class and Description |
---|---|
class |
LSHNearestNeighbours<OBJECT>
Nearest-neighbours based on Locality Sensitive Hashing (LSH).
|
Modifier and Type | Class and Description |
---|---|
class |
ByteADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
ByteSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
class |
DoubleADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
DoubleSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
class |
FloatADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
FloatSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
class |
IncrementalByteADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IncrementalDoubleADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IncrementalFloatADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IncrementalIntADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IncrementalLongADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IncrementalShortADCNearestNeighbours
Incremental Nearest-neighbours using Asymmetric Distance Computation (ADC)
on Product Quantised vectors.
|
class |
IntADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
IntSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
class |
LongADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
LongSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
class |
ShortADCNearestNeighbours
Nearest-neighbours using Asymmetric Distance Computation (ADC) on Product
Quantised vectors.
|
class |
ShortSDCNearestNeighbours
Nearest-neighbours using Symmetric Distance Computation (SDC) on Product
Quantised vectors.
|
Modifier and Type | Class and Description |
---|---|
class |
KMeansConfiguration<NN extends NearestNeighbours<DATA,?,?>,DATA>
Configuration for the K-Means algorithm.
|