/usr/include/vigra/blockwise_labeling.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-5ubuntu1.
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 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 | /************************************************************************/
/* */
/* 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_BLOCKWISE_LABELING_HXX
#define VIGRA_BLOCKWISE_LABELING_HXX
#include <algorithm>
#include "threadpool.hxx"
#include "counting_iterator.hxx"
#include "multi_gridgraph.hxx"
#include "multi_labeling.hxx"
#include "multi_blockwise.hxx"
#include "union_find.hxx"
#include "multi_array_chunked.hxx"
#include "metaprogramming.hxx"
#include "visit_border.hxx"
#include "blockify.hxx"
namespace vigra
{
/** \addtogroup Labeling
*/
//@{
/** Options object for labelMultiArrayBlockwise().
It is simply a subclass of both \ref vigra::LabelOptions
and \ref vigra::BlockwiseOptions. See there for
detailed documentation.
*/
class BlockwiseLabelOptions
: public LabelOptions
, public BlockwiseOptions
{
public:
typedef BlockwiseOptions::Shape Shape;
// reimplement setter functions to allow chaining
template <class T>
BlockwiseLabelOptions& ignoreBackgroundValue(const T& value)
{
LabelOptions::ignoreBackgroundValue(value);
return *this;
}
BlockwiseLabelOptions & neighborhood(NeighborhoodType n)
{
LabelOptions::neighborhood(n);
return *this;
}
BlockwiseLabelOptions & blockShape(const Shape & shape)
{
BlockwiseOptions::blockShape(shape);
return *this;
}
template <class T, int N>
BlockwiseLabelOptions & blockShape(const TinyVector<T, N> & shape)
{
BlockwiseOptions::blockShape(shape);
return *this;
}
BlockwiseLabelOptions & numThreads(const int n)
{
BlockwiseOptions::numThreads(n);
return *this;
}
};
namespace blockwise_labeling_detail
{
template <class Equal, class Label>
struct BorderVisitor
{
Label u_label_offset;
Label v_label_offset;
UnionFindArray<Label>* global_unions;
Equal* equal;
template <class Data, class Shape>
void operator()(const Data& u_data, Label& u_label, const Data& v_data, Label& v_label, const Shape& diff)
{
if(labeling_equality::callEqual(*equal, u_data, v_data, diff))
{
global_unions->makeUnion(u_label + u_label_offset, v_label + v_label_offset);
}
}
};
// needed by MSVC
template <class LabelBlocksIterator>
struct BlockwiseLabelingResult
{
typedef typename LabelBlocksIterator::value_type::value_type type;
};
template <class DataBlocksIterator, class LabelBlocksIterator,
class Equal, class Mapping>
typename BlockwiseLabelingResult<LabelBlocksIterator>::type
blockwiseLabeling(DataBlocksIterator data_blocks_begin, DataBlocksIterator data_blocks_end,
LabelBlocksIterator label_blocks_begin, LabelBlocksIterator label_blocks_end,
BlockwiseLabelOptions const & options,
Equal equal,
Mapping& mapping)
{
typedef typename LabelBlocksIterator::value_type::value_type Label;
typedef typename DataBlocksIterator::shape_type Shape;
Shape blocks_shape = data_blocks_begin.shape();
vigra_precondition(blocks_shape == label_blocks_begin.shape() &&
blocks_shape == mapping.shape(),
"shapes of blocks of blocks do not match");
static const unsigned int Dimensions = DataBlocksIterator::dimension + 1;
MultiArray<Dimensions, Label> label_offsets(label_blocks_begin.shape());
bool has_background = options.hasBackgroundValue();
// mapping stage: label each block and save number of labels assigned in blocks before the current block in label_offsets
Label unmerged_label_number;
{
DataBlocksIterator data_blocks_it = data_blocks_begin;
LabelBlocksIterator label_blocks_it = label_blocks_begin;
typename MultiArray<Dimensions, Label>::iterator offsets_it = label_offsets.begin();
Label current_offset = 0;
// a la OPENMP_PRAGMA FOR
auto d = std::distance(data_blocks_begin, data_blocks_end);
std::vector<Label> nSeg(d);
//std::vector<int> ids(d);
//std::iota(ids.begin(), ids.end(), 0 );
parallel_foreach(options.getNumThreads(), d,
[&](const int threadId, const uint64_t i){
Label resVal = labelMultiArray(data_blocks_it[i], label_blocks_it[i],
options, equal);
if(has_background) // FIXME: reversed condition?
++resVal;
nSeg[i] = resVal;
}
);
for(int i=0; i<d;++i){
offsets_it[i] = current_offset;
current_offset+=nSeg[i];
}
unmerged_label_number = current_offset;
if(!has_background)
++unmerged_label_number;
}
// reduce stage: merge adjacent labels if the region overlaps
UnionFindArray<Label> global_unions(unmerged_label_number);
if(has_background)
{
// merge all labels that refer to background
for(typename MultiArray<Dimensions, Label>::iterator offsets_it = label_offsets.begin();
offsets_it != label_offsets.end();
++offsets_it)
{
global_unions.makeUnion(0, *offsets_it);
}
}
typedef GridGraph<Dimensions, undirected_tag> Graph;
typedef typename Graph::edge_iterator EdgeIterator;
Graph blocks_graph(blocks_shape, options.getNeighborhood());
for(EdgeIterator it = blocks_graph.get_edge_iterator(); it != blocks_graph.get_edge_end_iterator(); ++it)
{
Shape u = blocks_graph.u(*it);
Shape v = blocks_graph.v(*it);
Shape difference = v - u;
BorderVisitor<Equal, Label> border_visitor;
border_visitor.u_label_offset = label_offsets[u];
border_visitor.v_label_offset = label_offsets[v];
border_visitor.global_unions = &global_unions;
border_visitor.equal = &equal;
visitBorder(data_blocks_begin[u], label_blocks_begin[u],
data_blocks_begin[v], label_blocks_begin[v],
difference, options.getNeighborhood(), border_visitor);
}
// fill mapping (local labels) -> (global labels)
Label last_label = global_unions.makeContiguous();
{
typename MultiArray<Dimensions, Label>::iterator offsets_it = label_offsets.begin();
Label offset = *offsets_it;
++offsets_it;
typename Mapping::iterator mapping_it = mapping.begin();
for( ; offsets_it != label_offsets.end(); ++offsets_it, ++mapping_it)
{
mapping_it->clear();
Label next_offset = *offsets_it;
if(has_background)
{
for(Label current_label = offset; current_label != next_offset; ++current_label)
{
mapping_it->push_back(global_unions.findLabel(current_label));
}
}
else
{
mapping_it->push_back(0); // local labels start at 1
for(Label current_label = offset + 1; current_label != next_offset + 1; ++current_label)
{
mapping_it->push_back(global_unions.findLabel(current_label));
}
}
offset = next_offset;
}
// last block:
// instead of next_offset, use last_label+1
mapping_it->clear();
if(has_background)
{
for(Label current_label = offset; current_label != unmerged_label_number; ++current_label)
{
mapping_it->push_back(global_unions.findLabel(current_label));
}
}
else
{
mapping_it->push_back(0);
for(Label current_label = offset + 1; current_label != unmerged_label_number; ++current_label)
{
mapping_it->push_back(global_unions.findLabel(current_label));
}
}
}
return last_label;
}
template <class LabelBlocksIterator, class MappingIterator>
void toGlobalLabels(LabelBlocksIterator label_blocks_begin, LabelBlocksIterator label_blocks_end,
MappingIterator mapping_begin, MappingIterator mapping_end)
{
typedef typename LabelBlocksIterator::value_type LabelBlock;
for( ; label_blocks_begin != label_blocks_end; ++label_blocks_begin, ++mapping_begin)
{
vigra_assert(mapping_begin != mapping_end, "");
for(typename LabelBlock::iterator labels_it = label_blocks_begin->begin();
labels_it != label_blocks_begin->end();
++labels_it)
{
vigra_assert(*labels_it < mapping_begin->size(), "");
*labels_it = (*mapping_begin)[*labels_it];
}
}
}
} // namespace blockwise_labeling_detail
/*************************************************************/
/* */
/* labelMultiArrayBlockwise */
/* */
/*************************************************************/
/** \brief Connected components labeling for MultiArrays and ChunkedArrays.
<b> Declarations:</b>
\code
namespace vigra {
// assign local labels and generate mapping (local labels) -> (global labels) for each chunk
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Equal, class S3>
Label labelMultiArrayBlockwise(const MultiArrayView<N, Data, S1>& data,
MultiArrayView<N, Label, S2> labels,
const BlockwiseLabelOptions& options,
Equal equal,
MultiArrayView<N, std::vector<Label>, S3>& mapping);
// assign local labels and generate mapping (local labels) -> (global labels) for each chunk
template <unsigned int N, class T, class S1,
class Label, class S2,
class EqualityFunctor>
Label labelMultiArrayBlockwise(const ChunkedArray<N, Data>& data,
ChunkedArray<N, Label>& labels,
const BlockwiseLabelOptions& options,
Equal equal,
MultiArrayView<N, std::vector<Label>, S3>& mapping);
// assign global labels
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Equal>
Label labelMultiArrayBlockwise(const MultiArrayView<N, Data, S1>& data,
MultiArrayView<N, Label, S2> labels,
const BlockwiseLabelOptions& options,
Equal equal);
// assign global labels
template <unsigned int N, class T, class S1,
class Label, class S2,
class EqualityFunctor = std::equal_to<T> >
Label labelMultiArrayBlockwise(const ChunkedArray<N, Data>& data,
ChunkedArray<N, Label>& labels,
const BlockwiseLabelOptions& options = BlockwiseLabelOptions(),
Equal equal = std::equal_to<T>());
}
\endcode
The resulting labeling is equivalent to a labeling by \ref labelMultiArray, that is, the connected components are the same but may have different ids.
\ref NeighborhoodType and background value (if any) can be specified with the LabelOptions object.
If the \a mapping parameter is provided, each chunk is labeled seperately and contiguously (starting at one, zero for background),
with \a mapping containing a mapping of local labels to global labels for each chunk.
Thus, the shape of 'mapping' has to be large enough to hold each chunk coordinate.
Return: the number of regions found (=largest global region label)
<b> Usage: </b>
<b>\#include </b> \<vigra/blockwise_labeling.hxx\><br>
Namespace: vigra
\code
Shape3 shape = Shape3(10);
Shape3 chunk_shape = Shape3(4);
ChunkedArrayLazy<3, int> data(shape, chunk_shape);
// fill data ...
ChunkedArrayLazy<3, size_t> labels(shape, chunk_shape);
MultiArray<3, std::vector<size_t> > mapping(Shape3(3)); // there are 3 chunks in each dimension
labelMultiArrayBlockwise(data, labels, LabelOptions().neighborhood(DirectNeighborhood).background(0),
std::equal_to<int>(), mapping);
// check out chunk in the middle
MultiArray<3, size_t> middle_chunk(Shape3(4));
labels.checkoutSubarray(Shape3(4), middle_chunk);
// print number of non-background labels assigned in middle_chunk
cout << mapping[Shape3(1)].size() << endl;
// get local label for voxel
// this may be the same value assigned to different component in another chunk
size_t local_label = middle_chunk[Shape3(2)];
// get global label for voxel
// if another voxel has the same label, they are in the same connected component albeit they may be in different chunks
size_t global_label = mapping[Shape3(1)][local_label
\endcode
*/
doxygen_overloaded_function(template <...> unsigned int labelMultiArrayBlockwise)
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Equal, class S3>
Label labelMultiArrayBlockwise(const MultiArrayView<N, Data, S1>& data,
MultiArrayView<N, Label, S2> labels,
const BlockwiseLabelOptions& options,
Equal equal,
MultiArrayView<N, std::vector<Label>, S3>& mapping)
{
using namespace blockwise_labeling_detail;
typedef typename MultiArrayShape<N>::type Shape;
Shape block_shape(options.getBlockShapeN<N>());
MultiArray<N, MultiArrayView<N, Data, S1> > data_blocks = blockify(data, block_shape);
MultiArray<N, MultiArrayView<N, Label, S2> > label_blocks = blockify(labels, block_shape);
return blockwiseLabeling(data_blocks.begin(), data_blocks.end(),
label_blocks.begin(), label_blocks.end(),
options, equal, mapping);
}
template <unsigned int N, class Data, class S1,
class Label, class S2,
class Equal>
Label labelMultiArrayBlockwise(const MultiArrayView<N, Data, S1>& data,
MultiArrayView<N, Label, S2> labels,
const BlockwiseLabelOptions& options,
Equal equal)
{
using namespace blockwise_labeling_detail;
typedef typename MultiArrayShape<N>::type Shape;
Shape block_shape(options.getBlockShapeN<N>());
MultiArray<N, MultiArrayView<N, Data, S1> > data_blocks = blockify(data, block_shape);
MultiArray<N, MultiArrayView<N, Label, S2> > label_blocks = blockify(labels, block_shape);
MultiArray<N, std::vector<Label> > mapping(data_blocks.shape());
Label last_label = blockwiseLabeling(data_blocks.begin(), data_blocks.end(),
label_blocks.begin(), label_blocks.end(),
options, equal, mapping);
// replace local labels by global labels
toGlobalLabels(label_blocks.begin(), label_blocks.end(), mapping.begin(), mapping.end());
return last_label;
}
template <unsigned int N, class Data, class S1,
class Label, class S2>
Label labelMultiArrayBlockwise(const MultiArrayView<N, Data, S1>& data,
MultiArrayView<N, Label, S2> labels,
const BlockwiseLabelOptions& options = BlockwiseLabelOptions())
{
return labelMultiArrayBlockwise(data, labels, options, std::equal_to<Data>());
}
template <unsigned int N, class Data, class Label, class Equal, class S3>
Label labelMultiArrayBlockwise(const ChunkedArray<N, Data>& data,
ChunkedArray<N, Label>& labels,
const BlockwiseLabelOptions& options,
Equal equal,
MultiArrayView<N, std::vector<Label>, S3> mapping)
{
using namespace blockwise_labeling_detail;
vigra_precondition(options.getBlockShape().size() == 0,
"labelMultiArrayBlockwise(ChunkedArray, ...): custom block shapes not supported "
"(always uses the array's chunk shape).");
typedef typename ChunkedArray<N, Data>::shape_type Shape;
typedef typename ChunkedArray<N, Data>::chunk_const_iterator DataChunkIterator;
typedef typename ChunkedArray<N, Label>::chunk_iterator LabelChunkIterator;
DataChunkIterator data_chunks_begin = data.chunk_begin(Shape(0), data.shape());
LabelChunkIterator label_chunks_begin = labels.chunk_begin(Shape(0), labels.shape());
return blockwiseLabeling(data_chunks_begin, data_chunks_begin.getEndIterator(),
label_chunks_begin, label_chunks_begin.getEndIterator(),
options, equal, mapping);
}
template <unsigned int N, class Data, class Label, class Equal>
Label labelMultiArrayBlockwise(const ChunkedArray<N, Data>& data,
ChunkedArray<N, Label>& labels,
const BlockwiseLabelOptions& options,
Equal equal)
{
using namespace blockwise_labeling_detail;
MultiArray<N, std::vector<Label> > mapping(data.chunkArrayShape());
Label result = labelMultiArrayBlockwise(data, labels, options, equal, mapping);
typedef typename ChunkedArray<N, Data>::shape_type Shape;
toGlobalLabels(labels.chunk_begin(Shape(0), data.shape()), labels.chunk_end(Shape(0), data.shape()), mapping.begin(), mapping.end());
return result;
}
template <unsigned int N, class Data, class Label>
Label labelMultiArrayBlockwise(const ChunkedArray<N, Data>& data,
ChunkedArray<N, Label>& labels,
const BlockwiseLabelOptions& options = BlockwiseLabelOptions())
{
return labelMultiArrayBlockwise(data, labels, options, std::equal_to<Data>());
}
//@}
} // namespace vigra
#endif // VIGRA_BLOCKWISE_LABELING_HXX
|