NearestNeighbor.h
Go to the documentation of this file.
00001 // ****************************************************************************
00002 // This file is part of the Integrating Vision Toolkit (IVT).
00003 //
00004 // The IVT is maintained by the Karlsruhe Institute of Technology (KIT)
00005 // (www.kit.edu) in cooperation with the company Keyetech (www.keyetech.de).
00006 //
00007 // Copyright (C) 2014 Karlsruhe Institute of Technology (KIT).
00008 // All rights reserved.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are met:
00012 //
00013 // 1. Redistributions of source code must retain the above copyright
00014 //    notice, this list of conditions and the following disclaimer.
00015 //
00016 // 2. Redistributions in binary form must reproduce the above copyright
00017 //    notice, this list of conditions and the following disclaimer in the
00018 //    documentation and/or other materials provided with the distribution.
00019 //
00020 // 3. Neither the name of the KIT nor the names of its contributors may be
00021 //    used to endorse or promote products derived from this software
00022 //    without specific prior written permission.
00023 //
00024 // THIS SOFTWARE IS PROVIDED BY THE KIT AND CONTRIBUTORS “AS IS” AND ANY
00025 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
00026 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
00027 // DISCLAIMED. IN NO EVENT SHALL THE KIT OR CONTRIBUTORS BE LIABLE FOR ANY
00028 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
00029 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00030 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
00031 // ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00032 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
00033 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00034 // ****************************************************************************
00035 // ****************************************************************************
00036 // Filename:  NearestNeighbor.h
00037 // Author:    Pedram Azad
00038 // Date:      06.10.2009
00039 // ****************************************************************************
00040 
00044 #ifndef _NEAREST_NEIGHBOR_H_
00045 #define _NEAREST_NEIGHBOR_H_
00046 
00047 
00048 // ****************************************************************************
00049 // Necessary includes
00050 // ****************************************************************************
00051 
00052 #include "Interfaces/ClassificatorInterface.h"
00053 
00054 
00055 // ****************************************************************************
00056 // Forward declarations
00057 // ****************************************************************************
00058 
00059 class CKdTree;
00060 
00061 
00062 
00063 // ****************************************************************************
00064 // CNearestNeighbor
00065 // ****************************************************************************
00066 
00071 class CNearestNeighbor : public CClassificatorInterface
00072 {
00073 public:
00074         enum ComputationMethod
00075         {
00076                 eBruteForce,
00077                 eKdTree,
00078                 eBruteForceGPU
00079         };
00080         
00081         // constructor
00082         CNearestNeighbor(ComputationMethod method);
00083         
00084         // destructor
00085         ~CNearestNeighbor();
00086         
00087         
00088         // public methods
00089         void SetKdTreeMaxLeaves(int nKdTreeMaxLeaves) { m_nKdTreeMaxLeaves = nKdTreeMaxLeaves; }
00090         bool Train(const float *pData, int nDimension, int nDataSets);
00091         int Classify(const float *pQuery, int nDimension, float &fResultError);
00092         bool Classify(const float *pQueries, int nDimension, int nQueries, int *pResults, float *pResultErrors);
00093 
00094 
00095 private:
00096         // private attributes
00097         int m_nDimension;
00098         int m_nDataSets;
00099         float *m_pData;
00100         CKdTree *m_pKdTree;
00101         int m_nKdTreeMaxLeaves;
00102         bool m_bTrained;
00103         ComputationMethod m_method;
00104 };
00105 
00106 
00107 
00108 #endif /* _NEAREST_NEIGHBOR_H_ */


asr_ivt
Author(s): Allgeyer Tobias, Hutmacher Robin, Kleinert Daniel, Meißner Pascal, Scholz Jonas, Stöckle Patrick
autogenerated on Thu Jun 6 2019 21:46:57