Package | Description |
---|---|
org.openimaj.knn | |
org.openimaj.knn.approximate | |
org.openimaj.knn.lsh | |
org.openimaj.knn.pq | |
org.openimaj.ml.clustering | |
org.openimaj.ml.clustering.assignment.hard | |
org.openimaj.ml.clustering.assignment.soft | |
org.openimaj.ml.clustering.kmeans |
K-Means in OpenIMAJ is designed to be both extremely fast and flexible.
|
org.openimaj.ml.clustering.rac | |
org.openimaj.ml.clustering.rforest | |
org.openimaj.util.pair | |
org.openimaj.util.tree |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
ByteNearestNeighboursExact.searchNN(byte[] query) |
IntFloatPair |
FloatNearestNeighboursExact.searchNN(float[] query) |
IntFloatPair |
IntNearestNeighboursExact.searchNN(int[] query) |
IntFloatPair |
ShortNearestNeighboursExact.searchNN(short[] query) |
IntFloatPair |
ObjectNearestNeighboursExact.searchNN(T query) |
Modifier and Type | Method and Description |
---|---|
List<IntFloatPair> |
ByteNearestNeighboursExact.searchKNN(byte[] query,
int K) |
List<IntFloatPair> |
FloatNearestNeighboursExact.searchKNN(float[] query,
int K) |
List<IntFloatPair> |
IntNearestNeighboursExact.searchKNN(int[] query,
int K) |
List<IntFloatPair> |
ShortNearestNeighboursExact.searchKNN(short[] query,
int K) |
List<IntFloatPair> |
ObjectNearestNeighboursExact.searchKNN(T query,
int K) |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
ByteNearestNeighboursKDTree.searchNN(byte[] query) |
IntFloatPair |
FloatNearestNeighboursKDTree.searchNN(float[] query) |
IntFloatPair |
IntNearestNeighboursKDTree.searchNN(int[] query) |
IntFloatPair |
ShortNearestNeighboursKDTree.searchNN(short[] query) |
Modifier and Type | Method and Description |
---|---|
List<IntFloatPair> |
ByteNearestNeighboursKDTree.searchKNN(byte[] query,
int K) |
List<IntFloatPair> |
FloatNearestNeighboursKDTree.searchKNN(float[] query,
int K) |
List<IntFloatPair> |
IntNearestNeighboursKDTree.searchKNN(int[] query,
int K) |
List<IntFloatPair> |
ShortNearestNeighboursKDTree.searchKNN(short[] query,
int K) |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
LSHNearestNeighbours.searchNN(OBJECT query) |
Modifier and Type | Method and Description |
---|---|
List<IntFloatPair> |
LSHNearestNeighbours.searchKNN(OBJECT query,
int K) |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
IncrementalByteADCNearestNeighbours.searchNN(byte[] query) |
IntFloatPair |
ByteADCNearestNeighbours.searchNN(byte[] query) |
IntFloatPair |
FloatADCNearestNeighbours.searchNN(float[] query) |
IntFloatPair |
IncrementalFloatADCNearestNeighbours.searchNN(float[] query) |
IntFloatPair |
IntADCNearestNeighbours.searchNN(int[] query) |
IntFloatPair |
IncrementalIntADCNearestNeighbours.searchNN(int[] query) |
IntFloatPair |
IncrementalShortADCNearestNeighbours.searchNN(short[] query) |
IntFloatPair |
ShortADCNearestNeighbours.searchNN(short[] query) |
Modifier and Type | Method and Description |
---|---|
List<IntFloatPair> |
IncrementalByteADCNearestNeighbours.searchKNN(byte[] query,
int K) |
List<IntFloatPair> |
ByteADCNearestNeighbours.searchKNN(byte[] query,
int K) |
List<IntFloatPair> |
FloatADCNearestNeighbours.searchKNN(float[] query,
int K) |
List<IntFloatPair> |
IncrementalFloatADCNearestNeighbours.searchKNN(float[] query,
int K) |
List<IntFloatPair> |
IntADCNearestNeighbours.searchKNN(int[] query,
int K) |
List<IntFloatPair> |
IncrementalIntADCNearestNeighbours.searchKNN(int[] query,
int K) |
List<IntFloatPair> |
IncrementalShortADCNearestNeighbours.searchKNN(short[] query,
int K) |
List<IntFloatPair> |
ShortADCNearestNeighbours.searchKNN(short[] query,
int K) |
Modifier and Type | Method and Description |
---|---|
protected void |
ByteSDCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IncrementalByteADCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ByteADCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
FloatADCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IncrementalFloatADCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
FloatSDCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IntADCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IncrementalIntADCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IntSDCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IncrementalShortADCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ShortADCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ShortSDCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
Modifier and Type | Method and Description |
---|---|
protected void |
ByteSDCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IncrementalByteADCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ByteADCNearestNeighbours.computeDistances(byte[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
FloatADCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IncrementalFloatADCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
FloatSDCNearestNeighbours.computeDistances(float[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IntADCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IncrementalIntADCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
IntSDCNearestNeighbours.computeDistances(int[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
protected void |
IncrementalShortADCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ShortADCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair wp) |
protected void |
ShortSDCNearestNeighbours.computeDistances(short[] fullQuery,
BoundedPriorityQueue<IntFloatPair> queue,
IntFloatPair workingPair) |
Modifier and Type | Method and Description |
---|---|
HardAssigner<T,float[],IntFloatPair> |
FeatureVectorCentroidsResult.defaultHardAssigner() |
HardAssigner<short[],float[],IntFloatPair> |
ShortCentroidsResult.defaultHardAssigner() |
HardAssigner<float[],float[],IntFloatPair> |
FloatCentroidsResult.defaultHardAssigner() |
HardAssigner<int[],float[],IntFloatPair> |
IntCentroidsResult.defaultHardAssigner() |
HardAssigner<byte[],float[],IntFloatPair> |
ByteCentroidsResult.defaultHardAssigner() |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
HierarchicalByteHardAssigner.assignDistance(byte[] data) |
IntFloatPair |
ExactByteAssigner.assignDistance(byte[] data) |
IntFloatPair |
KDTreeByteEuclideanAssigner.assignDistance(byte[] data) |
IntFloatPair |
ConstrainedFloatAssigner.assignDistance(DATATYPE data) |
IntFloatPair |
HierarchicalFloatHardAssigner.assignDistance(float[] data) |
IntFloatPair |
ExactFloatAssigner.assignDistance(float[] data) |
IntFloatPair |
KDTreeFloatEuclideanAssigner.assignDistance(float[] data) |
IntFloatPair |
KDTreeIntEuclideanAssigner.assignDistance(int[] data) |
IntFloatPair |
HierarchicalIntHardAssigner.assignDistance(int[] data) |
IntFloatPair |
ExactIntAssigner.assignDistance(int[] data) |
IntFloatPair |
KDTreeShortEuclideanAssigner.assignDistance(short[] data) |
IntFloatPair |
HierarchicalShortHardAssigner.assignDistance(short[] data) |
IntFloatPair |
ExactShortAssigner.assignDistance(short[] data) |
IntFloatPair |
ExactFeatureVectorAssigner.assignDistance(T data) |
Constructor and Description |
---|
ConstrainedFloatAssigner(HardAssigner<DATATYPE,float[],IntFloatPair> internalAssigner,
float threshold)
Construct the ConstrainedFloatAssigner with the given assigner and
threshold.
|
ConstrainedFloatAssigner(HardAssigner<DATATYPE,float[],IntFloatPair> internalAssigner,
float threshold,
boolean greater)
Construct the ConstrainedFloatAssigner with the given assigner and
threshold.
|
Modifier and Type | Field and Description |
---|---|
protected Map<CentroidsProvider<int[]>,HardAssigner<int[],float[],IntFloatPair>> |
HierarchicalIntPathAssigner.assigners |
protected Map<CentroidsProvider<float[]>,HardAssigner<float[],float[],IntFloatPair>> |
HierarchicalFloatPathAssigner.assigners |
protected Map<CentroidsProvider<byte[]>,HardAssigner<byte[],float[],IntFloatPair>> |
HierarchicalBytePathAssigner.assigners |
protected Map<CentroidsProvider<short[]>,HardAssigner<short[],float[],IntFloatPair>> |
HierarchicalShortPathAssigner.assigners |
Modifier and Type | Method and Description |
---|---|
HardAssigner<float[],float[],IntFloatPair> |
FloatKMeans.Result.defaultHardAssigner() |
HardAssigner<short[],float[],IntFloatPair> |
ShortKMeans.Result.defaultHardAssigner() |
HardAssigner<int[],float[],IntFloatPair> |
IntKMeans.Result.defaultHardAssigner() |
HardAssigner<byte[],float[],IntFloatPair> |
ByteKMeans.Result.defaultHardAssigner() |
HardAssigner<T,float[],IntFloatPair> |
FeatureVectorKMeans.Result.defaultHardAssigner() |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
IntRAC.assignDistance(int[] data) |
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
IntRandomForest.assignDistance(int[] data) |
Modifier and Type | Field and Description |
---|---|
static Comparator<IntFloatPair> |
IntFloatPair.FIRST_ITEM_ASCENDING_COMPARATOR
Comparator for comparing the first element of a
IntFloatPair in ascending order. |
static Comparator<IntFloatPair> |
IntFloatPair.FIRST_ITEM_DESCENDING_COMPARATOR
Comparator for comparing the first element of a
IntFloatPair in descending order. |
static Comparator<IntFloatPair> |
IntFloatPair.SECOND_ITEM_ASCENDING_COMPARATOR
Comparator for comparing the second element of a
IntFloatPair in ascending order. |
static Comparator<IntFloatPair> |
IntFloatPair.SECOND_ITEM_DESCENDING_COMPARATOR
Comparator for comparing the second element of a
IntFloatPair in descending order. |
Modifier and Type | Method and Description |
---|---|
static IntFloatPair |
IntFloatPair.pair(int a,
float b)
Create a pair from the given values.
|
Modifier and Type | Method and Description |
---|---|
static gnu.trove.list.array.TIntArrayList |
IntFloatPair.getFirst(Iterable<IntFloatPair> data)
Extract the first values from a list of pairs.
|
static gnu.trove.list.array.TFloatArrayList |
IntFloatPair.getSecond(Iterable<IntFloatPair> data)
Extract the second values from a list of pairs.
|
Modifier and Type | Method and Description |
---|---|
IntFloatPair |
FloatKDTree.SplitChooser.chooseSplit(float[][] pnts,
IntArrayView inds,
int depth,
float[] minBounds,
float[] maxBounds)
Choose the dimension and discriminant on which to split the data.
|
IntFloatPair |
FloatKDTree.BasicMedianSplit.chooseSplit(float[][] pnts,
IntArrayView inds,
int depth,
float[] minBounds,
float[] maxBounds) |
IntFloatPair |
FloatKDTree.BBFMedianSplit.chooseSplit(float[][] pnts,
IntArrayView inds,
int depth,
float[] minBounds,
float[] maxBounds) |
IntFloatPair |
FloatKDTree.ApproximateBBFMedianSplit.chooseSplit(float[][] pnts,
IntArrayView inds,
int depth,
float[] minBounds,
float[] maxBounds) |
IntFloatPair |
FloatKDTree.RandomisedBBFMeanSplit.chooseSplit(float[][] pnts,
IntArrayView inds,
int depth,
float[] minBounds,
float[] maxBounds) |
IntFloatPair |
ByteKDTree.nearestNeighbour(byte[] qu)
Nearest-neighbour search
|
IntFloatPair |
FloatKDTree.nearestNeighbour(float[] qu)
Nearest-neighbour search
|
IntFloatPair |
IntKDTree.nearestNeighbour(int[] qu)
Nearest-neighbour search
|
IntFloatPair |
ShortKDTree.nearestNeighbour(short[] qu)
Nearest-neighbour search
|
Modifier and Type | Method and Description |
---|---|
List<IntFloatPair> |
ByteKDTree.nearestNeighbours(byte[] qu,
int n)
Nearest-neighbour search
|
List<IntFloatPair> |
FloatKDTree.nearestNeighbours(float[] qu,
int n)
Nearest-neighbour search
|
List<IntFloatPair> |
IntKDTree.nearestNeighbours(int[] qu,
int n)
Nearest-neighbour search
|
List<IntFloatPair> |
ShortKDTree.nearestNeighbours(short[] qu,
int n)
Nearest-neighbour search
|