Package org.opencv.ml
Class KNearest
java.lang.Object
org.opencv.core.Algorithm
org.opencv.ml.StatModel
org.opencv.ml.KNearest
public class KNearest extends StatModel
The class implements K-Nearest Neighbors model
SEE: REF: ml_intro_knn
-
Field Summary
Fields Modifier and Type Field Description static intBRUTE_FORCEstatic intKDTREEFields inherited from class org.opencv.ml.StatModel
COMPRESSED_INPUT, PREPROCESSED_INPUT, RAW_OUTPUT, UPDATE_MODEL -
Constructor Summary
Constructors Modifier Constructor Description protectedKNearest(long addr) -
Method Summary
Modifier and Type Method Description static KNearest__fromPtr__(long addr)static KNearestcreate()Creates the empty model The static method creates empty %KNearest classifier.protected voidfinalize()floatfindNearest(Mat samples, int k, Mat results)Finds the neighbors and predicts responses for input vectors.floatfindNearest(Mat samples, int k, Mat results, Mat neighborResponses)Finds the neighbors and predicts responses for input vectors.floatfindNearest(Mat samples, int k, Mat results, Mat neighborResponses, Mat dist)Finds the neighbors and predicts responses for input vectors.intgetAlgorithmType()SEE: setAlgorithmTypeintgetDefaultK()SEE: setDefaultKintgetEmax()SEE: setEmaxbooleangetIsClassifier()SEE: setIsClassifierstatic KNearestload(String filepath)Loads and creates a serialized knearest from a file Use KNearest::save to serialize and store an KNearest to disk.voidsetAlgorithmType(int val)getAlgorithmType SEE: getAlgorithmTypevoidsetDefaultK(int val)getDefaultK SEE: getDefaultKvoidsetEmax(int val)getEmax SEE: getEmaxvoidsetIsClassifier(boolean val)getIsClassifier SEE: getIsClassifierMethods inherited from class org.opencv.ml.StatModel
calcError, empty, getVarCount, isClassifier, isTrained, predict, predict, predict, train, train, trainMethods inherited from class org.opencv.core.Algorithm
clear, getDefaultName, getNativeObjAddr, save
-
Field Details
-
BRUTE_FORCE
- See Also:
- Constant Field Values
-
KDTREE
- See Also:
- Constant Field Values
-
-
Constructor Details
-
Method Details
-
__fromPtr__
-
getDefaultK
SEE: setDefaultK- Returns:
- automatically generated
-
setDefaultK
getDefaultK SEE: getDefaultK- Parameters:
val- automatically generated
-
getIsClassifier
SEE: setIsClassifier- Returns:
- automatically generated
-
setIsClassifier
getIsClassifier SEE: getIsClassifier- Parameters:
val- automatically generated
-
getEmax
SEE: setEmax- Returns:
- automatically generated
-
setEmax
getEmax SEE: getEmax- Parameters:
val- automatically generated
-
getAlgorithmType
SEE: setAlgorithmType- Returns:
- automatically generated
-
setAlgorithmType
getAlgorithmType SEE: getAlgorithmType- Parameters:
val- automatically generated
-
findNearest
Finds the neighbors and predicts responses for input vectors.- Parameters:
samples- Input samples stored by rows. It is a single-precision floating-point matrix of<number_of_samples> * ksize.k- Number of used nearest neighbors. Should be greater than 1.results- Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with<number_of_samples>elements.neighborResponses- Optional output values for corresponding neighbors. It is a single- precision floating-point matrix of<number_of_samples> * ksize.dist- Optional output distances from the input vectors to the corresponding neighbors. It is a single-precision floating-point matrix of<number_of_samples> * ksize. For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting. For each input vector, the neighbors are sorted by their distances to the vector. In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself. If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method. The function is parallelized with the TBB library.- Returns:
- automatically generated
-
findNearest
Finds the neighbors and predicts responses for input vectors.- Parameters:
samples- Input samples stored by rows. It is a single-precision floating-point matrix of<number_of_samples> * ksize.k- Number of used nearest neighbors. Should be greater than 1.results- Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with<number_of_samples>elements.neighborResponses- Optional output values for corresponding neighbors. It is a single- precision floating-point matrix of<number_of_samples> * ksize. is a single-precision floating-point matrix of<number_of_samples> * ksize. For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting. For each input vector, the neighbors are sorted by their distances to the vector. In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself. If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method. The function is parallelized with the TBB library.- Returns:
- automatically generated
-
findNearest
Finds the neighbors and predicts responses for input vectors.- Parameters:
samples- Input samples stored by rows. It is a single-precision floating-point matrix of<number_of_samples> * ksize.k- Number of used nearest neighbors. Should be greater than 1.results- Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with<number_of_samples>elements. precision floating-point matrix of<number_of_samples> * ksize. is a single-precision floating-point matrix of<number_of_samples> * ksize. For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting. For each input vector, the neighbors are sorted by their distances to the vector. In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself. If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method. The function is parallelized with the TBB library.- Returns:
- automatically generated
-
create
Creates the empty model The static method creates empty %KNearest classifier. It should be then trained using StatModel::train method.- Returns:
- automatically generated
-
load
Loads and creates a serialized knearest from a file Use KNearest::save to serialize and store an KNearest to disk. Load the KNearest from this file again, by calling this function with the path to the file.- Parameters:
filepath- path to serialized KNearest- Returns:
- automatically generated
-
finalize
-