org.openimaj.knn.approximate

Class IntNearestNeighboursKDTree.Factory

java.lang.Object

org.openimaj.knn.approximate.IntNearestNeighboursKDTree.Factory

All Implemented Interfaces:

NearestNeighboursFactory<IntNearestNeighboursKDTree,int[]>

Enclosing class:

IntNearestNeighboursKDTree

public static final class IntNearestNeighboursKDTree.Factory
extends Object
implements NearestNeighboursFactory<IntNearestNeighboursKDTree,int[]>

NearestNeighboursFactory for producing IntNearestNeighboursKDTrees.

Author:

Jonathon Hare (jsh2@ecs.soton.ac.uk)

Constructor Summary

Constructors

Constructor and Description
Factory() Construct the factory the default number of trees and checks.
Factory(int ntrees, int nchecks) Construct the factory the given number of trees and checks.

Method Summary

Modifier and Type	Method and Description
IntNearestNeighboursKDTree	create(int[][] data) Create a NearestNeighbours object that works over the provided data.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Factory

public Factory()

Construct the factory the default number of trees and checks.

Factory

public Factory(int ntrees,
               int nchecks)

Construct the factory the given number of trees and checks.

Parameters:

ntrees - the number of trees

nchecks - the number of checks during search

Method Detail

create

public IntNearestNeighboursKDTree create(int[][] data)

Description copied from interface: NearestNeighboursFactory

Create a NearestNeighbours object that works over the provided data.

Specified by:

create in interface NearestNeighboursFactory<IntNearestNeighboursKDTree,int[]>

Parameters:

data - the data

Returns:

the NearestNeighbours object