![]() |
GURLS++
2.0.00
C++ Implementation of GURLS Matlab Toolbox
|
00001 /* 00002 * The GURLS Package in C++ 00003 * 00004 * Copyright (C) 2011-1013, IIT@MIT Lab 00005 * All rights reserved. 00006 * 00007 * authors: M. Santoro 00008 * email: msantoro@mit.edu 00009 * website: http://cbcl.mit.edu/IIT@MIT/IIT@MIT.html 00010 * 00011 * Redistribution and use in source and binary forms, with or without 00012 * modification, are permitted provided that the following conditions 00013 * are met: 00014 * 00015 * * Redistributions of source code must retain the above 00016 * copyright notice, this list of conditions and the following 00017 * disclaimer. 00018 * * Redistributions in binary form must reproduce the above 00019 * copyright notice, this list of conditions and the following 00020 * disclaimer in the documentation and/or other materials 00021 * provided with the distribution. 00022 * * Neither the name(s) of the copyright holders nor the names 00023 * of its contributors or of the Massacusetts Institute of 00024 * Technology or of the Italian Institute of Technology may be 00025 * used to endorse or promote products derived from this software 00026 * without specific prior written permission. 00027 * 00028 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00029 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00030 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00031 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00032 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00033 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00034 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00035 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00036 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00037 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00038 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00039 * POSSIBILITY OF SUCH DAMAGE. 00040 */ 00041 00042 00043 #ifndef _GURLS_CONFMAXSCORE_H_ 00044 #define _GURLS_CONFMAXSCORE_H_ 00045 00046 00047 #include "gurls++/confidence.h" 00048 #include "gurls++/gmath.h" 00049 00050 namespace gurls { 00051 00057 template <typename T> 00058 class ConfMaxScore: public Confidence<T> 00059 { 00060 public: 00073 GurlsOptionsList* execute(const gMat2D<T>& X, const gMat2D<T>& Y, const GurlsOptionsList& opt) throw(gException); 00074 }; 00075 00076 template<typename T> 00077 GurlsOptionsList *ConfMaxScore<T>::execute(const gMat2D<T>& /*X*/, const gMat2D<T>& /*Y*/, const GurlsOptionsList &opt) throw(gException) 00078 { 00079 // out = struct; 00080 // [n,k] = size(opt.pred); 00081 const gMat2D<T> &pred = opt.getOptValue<OptMatrix<gMat2D<T> > >("pred"); 00082 00083 const unsigned long n = pred.rows(); 00084 const unsigned long t = pred.cols(); 00085 00086 const T* expscores = pred.getData(); 00087 00088 // out = struct; 00089 // [out.confidence, out.labels] = max(opt.pred,[],2); 00090 00091 gMat2D<T> *conf = new gMat2D<T>(n,1); 00092 T* confidence = conf->getData(); 00093 00094 gMat2D<T> *lab = new gMat2D<T>(n,1); 00095 T* labels = lab->getData(); 00096 00097 T* rowT = new T[t]; 00098 for(unsigned long i=0; i<n; ++i) 00099 { 00100 getRow(expscores, n, t, i, rowT); 00101 00102 int index = static_cast<int>(std::max_element(rowT, rowT+t) - rowT); 00103 confidence[i] = rowT[index]; 00104 labels[i] = index+1; 00105 } 00106 00107 delete [] rowT; 00108 00109 GurlsOptionsList* ret = new GurlsOptionsList("confidence"); 00110 00111 ret->addOpt("confidence", new OptMatrix<gMat2D<T> >(*conf)); 00112 ret->addOpt("labels", new OptMatrix<gMat2D<T> >(*lab)); 00113 00114 return ret; 00115 } 00116 00117 } 00118 00119 #endif //_GURLS_CONFMAXSCORE_H_