![]() |
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_NORML2_H_ 00044 #define _GURLS_NORML2_H_ 00045 00046 00047 #include "gurls++/norm.h" 00048 #include "gurls++/gmath.h" 00049 #include "gurls++/optmatrix.h" 00050 00051 #include <limits> 00052 00053 namespace gurls { 00054 00060 template <typename T> 00061 class NormL2: public Norm<T> 00062 { 00063 public: 00071 GurlsOptionsList* execute(const gMat2D<T>& X, const gMat2D<T>& Y, const GurlsOptionsList& opt) throw(gException); 00072 }; 00073 00074 template<typename T> 00075 GurlsOptionsList* NormL2<T>::execute(const gMat2D<T>& X, const gMat2D<T>& /*Y*/, const GurlsOptionsList& /*opt*/) throw(gException) 00076 { 00077 const unsigned long m = X.rows(); 00078 const unsigned long n = X.cols(); 00079 00080 00081 gMat2D<T>* retX = new gMat2D<T>(m, n); 00082 copy(retX->getData(), X.getData(), retX->getSize()); 00083 T *rx_it = retX->getData(); 00084 00085 const T epsilon = std::numeric_limits<T>::epsilon(); 00086 const T one = (T)1.0; 00087 T norm2; 00088 00089 // for j = 1:size(X,1) 00090 for(unsigned long j=0; j<m; ++j, ++rx_it) 00091 { 00092 // X(j,:) = X(j,:)/(norm(X(j,:)) + eps); 00093 norm2 = nrm2(n, rx_it, m) + epsilon; 00094 scal(n, one/norm2, rx_it, m); 00095 } 00096 00097 GurlsOptionsList* norm = new GurlsOptionsList("norm"); 00098 norm->addOpt("X", new OptMatrix<gMat2D<T> >(*retX)); 00099 00100 return norm; 00101 } 00102 00103 } 00104 00105 #endif //_GURLS_NORML2_H_