/usr/include/vigra/multi_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 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 | /************************************************************************/
/* */
/* Copyright 2012-2013 by 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_MULTI_LABELING_HXX
#define VIGRA_MULTI_LABELING_HXX
#include "multi_array.hxx"
#include "multi_gridgraph.hxx"
#include "union_find.hxx"
#include "any.hxx"
namespace vigra{
namespace labeling_equality{
struct Yes
{
char d[100];
};
struct No
{
char d[1];
};
template <size_t>
struct SizeToType;
template <>
struct SizeToType<sizeof(Yes)>
{
typedef VigraTrueType type;
};
template <>
struct SizeToType<sizeof(No)>
{
typedef VigraFalseType type;
};
template <class Equal>
class TakesThreeArguments
{
public:
template <class T>
static Yes check(typename T::WithDiffTag*);
template <class T>
static No check(...);
typedef typename SizeToType<sizeof(check<Equal>(0))>::type type;
static const unsigned int value = type::asBool;
};
template <class Equal, class Data, class Shape>
bool callEqualImpl(Equal& equal, const Data& u_data, const Data& v_data, const Shape& diff, VigraTrueType)
{
return equal(u_data, v_data, diff);
}
template <class Equal, class Data, class Shape>
bool callEqualImpl(Equal& equal, const Data& u_data, const Data& v_data, const Shape& diff, VigraFalseType)
{
return equal(u_data, v_data);
}
template< class Equal, class Data, class Shape>
bool callEqual(Equal& equal, const Data& u_data, const Data& v_data, const Shape& diff)
{
return callEqualImpl(equal, u_data, v_data, diff, typename TakesThreeArguments<Equal>::type());
}
}
/** \addtogroup Labeling
*/
//@{
namespace lemon_graph {
template <class Graph, class T1Map, class T2Map, class Equal>
typename T2Map::value_type
labelGraph(Graph const & g,
T1Map const & data,
T2Map & labels,
Equal const & equal)
{
typedef typename Graph::NodeIt graph_scanner;
typedef typename Graph::OutBackArcIt neighbor_iterator;
typedef typename T2Map::value_type LabelType;
vigra::UnionFindArray<LabelType> regions;
// pass 1: find connected components
for (graph_scanner node(g); node != INVALID; ++node)
{
typename T1Map::value_type center = data[*node];
// define tentative label for current node
LabelType currentIndex = regions.nextFreeIndex();
for (neighbor_iterator arc(g, node); arc != INVALID; ++arc)
{
// merge regions if colors are equal
if(equal(center, data[g.target(*arc)]))
{
currentIndex = regions.makeUnion(labels[g.target(*arc)], currentIndex);
}
}
// set label of current node
labels[*node] = regions.finalizeIndex(currentIndex);
}
LabelType count = regions.makeContiguous();
// pass 2: make component labels contiguous
for (graph_scanner node(g); node != INVALID; ++node)
{
labels[*node] = regions.findLabel(labels[*node]);
}
return count;
}
template <unsigned int N, class DirectedTag, class T1Map, class T2Map, class Equal>
typename T2Map::value_type
labelGraph(GridGraph<N, DirectedTag> const & g,
T1Map const & data,
T2Map & labels,
Equal const & equal)
{
typedef GridGraph<N, DirectedTag> Graph;
typedef typename Graph::NodeIt graph_scanner;
typedef typename Graph::OutBackArcIt neighbor_iterator;
typedef typename T2Map::value_type LabelType;
typedef typename Graph::shape_type Shape;
vigra::UnionFindArray<LabelType> regions;
// pass 1: find connected components
for (graph_scanner node(g); node != INVALID; ++node)
{
typename T1Map::value_type center = data[*node];
// define tentative label for current node
LabelType currentIndex = regions.nextFreeIndex();
for (neighbor_iterator arc(g, node); arc != INVALID; ++arc)
{
Shape diff = g.neighborOffset(arc.neighborIndex());
// merge regions if colors are equal
if(labeling_equality::callEqual(equal, center, data[g.target(*arc)], diff))
{
currentIndex = regions.makeUnion(labels[g.target(*arc)], currentIndex);
}
}
// set label of current node
labels[*node] = regions.finalizeIndex(currentIndex);
}
LabelType count = regions.makeContiguous();
// pass 2: make component labels contiguous
for (graph_scanner node(g); node != INVALID; ++node)
{
labels[*node] = regions.findLabel(labels[*node]);
}
return count;
}
template <class Graph, class T1Map, class T2Map, class Equal>
typename T2Map::value_type
labelGraphWithBackground(Graph const & g,
T1Map const & data,
T2Map & labels,
typename T1Map::value_type backgroundValue,
Equal const & equal)
{
typedef typename Graph::NodeIt graph_scanner;
typedef typename Graph::OutBackArcIt neighbor_iterator;
typedef typename T2Map::value_type LabelType;
vigra::UnionFindArray<LabelType> regions;
// pass 1: find connected components
for (graph_scanner node(g); node != INVALID; ++node)
{
typename T1Map::value_type center = data[*node];
// background always gets label zero
if(equal(center, backgroundValue))
{
labels[*node] = 0;
continue;
}
// define tentative label for current node
LabelType currentIndex = regions.nextFreeIndex();
for (neighbor_iterator arc(g, node); arc != INVALID; ++arc)
{
// merge regions if colors are equal
if(equal(center, data[g.target(*arc)]))
{
currentIndex = regions.makeUnion(labels[g.target(*arc)], currentIndex);
}
}
// set label of current node
labels[*node] = regions.finalizeIndex(currentIndex);
}
LabelType count = regions.makeContiguous();
// pass 2: make component labels contiguous
for (graph_scanner node(g); node != INVALID; ++node)
{
labels[*node] = regions.findLabel(labels[*node]);
}
return count;
}
template <unsigned int N, class DirectedTag, class T1Map, class T2Map, class Equal>
typename T2Map::value_type
labelGraphWithBackground(GridGraph<N, DirectedTag> const & g,
T1Map const & data,
T2Map & labels,
typename T1Map::value_type backgroundValue,
Equal const & equal)
{
typedef GridGraph<N, DirectedTag> Graph;
typedef typename Graph::NodeIt graph_scanner;
typedef typename Graph::OutBackArcIt neighbor_iterator;
typedef typename T2Map::value_type LabelType;
typedef typename Graph::shape_type Shape;
vigra::UnionFindArray<LabelType> regions;
// pass 1: find connected components
for (graph_scanner node(g); node != INVALID; ++node)
{
typename T1Map::value_type center = data[*node];
// background always gets label zero
if(labeling_equality::callEqual(equal, center, backgroundValue, Shape()))
{
labels[*node] = 0;
continue;
}
// define tentative label for current node
LabelType currentIndex = regions.nextFreeIndex();
for (neighbor_iterator arc(g, node); arc != INVALID; ++arc)
{
// merge regions if colors are equal
Shape diff = g.neighborOffset(arc.neighborIndex());
if(labeling_equality::callEqual(equal, center, data[g.target(*arc)], diff))
{
currentIndex = regions.makeUnion(labels[g.target(*arc)], currentIndex);
}
}
// set label of current node
labels[*node] = regions.finalizeIndex(currentIndex);
}
LabelType count = regions.makeContiguous();
// pass 2: make component labels contiguous
for (graph_scanner node(g); node != INVALID; ++node)
{
labels[*node] = regions.findLabel(labels[*node]);
}
return count;
}
} // namespace lemon_graph
/** \brief Option object for labelMultiArray().
*/
class LabelOptions
{
Any background_value_;
NeighborhoodType neighborhood_;
public:
/** \brief Set default options.
*/
LabelOptions()
: neighborhood_(DirectNeighborhood)
{}
/** \brief Choose direct or indirect neighborhood.
Default: <tt>DirectNeighborhood</tt>
*/
LabelOptions & neighborhood(NeighborhoodType n)
{
neighborhood_ = n;
return *this;
}
/** \brief Query the neighborhood type (direct or indirect).
*/
NeighborhoodType getNeighborhood() const
{
return neighborhood_;
}
/** \brief Set background value.
If specified, labelMultiArray() will internally call
labelMultiArrayWithBackground() with the given value
considered as background and thus ignored. If no
background value is set, the array gets labeled completely.
Note that the type <tt>T</tt> must correspond to the element
type of the data array to be labeled.
Default: don't ignore any value.
*/
template <class T>
LabelOptions & ignoreBackgroundValue(T const & t)
{
background_value_ = t;
return *this;
}
/** \brief Check if some background value is to be ignored.
*/
bool hasBackgroundValue() const
{
return bool(background_value_);
}
/** \brief Get the background value to be ignored.
Throws an exception if the stored background value type
is incompatible to the data array's value type.
*/
template <class T>
T getBackgroundValue() const
{
if(background_value_.empty())
return T();
vigra_precondition(background_value_.template is_readable<T>(),
"LabelOptions::getBackgroundValue<T>(): stored background value is not convertible to T.");
return background_value_.template read<T>();
}
};
/********************************************************/
/* */
/* labelMultiArray */
/* */
/********************************************************/
/** \brief Find the connected components of a MultiArray with arbitrary many dimensions.
See also \ref labelMultiArrayBlockwise() for a parallel version of this algorithm.
By specifying a background value in the \ref vigra::LabelOptions, this function
can also realize the behavior of \ref labelMultiArrayWithBackground().
<b> Declaration:</b>
\code
namespace vigra {
// specify parameters directly
template <unsigned int N, class T, class S1,
class Label, class S2,
class EqualityFunctor = std::equal_to<T> >
Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood = DirectNeighborhood,
EqualityFunctor equal = std::equal_to<T>())
// specify parameters via LabelOptions
template <unsigned int N, class T, class S1,
class Label, class S2,
class Equal = std::equal<T> >
Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
LabelOptions const & options,
Equal equal = std::equal<T>());
}
\endcode
Connected components are defined as regions with uniform values.
Thus, the value type <tt>T</tt> of the input array \a data either
must be equality comparable, or an EqualityFunctor must be
provided that realizes the desired predicate. The destination
array's value type <tt>Label</tt> should be large enough to hold
the labels without overflow. Region numbers will form a consecutive
sequence starting at <b>one</b> and ending with the region number
returned by the function (inclusive).
Argument \a neighborhood specifies the type of connectivity used. It can
take the values <tt>DirectNeighborhood</tt> (which corresponds to
4-neighborhood in 2D and 6-neighborhood in 3D, default) or
<tt>IndirectNeighborhood</tt> (which corresponds to
8-neighborhood in 2D and 26-neighborhood in 3D).
Return: the highest region label used
<b> Usage:</b>
<b>\#include</b> \<vigra/multi_labeling.hxx\><br>
Namespace: vigra
\code
MultiArray<3,int> src(Shape3(w,h,d));
MultiArray<3,int> dest(Shape3(w,h,d));
// find 6-connected regions
int max_region_label = labelMultiArray(src, dest);
// find 26-connected regions
max_region_label = labelMultiArray(src, dest, IndirectNeighborhood);
// find 6-connected regions, ignore the background value 0
// (i.e. call labelMultiArrayWithBackground() internally)
max_region_label = labelMultiArray(src, dest,
LabelOptions().neighborhood(DirectNeighborhood)
.ignoreBackgroundValue(0));
\endcode
<b> Required Interface:</b>
\code
T t;
t == t // T is equality comparable
EqualityFunctor equal; // or a suitable functor is supplied
equal(t, t)
\endcode
*/
doxygen_overloaded_function(template <...> unsigned int labelMultiArray)
template <unsigned int N, class T, class S1,
class Label, class S2,
class Equal>
inline Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood,
Equal equal)
{
vigra_precondition(data.shape() == labels.shape(),
"labelMultiArray(): shape mismatch between input and output.");
GridGraph<N, undirected_tag> graph(data.shape(), neighborhood);
return lemon_graph::labelGraph(graph, data, labels, equal);
}
template <unsigned int N, class T, class S1,
class Label, class S2>
inline Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood = DirectNeighborhood)
{
return labelMultiArray(data, labels, neighborhood, std::equal_to<T>());
}
template <unsigned int N, class T, class S1,
class Label, class S2>
inline Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
LabelOptions const & options)
{
if(options.hasBackgroundValue())
return labelMultiArrayWithBackground(data, labels, options.getNeighborhood(),
options.template getBackgroundValue<T>());
else
return labelMultiArray(data, labels, options.getNeighborhood());
}
template <unsigned int N, class T, class S1,
class Label, class S2,
class Equal>
inline Label
labelMultiArray(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
LabelOptions const & options,
Equal equal)
{
if(options.hasBackgroundValue())
return labelMultiArrayWithBackground(data, labels, options.getNeighborhood(),
options.template getBackgroundValue<T>(),
equal);
else
return labelMultiArray(data, labels, options.getNeighborhood(), equal);
}
/********************************************************/
/* */
/* labelMultiArrayWithBackground */
/* */
/********************************************************/
/** \brief Find the connected components of a MultiArray with arbitrary many dimensions,
excluding the background from labeling.
From a user's point of view, this function is no longer needed because
\ref labelMultiArray() can realizes the same behavior when an appropriate
background value is specified in its \ref vigra::LabelOptions. Similarly,
\ref labelMultiArrayBlockwise() implements a parallel version of this algorithm.
<b> Declaration:</b>
\code
namespace vigra {
template <unsigned int N, class T, class S1,
class Label, class S2
class Equal = std::equal<T> >
Label
labelMultiArrayWithBackground(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood = DirectNeighborhood,
T backgroundValue = T(),
Equal equal = std::equal<T>());
}
\endcode
This function is the same as \ref labelMultiArray(), except for
the additional parameter \a backgroundValue. Points in the input
array \a data with this value (which default to zero) are ignored
during labeling, and their output label is automatically set to
zero. Region numbers will be a consecutive sequence starting at
zero (when background was present) or at one (when no background
was present) and ending with the region number returned by the
function (inclusive).
Return: the number of non-background regions found (= highest region label,
because background has label 0)
<b> Usage:</b>
<b>\#include</b> \<vigra/multi_labeling.hxx\><br>
Namespace: vigra
\code
MultiArray<3, int> src(Shape3(w,h,d));
MultiArray<3, int> dest(Shape3(w,h,d));
// find 6-connected regions, ignoring background value zero (the default)
int max_region_label = labelMultiArrayWithBackground(src, dest);
// find 26-connected regions, using -1 as the background value
max_region_label = labelMultiArrayWithBackground(src, dest, IndirectNeighborhood, -1);
\endcode
<b> Required Interface:</b>
\code
T t, backgroundValue;
t == backgroundValue // T is equality comparable
EqualityFunctor equal; // or a suitable functor is supplied
equal(t, backgroundValue)
\endcode
*/
doxygen_overloaded_function(template <...> unsigned int labelMultiArrayWithBackground)
template <unsigned int N, class T, class S1,
class Label, class S2,
class Equal>
inline Label
labelMultiArrayWithBackground(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood,
T backgroundValue,
Equal equal)
{
vigra_precondition(data.shape() == labels.shape(),
"labelMultiArrayWithBackground(): shape mismatch between input and output.");
GridGraph<N, undirected_tag> graph(data.shape(), neighborhood);
return lemon_graph::labelGraphWithBackground(graph, data, labels, backgroundValue, equal);
}
template <unsigned int N, class T, class S1,
class Label, class S2>
inline Label
labelMultiArrayWithBackground(MultiArrayView<N, T, S1> const & data,
MultiArrayView<N, Label, S2> labels,
NeighborhoodType neighborhood = DirectNeighborhood,
T backgroundValue = T())
{
return labelMultiArrayWithBackground(data, labels, neighborhood, backgroundValue, std::equal_to<T>());
}
//@}
} // namespace vigra
#endif //VIGRA_MULTI_LABELING_HXX
|