Package | Description |
---|---|
org.openimaj.experiment.evaluation.classification | |
org.openimaj.math.statistics.distribution | |
org.openimaj.util.pair | |
org.openimaj.util.tree |
Modifier and Type | Method and Description |
---|---|
static <CLASS> List<ObjectDoublePair<CLASS>> |
ClassificationResultUtils.getSortedClassesAndConfidences(ClassificationResult<CLASS> result)
Get the all classes and confidences, sorted by decreasing confidence
|
Modifier and Type | Method and Description |
---|---|
List<ObjectDoublePair<double[]>> |
MultivariateKernelDensityEstimate.getSupport(double[] sample)
Get the underlying points that support the KDE within the window around
the given point.
|
Modifier and Type | Field and Description |
---|---|
static Comparator<ObjectDoublePair<?>> |
ObjectDoublePair.SECOND_ITEM_ASCENDING_COMPARATOR
Comparator for comparing the second element of a
ObjectDoublePair in ascending order. |
static Comparator<ObjectDoublePair<?>> |
ObjectDoublePair.SECOND_ITEM_DESCENDING_COMPARATOR
Comparator for comparing the second element of a
ObjectDoublePair in descending order. |
Modifier and Type | Method and Description |
---|---|
static <Q> ObjectDoublePair<Q> |
ObjectDoublePair.pair(Q q,
double t)
Create a pair from the given objects.
|
Modifier and Type | Method and Description |
---|---|
static <Q> List<Q> |
ObjectDoublePair.getFirst(Iterable<ObjectDoublePair<Q>> data)
Extract the first objects from a list of pairs.
|
static <Q> gnu.trove.list.array.TDoubleArrayList |
ObjectDoublePair.getSecond(Iterable<ObjectDoublePair<Q>> data)
Extract the second objects from a list of pairs.
|
Modifier and Type | Method and Description |
---|---|
ObjectDoublePair<byte[]> |
IncrementalByteKDTree.findNearestNeighbour(byte[] query)
Find the nearest neighbour.
|
ObjectDoublePair<double[]> |
IncrementalDoubleKDTree.findNearestNeighbour(double[] query)
Find the nearest neighbour.
|
ObjectDoublePair<float[]> |
IncrementalFloatKDTree.findNearestNeighbour(float[] query)
Find the nearest neighbour.
|
ObjectDoublePair<int[]> |
IncrementalIntKDTree.findNearestNeighbour(int[] query)
Find the nearest neighbour.
|
ObjectDoublePair<long[]> |
IncrementalLongKDTree.findNearestNeighbour(long[] query)
Find the nearest neighbour.
|
ObjectDoublePair<short[]> |
IncrementalShortKDTree.findNearestNeighbour(short[] query)
Find the nearest neighbour.
|
Modifier and Type | Method and Description |
---|---|
List<ObjectDoublePair<byte[]>> |
IncrementalByteKDTree.findNearestNeighbours(byte[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<double[]>> |
IncrementalDoubleKDTree.findNearestNeighbours(double[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<float[]>> |
IncrementalFloatKDTree.findNearestNeighbours(float[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<int[]>> |
IncrementalIntKDTree.findNearestNeighbours(int[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<long[]>> |
IncrementalLongKDTree.findNearestNeighbours(long[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<short[]>> |
IncrementalShortKDTree.findNearestNeighbours(short[] query,
int k)
Find the K nearest neighbours.
|
List<ObjectDoublePair<byte[]>> |
IncrementalByteKDTree.radiusDistanceSearch(byte[] centre,
byte radius)
Find all the points within the given radius of the given point.
|
List<ObjectDoublePair<double[]>> |
IncrementalDoubleKDTree.radiusDistanceSearch(double[] centre,
double radius)
Find all the points within the given radius of the given point.
|
List<ObjectDoublePair<float[]>> |
IncrementalFloatKDTree.radiusDistanceSearch(float[] centre,
float radius)
Find all the points within the given radius of the given point.
|
List<ObjectDoublePair<int[]>> |
IncrementalIntKDTree.radiusDistanceSearch(int[] centre,
int radius)
Find all the points within the given radius of the given point.
|
List<ObjectDoublePair<long[]>> |
IncrementalLongKDTree.radiusDistanceSearch(long[] centre,
long radius)
Find all the points within the given radius of the given point.
|
List<ObjectDoublePair<short[]>> |
IncrementalShortKDTree.radiusDistanceSearch(short[] centre,
short radius)
Find all the points within the given radius of the given point.
|