/usr/include/vigra/random_forest/rf_region.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-2+b5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 | /************************************************************************/
/* */
/* Copyright 2008-2009 by Ullrich Koethe and Rahul Nair */
/* */
/* This file is part of the VIGRA computer vision library. */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_RANDOM_FOREST_REGION_HXX
#define VIGRA_RANDOM_FOREST_REGION_HXX
#include <algorithm>
#include <map>
#include <numeric>
#include "vigra/mathutil.hxx"
#include "vigra/array_vector.hxx"
#include "vigra/sized_int.hxx"
#include "vigra/matrix.hxx"
#include "vigra/random.hxx"
#include "vigra/functorexpression.hxx"
namespace vigra
{
/** Standard Stackentry used to Build a Tree. Contains Information
* About the current region being split
*/
template <class Iter>
class DT_StackEntry
{
public:
typedef Iter IndexIterator;
// tree specific stuff
enum ParentTag
{
DecisionTreeNoParent = -1
};
/** Address of left and Right parent in the topology container
*/
Int32 leftParent;
Int32 rightParent;
/** rule associated with current node
*/
ArrayVector<std::pair<Int32, double> > rule;
// RegionSpecificStuff
ArrayVector<double> classCounts_;
ArrayVector<double> weightedClassCounts_;
bool classCountsIsValid;
bool weightedClassCountsIsValid;
IndexIterator begin_, end_;
int size_;
IndexIterator oob_begin_, oob_end_;
int oob_size_;
Int32 depth()
{
return rule.size();
}
void setRange(IndexIterator s, IndexIterator e)
{
begin_ = s;
end_ = e;
size_ = e-s;
}
void set_oob_range(IndexIterator s, IndexIterator e)
{
oob_begin_ = s;
oob_end_ = e;
oob_size_ = e-s;
}
void reset()
{
begin_ = end_ = IndexIterator();
oob_begin_ = oob_end_ = IndexIterator();
size_ = oob_size_ = 0;
leftParent = DecisionTreeNoParent;
rightParent = DecisionTreeNoParent;
classCountsIsValid = false;
}
bool isPure()
{
int num = 0;
for(int ii = 0; ii < static_cast<int>(classCounts().size()); ++ii)
{
num += classCounts()[ii] > 0;
}
return num <= 1;
}
int& operator[](int i)
{
return *(begin_+i);
}
IndexIterator & begin()
{
return begin_;
}
IndexIterator & end()
{
return end_;
}
IndexIterator & oob_begin()
{
return oob_begin_;
}
IndexIterator & oob_end()
{
return oob_end_;
}
ArrayVector<double> & classCounts()
{
return classCounts_;
}
ArrayVector<double> & weightedClassCounts()
{
return classCounts_;
}
bool classCountsValid(bool u)
{
classCountsIsValid = u;
return classCountsIsValid;
}
void classCounts(ArrayVector<Int32> in);
DT_StackEntry( IndexIterator i, IndexIterator e,
int classCount,
Int32 lp = DecisionTreeNoParent,
Int32 rp = DecisionTreeNoParent)
:
leftParent(lp),
rightParent(rp),
classCounts_(classCount, 0u),
classCountsIsValid(false),
begin_(i),
end_(e),
size_(e-i)
{}
Int32 size()const
{
return size_;
}
Int32 oob_size()const
{
return oob_size_;
}
};
}
//namespace vigra
#endif // VIGRA_RANDOM_FOREST_REGION_HXX
|