/usr/include/vigra/visit_border.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 | /************************************************************************/
/* */
/* Copyright 2013-2014 by Martin Bidlingmaier and Ullrich Koethe */
/* */
/* 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_VISIT_BORDER_HXX
#define VIGRA_VISIT_BORDER_HXX
#include "multi_array.hxx"
namespace vigra
{
namespace visit_border_detail
{
template <unsigned int K>
struct visit_border_impl
{
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Shape, class Visitor>
static void exec(const MultiArrayView<N, Data, S1>& u_data, MultiArrayView<N, Label, S2> u_labels,
const MultiArrayView<N, Data, S1>& v_data, MultiArrayView<N, Label, S2> v_labels,
const Shape& block_difference, NeighborhoodType neighborhood, Visitor visitor)
{
static const unsigned int D = K - 1;
typedef visit_border_impl<D> next;
if(block_difference[D] == -1)
{
MultiArrayIndex last = v_data.shape(D) - 1;
next::exec(u_data.bindAt(D, 0), u_labels.bindAt(D, 0),
v_data.bindAt(D, last), v_labels.bindAt(D, last),
block_difference, neighborhood, visitor);
}
else if(block_difference[D] == 1)
{
MultiArrayIndex last = u_data.shape(D) - 1;
next::exec(u_data.bindAt(D, last), u_labels.bindAt(D, last),
v_data.bindAt(D, 0), v_labels.bindAt(D, 0),
block_difference, neighborhood, visitor);
}
else if(block_difference[D] == 0)
{
next::exec(u_data, u_labels, v_data, v_labels, block_difference, neighborhood, visitor);
}
else
{
vigra_precondition(false, "invalid block difference");
}
}
};
template <>
struct visit_border_impl<0>
{
template <class Data, class S1,
class Label, class S2,
class Shape, class Visitor>
static void exec(const MultiArrayView<0, Data, S1>& u_data, MultiArrayView<0, Label, S2> u_labels,
const MultiArrayView<0, Data, S1>& v_data, MultiArrayView<0, Label, S2> v_labels,
const Shape& block_difference, NeighborhoodType neighborhood, Visitor visitor)
{
visitor(u_data(0), u_labels(0), v_data(0), v_labels(0), block_difference);
}
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Shape, class Visitor>
static void exec(const MultiArrayView<N, Data, S1>& u_data, MultiArrayView<N, Label, S2> u_labels,
const MultiArrayView<N, Data, S1>& v_data, MultiArrayView<N, Label, S2> v_labels,
const Shape& block_difference, NeighborhoodType neighborhood, Visitor visitor)
{
if(neighborhood == DirectNeighborhood)
{
typedef typename MultiArrayView<N, Data, S1>::const_iterator DataIterator;
typedef typename MultiArrayView<N, Label, S2>::iterator LabelsIterator;
DataIterator u_data_it = u_data.begin();
LabelsIterator u_labels_it = u_labels.begin();
DataIterator v_data_it = v_data.begin();
LabelsIterator v_labels_it = v_labels.begin();
for( ; u_data_it != u_data.end(); ++u_data_it, ++u_labels_it, ++v_data_it, ++v_labels_it)
{
visitor(*u_data_it, *u_labels_it, *v_data_it, *v_labels_it, block_difference);
}
}
else if(neighborhood == IndirectNeighborhood)
{
typedef GridGraph<N, undirected_tag> Graph;
typedef typename Graph::NodeIt GraphScanner;
typedef typename Graph::OutArcIt NeighborIterator;
static const int global_dim_number = Shape::static_size;
TinyVector<unsigned int, N> dim_mapping; // mapping of every local dimension to their actual global dimension indices
int local_dims_pos = 0;
int global_dims_pos = 0;
for( ; global_dims_pos != global_dim_number; ++global_dims_pos)
{
if(block_difference[global_dims_pos] == 0)
{
vigra_assert(local_dims_pos != N, "");
dim_mapping[local_dims_pos] = global_dims_pos;
++local_dims_pos;
}
}
vigra_assert(local_dims_pos == N, "");
Graph graph(u_data.shape(), neighborhood);
Shape pixel_difference = block_difference;
for(GraphScanner node(graph); node != lemon::INVALID; ++node)
{
// compare neighbors that have have equal coordinates in all unbound dimensions
// their pixel-level difference is exactly block_difference
visitor(u_data[*node], u_labels[*node], v_data[*node], v_labels[*node], block_difference);
// now let unbound dimensions vary
for(NeighborIterator arc(graph, *node); arc != lemon::INVALID; ++arc)
{
for(int i = 0; i != N; ++i)
pixel_difference[dim_mapping[i]] = graph.target(*arc)[i] - (*node)[i];
visitor(u_data[*node], u_labels[*node], v_data[graph.target(*arc)], v_labels[graph.target(*arc)], pixel_difference);
}
}
}
}
};
} // namespace visit_border_detail
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Shape, class Visitor>
inline void
visitBorder(const MultiArrayView<N, Data, S1>& u_data, MultiArrayView<N, Label, S2> u_labels,
const MultiArrayView<N, Data, S1>& v_data, MultiArrayView<N, Label, S2> v_labels,
const Shape& difference, NeighborhoodType neighborhood, Visitor visitor)
{
vigra_precondition(u_data.shape() == u_labels.shape() && v_data.shape() == v_labels.shape(),
"differing block shapes");
visit_border_detail::visit_border_impl<N>::exec(u_data, u_labels,
v_data, v_labels,
difference, neighborhood, visitor);
}
} // namespace vigra
#endif // VIGRA_VISIT_BORDER_HXX
|