/usr/include/vigra/localminmax.hxx is in libvigraimpex-dev 1.7.1+dfsg1-2ubuntu4.
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 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 | /************************************************************************/
/* */
/* Copyright 1998-2002 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_LOCALMINMAX_HXX
#define VIGRA_LOCALMINMAX_HXX
#include <vector>
#include <functional>
#include "utilities.hxx"
#include "stdimage.hxx"
#include "initimage.hxx"
#include "labelimage.hxx"
#include "pixelneighborhood.hxx"
namespace vigra {
/** \addtogroup LocalMinMax Local Minima and Maxima
Detect local minima and maxima of the gray level,
including extremal plateaus larger than 1 pixel
*/
//@{
namespace detail {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue, class Neighborhood,
class Compare>
void
localMinMax(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker, Neighborhood,
Compare compare)
{
int w = slr.x - sul.x - 2;
int h = slr.y - sul.y - 2;
int i,x,y;
sul += Diff2D(1,1);
dul += Diff2D(1,1);
for(y=0; y<h; ++y, ++sul.y, ++dul.y)
{
SrcIterator sx = sul;
DestIterator dx = dul;
for(x=0; x<w; ++x, ++sx.x, ++dx.x)
{
typename SrcAccessor::value_type v = sa(sx);
NeighborhoodCirculator<SrcIterator, Neighborhood> sc(sx);
for(i = 0; i < Neighborhood::DirectionCount; ++i, ++sc)
{
if(!compare(v, sa(sc)))
break;
}
if(i == Neighborhood::DirectionCount)
da.set(marker, dx);
}
}
}
} // namespace detail
/********************************************************/
/* */
/* localMinima */
/* */
/********************************************************/
/** \brief Find local minima in an image.
The minima are found only when the have a size of one pixel.
Use \ref extendedLocalMinima() to find minimal plateaus. Minima are
marked in the destination image with the given marker value
(default is 1), all other destination pixels remain unchanged.
<TT>SrcAccessor::value_type</TT> must be less-comparable.
A pixel at the image border will never be marked as minimum.
Pass \ref vigra::EightNeighborCode or \ref vigra::FourNeighborCode
to determine the neighborhood where pixel values are compared.
The function uses accessors.
<b> Declarations:</b>
pass arguments explicitly:
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode>
void
localMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode())
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode>
void
localMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode())
}
\endcode
<b> Usage:</b>
<b>\#include</b> \<<a href="localminmax_8hxx-source.html">vigra/localminmax.hxx</a>\><br>
Namespace: vigra
\code
vigra::BImage src(w,h), minima(w,h);
// init destiniation image
minima = 0;
vigra::localMinima(srcImageRange(src), destImage(minima));
\endcode
<b> Required Interface:</b>
\code
SrcImageIterator src_upperleft, src_lowerright;
DestImageIterator dest_upperleft;
SrcAccessor src_accessor;
DestAccessor dest_accessor;
SrcAccessor::value_type u = src_accessor(src_upperleft);
u < u
DestValue marker;
dest_accessor.set(marker, dest_upperleft);
\endcode
*/
doxygen_overloaded_function(template <...> void localMinima)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue, class Neighborhood>
inline void
localMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker, Neighborhood neighborhood)
{
detail::localMinMax(sul, slr, sa, dul, da, marker, neighborhood,
std::less<typename SrcAccessor::value_type>());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
localMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker)
{
localMinima(sul, slr, sa, dul, da, marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
localMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da)
{
localMinima(sul, slr, sa, dul, da,
NumericTraits<typename DestAccessor::value_type>::one(),
EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue, class Neighborhood>
inline void
localMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood)
{
localMinima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
localMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker)
{
localMinima(src.first, src.second, src.third,
dest.first, dest.second, marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
localMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest)
{
localMinima(src.first, src.second, src.third,
dest.first, dest.second,
NumericTraits<typename DestAccessor::value_type>::one(),
EightNeighborCode());
}
/********************************************************/
/* */
/* localMaxima */
/* */
/********************************************************/
/** \brief Find local maxima in an image.
The maxima are found only when the have a size of one pixel.
Use \ref extendedLocalMaxima() to find maximal plateaus. Maxima are
marked in the destination image with the given marker value
(default is 1), all other destination pixels remain unchanged.
<TT>SrcAccessor::value_type</TT> must be less-comparable.
A pixel at the image border will never be marked as maximum.
The function uses accessors.
<b> Declarations:</b>
pass arguments explicitly:
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode>
void
localMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode())
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode>
void
localMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode())
}
\endcode
<b> Usage:</b>
<b>\#include</b> \<<a href="localminmax_8hxx-source.html">vigra/localminmax.hxx</a>\><br>
Namespace: vigra
\code
vigra::BImage src(w,h), maxima(w,h);
// init destiniation image
maxima = 0;
vigra::localMaxima(srcImageRange(src), destImage(maxima));
\endcode
<b> Required Interface:</b>
\code
SrcImageIterator src_upperleft, src_lowerright;
DestImageIterator dest_upperleft;
SrcAccessor src_accessor;
DestAccessor dest_accessor;
SrcAccessor::value_type u = src_accessor(src_upperleft);
u < u
DestValue marker;
dest_accessor.set(marker, dest_upperleft);
\endcode
*/
doxygen_overloaded_function(template <...> void localMaxima)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue, class Neighborhood>
inline void
localMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker, Neighborhood neighborhood)
{
detail::localMinMax(sul, slr, sa, dul, da, marker, neighborhood,
std::greater<typename SrcAccessor::value_type>());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
localMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker)
{
localMaxima(sul, slr, sa, dul, da, marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
localMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da)
{
localMaxima(sul, slr, sa, dul, da,
NumericTraits<typename DestAccessor::value_type>::one(),
EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue, class Neighborhood>
inline void
localMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood)
{
localMaxima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
localMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker)
{
localMaxima(src.first, src.second, src.third,
dest.first, dest.second, marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
localMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest)
{
localMaxima(src.first, src.second, src.third,
dest.first, dest.second,
NumericTraits<typename DestAccessor::value_type>::one(),
EightNeighborCode());
}
namespace detail {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood, class Compare, class Equal>
void
extendedLocalMinMax(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker,
Neighborhood /*neighborhood*/, Compare compare, Equal equal)
{
typedef typename SrcAccessor::value_type SrcType;
int w = slr.x - sul.x;
int h = slr.y - sul.y;
int i,x,y;
BasicImage<int> labels(w,h);
int number_of_regions =
labelImage(sul, slr, sa, labels.upperLeft(), labels.accessor(),
(Neighborhood::DirectionCount == 8), equal);
// assume that a region is a extremum until the opposite is proved
std::vector<unsigned char> isExtremum(number_of_regions+1, (unsigned char)1);
BasicImage<int>::traverser ly = labels.upperLeft();
for(y=0; y<h; ++y, ++sul.y, ++ly.y)
{
SrcIterator sx = sul;
BasicImage<int>::traverser lx(ly);
for(x=0; x<w; ++x, ++sx.x, ++lx.x)
{
int lab = *lx;
if(x == 0 || y == 0 || x == w-1 || y == h-1)
{
// mark all regions that touch the image border as non-extremum
isExtremum[lab] = 0;
continue;
}
SrcType v = sa(sx);
NeighborhoodCirculator<SrcIterator, Neighborhood> sc(sx);
NeighborhoodCirculator<BasicImage<int>::traverser, Neighborhood> lc(lx);
for(i=0; i<Neighborhood::DirectionCount; ++i, ++sc, ++lc)
{
if(lab != *lc && compare(sa(sc),v))
isExtremum[lab] = 0;
}
}
}
ly = labels.upperLeft();
for(y=0; y<h; ++y, ++dul.y, ++ly.y)
{
DestIterator xd = dul;
BasicImage<int>::Iterator lx(ly);
for(x=0; x<w; ++x, ++xd.x, ++lx.x)
{
if(isExtremum[*lx])
da.set(marker, xd);
}
}
}
} // namespace detail
/********************************************************/
/* */
/* extendedLocalMinima */
/* */
/********************************************************/
/** \brief Find local minimal regions in an image.
This function finds regions of uniform pixel value
whose neighboring regions are all have smaller values
(minimal plateaus of arbitrary size). By default, the pixels
in a plateau have exactly identical values. By passing an <tt>EqualityFunctor</tt>
with tolerance, one can allow for plateaus that are not quite constant
(this is often necessary with float pixel values). Pass
\ref vigra::EightNeighborCode or \ref vigra::FourNeighborCode
to determine the neighborhood where pixel values are compared.
Minimal regions are
marked in the destination image with the given marker value
(default is 1), all other destination pixels remain unchanged.
<TT>SrcAccessor::value_type</TT> must be equality-comparable and
less-comparable.
A pixel or region touching the image border will never be marked as minimum or
minimal plateau.
The function uses accessors.
<b> Declarations:</b>
pass arguments explicitly:
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode,
class EqualityFunctor = std::equal_to<typename SrcAssessor::value_type> >
void
extendedLocalMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode(),
EqualityFunctor equal = EqualityFunctor())
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode,
class EqualityFunctor = std::equal_to<typename SrcAssessor::value_type> >
void
extendedLocalMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode(),
EqualityFunctor equal = EqualityFunctor())
}
\endcode
<b> Usage:</b>
<b>\#include</b> \<<a href="localminmax_8hxx-source.html">vigra/localminmax.hxx</a>\><br>
Namespace: vigra
\code
// optional: define an equality functor
template <class T>
struct EqualWithToleranceFunctor
{
EqualWithToleranceFunctor(T tolerance)
: t(tolerance)
{}
bool operator()(T l, T r) const
{
return vigra::abs(l-r) <= t;
}
T t;
};
vigra::BImage src(w,h), minima(w,h);
// init destiniation image
minima.init(0);
vigra::extendedLocalMinima(srcImageRange(src), destImage(minima));
// allow plateaus with tolerance
minima.init(0);
vigra::extendedLocalMinima(srcImageRange(src), destImage(minima), 1.0,
EqualWithToleranceFunctor<unsigned char>(1));
\endcode
<b> Required Interface:</b>
\code
SrcImageIterator src_upperleft, src_lowerright;
DestImageIterator dest_upperleft;
SrcAccessor src_accessor;
DestAccessor dest_accessor;
SrcAccessor::value_type u = src_accessor(src_upperleft);
EqualityFunctor equal;
u == u
equal(u, u);
u < u
DestValue marker;
dest_accessor.set(marker, dest_upperleft);
\endcode
*/
doxygen_overloaded_function(template <...> void extendedLocalMinima)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood, class EqualityFunctor>
inline void
extendedLocalMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker,
Neighborhood neighborhood, EqualityFunctor equal)
{
typedef typename SrcAccessor::value_type SrcType;
detail::extendedLocalMinMax(sul, slr, sa, dul, da,
marker, neighborhood,
std::less<SrcType>(), equal);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood>
inline void
extendedLocalMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker,
Neighborhood neighborhood)
{
typedef typename SrcAccessor::value_type SrcType;
extendedLocalMinima(sul, slr, sa, dul, da,
marker, neighborhood, std::equal_to<SrcType>());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
extendedLocalMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker)
{
typedef typename SrcAccessor::value_type SrcType;
extendedLocalMinima(sul, slr, sa, dul, da,
marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
extendedLocalMinima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da)
{
extendedLocalMinima(sul, slr, sa, dul, da,
NumericTraits<typename DestAccessor::value_type>::one());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood, class EqualityFunctor>
inline void
extendedLocalMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood,
EqualityFunctor equal)
{
extendedLocalMinima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood, equal);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood>
inline void
extendedLocalMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood)
{
extendedLocalMinima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
extendedLocalMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker)
{
extendedLocalMinima(src.first, src.second, src.third,
dest.first, dest.second, marker);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
extendedLocalMinima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest)
{
extendedLocalMinima(src.first, src.second, src.third,
dest.first, dest.second);
}
/********************************************************/
/* */
/* extendedLocalMaxima */
/* */
/********************************************************/
/** \brief Find local maximal regions in an image.
This function finds regions of uniform pixel value
whose neighboring regions are all have smaller values
(maximal plateaus of arbitrary size). By default, the pixels
in a plateau have exactly identical values. By passing an <tt>EqualityFunctor</tt>
with tolerance, one can allow for plateaus that are not quite constant
(this is often necessary with float pixel values). Pass
\ref vigra::EightNeighborCode or \ref vigra::FourNeighborCode
to determine the neighborhood where pixel values are compared.
Maximal regions are
marked in the destination image with the given marker value
(default is 1), all other destination pixels remain unchanged.
<TT>SrcAccessor::value_type</TT> must be equality-comparable and
less-comparable.
A pixel or region touching the image border will never be marked as maximum or
maximal plateau.
The function uses accessors.
<b> Declarations:</b>
pass arguments explicitly:
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode,
class EqualityFunctor = std::equal_to<typename SrcAssessor::value_type> >
void
extendedLocalMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode(),
EqualityFunctor equal = EqualityFunctor())
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor,
class DestValue = DestAccessor::value_type,
class Neighborhood = EightNeighborCode,
class EqualityFunctor = std::equal_to<typename SrcAssessor::value_type> >
void
extendedLocalMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker = NumericTraits<DestValue>::one(),
Neighborhood neighborhood = EightNeighborCode(),
EqualityFunctor equal = EqualityFunctor())
}
\endcode
<b> Usage:</b>
<b>\#include</b> \<<a href="localminmax_8hxx-source.html">vigra/localminmax.hxx</a>\><br>
Namespace: vigra
\code
// optional: define an equality functor
template <class T>
struct EqualWithToleranceFunctor
{
EqualWithToleranceFunctor(T tolerance)
: t(tolerance)
{}
bool operator()(T l, T r) const
{
return vigra::abs(l-r) <= t;
}
T t;
};
vigra::BImage src(w,h), maxima(w,h);
// init destiniation image
maxima.init(0);
vigra::extendedLocalMaxima(srcImageRange(src), destImage(maxima));
// allow plateaus with tolerance
maxima.init(0);
vigra::extendedLocalMaxima(srcImageRange(src), destImage(maxima), 1.0,
EqualWithToleranceFunctor<unsigned char>(1));
\endcode
<b> Required Interface:</b>
\code
SrcImageIterator src_upperleft, src_lowerright;
DestImageIterator dest_upperleft;
SrcAccessor src_accessor;
DestAccessor dest_accessor;
SrcAccessor::value_type u = src_accessor(src_upperleft);
EqualityFunctor equal;
u == u
equal(u, u);
u < u
DestValue marker;
dest_accessor.set(marker, dest_upperleft);
\endcode
*/
doxygen_overloaded_function(template <...> void extendedLocalMaxima)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood, class EqualityFunctor>
inline void
extendedLocalMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker,
Neighborhood neighborhood, EqualityFunctor equal)
{
typedef typename SrcAccessor::value_type SrcType;
detail::extendedLocalMinMax(sul, slr, sa, dul, da,
marker, neighborhood,
std::greater<SrcType>(), equal);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood>
inline void
extendedLocalMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker,
Neighborhood neighborhood)
{
typedef typename SrcAccessor::value_type SrcType;
extendedLocalMaxima(sul, slr, sa, dul, da,
marker, neighborhood, std::equal_to<SrcType>());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
extendedLocalMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da, DestValue marker)
{
typedef typename SrcAccessor::value_type SrcType;
extendedLocalMaxima(sul, slr, sa, dul, da,
marker, EightNeighborCode());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
extendedLocalMaxima(SrcIterator sul, SrcIterator slr, SrcAccessor sa,
DestIterator dul, DestAccessor da)
{
extendedLocalMaxima(sul, slr, sa, dul, da,
NumericTraits<typename DestAccessor::value_type>::one());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood, class EqualityFunctor>
inline void
extendedLocalMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood,
EqualityFunctor equal)
{
extendedLocalMaxima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood, equal);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue,
class Neighborhood>
inline void
extendedLocalMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker, Neighborhood neighborhood)
{
extendedLocalMaxima(src.first, src.second, src.third,
dest.first, dest.second, marker, neighborhood);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor, class DestValue>
inline void
extendedLocalMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
DestValue marker)
{
extendedLocalMaxima(src.first, src.second, src.third,
dest.first, dest.second, marker);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
extendedLocalMaxima(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest)
{
extendedLocalMaxima(src.first, src.second, src.third,
dest.first, dest.second);
}
//@}
} // namespace vigra
#endif // VIGRA_LOCALMINMAX_HXX
|