/usr/include/vigra/noise_normalization.hxx is in libvigraimpex-dev 1.10.0+dfsg-3ubuntu2.
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 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 | /************************************************************************/
/* */
/* Copyright 1998-2006 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_NOISE_NORMALIZATION_HXX
#define VIGRA_NOISE_NORMALIZATION_HXX
#include "utilities.hxx"
#include "tinyvector.hxx"
#include "stdimage.hxx"
#include "transformimage.hxx"
#include "combineimages.hxx"
#include "localminmax.hxx"
#include "functorexpression.hxx"
#include "numerictraits.hxx"
#include "separableconvolution.hxx"
#include "linear_solve.hxx"
#include "array_vector.hxx"
#include "static_assert.hxx"
#include "multi_shape.hxx"
#include <algorithm>
namespace vigra {
/** \addtogroup NoiseNormalization Noise Normalization
Estimate noise with intensity-dependent variance and transform it into additive Gaussian noise.
*/
//@{
/********************************************************/
/* */
/* NoiseNormalizationOptions */
/* */
/********************************************************/
/** \brief Pass options to one of the noise normalization functions.
<tt>NoiseNormalizationOptions</tt> is an argument object that holds various optional
parameters used by the noise normalization functions. If a parameter is not explicitly
set, a suitable default will be used.
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
MultiArray<2, float> src(w,h);
std::vector<TinyVector<double, 2> > result;
...
noiseVarianceEstimation(src, result,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0));
\endcode
*/
class NoiseNormalizationOptions
{
public:
/** Initialize all options with default values.
*/
NoiseNormalizationOptions()
: window_radius(6),
cluster_count(10),
noise_estimation_quantile(1.5),
averaging_quantile(0.8),
noise_variance_initial_guess(10.0),
use_gradient(true)
{}
/** Select the noise estimation algorithm.
If \a r is <tt>true</tt>, use the gradient-based noise estimator according to Förstner (default).
Otherwise, use an algorithm that uses the intensity values directly.
*/
NoiseNormalizationOptions & useGradient(bool r)
{
use_gradient = r;
return *this;
}
/** Set the window radius for a single noise estimate.
Every window of the given size gives raise to one intensity/variance pair.<br>
Default: 6 pixels
*/
NoiseNormalizationOptions & windowRadius(unsigned int r)
{
vigra_precondition(r > 0,
"NoiseNormalizationOptions: window radius must be > 0.");
window_radius = r;
return *this;
}
/** Set the number of clusters for non-parametric noise normalization.
The intensity/variance pairs found are grouped into clusters before the noise
normalization transform is computed.<br>
Default: 10 clusters
*/
NoiseNormalizationOptions & clusterCount(unsigned int c)
{
vigra_precondition(c > 0,
"NoiseNormalizationOptions: cluster count must be > 0.");
cluster_count = c;
return *this;
}
/** Set the quantile for cluster averaging.
After clustering, the cluster center (i.e. average noise variance as a function of the average
intensity in the cluster) is computed using only the cluster members whose estimated variance
is below \a quantile times the maximum variance in the cluster.<br>
Default: 0.8<br>
Precondition: 0 < \a quantile <= 1.0
*/
NoiseNormalizationOptions & averagingQuantile(double quantile)
{
vigra_precondition(quantile > 0.0 && quantile <= 1.0,
"NoiseNormalizationOptions: averaging quantile must be between 0 and 1.");
averaging_quantile = quantile;
return *this;
}
/** Set the operating range of the robust noise estimator.
Intensity changes that are larger than \a quantile times the current estimate of the noise variance
are ignored by the robust noise estimator.<br>
Default: 1.5<br>
Precondition: 0 < \a quantile
*/
NoiseNormalizationOptions & noiseEstimationQuantile(double quantile)
{
vigra_precondition(quantile > 0.0,
"NoiseNormalizationOptions: noise estimation quantile must be > 0.");
noise_estimation_quantile = quantile;
return *this;
}
/** Set the initial estimate of the noise variance.
Robust noise variance estimation is an iterative procedure starting at the given value.<br>
Default: 10.0<br>
Precondition: 0 < \a guess
*/
NoiseNormalizationOptions & noiseVarianceInitialGuess(double guess)
{
vigra_precondition(guess > 0.0,
"NoiseNormalizationOptions: noise variance initial guess must be > 0.");
noise_variance_initial_guess = guess;
return *this;
}
unsigned int window_radius, cluster_count;
double noise_estimation_quantile, averaging_quantile, noise_variance_initial_guess;
bool use_gradient;
};
//@}
template <class ArgumentType, class ResultType>
class NonparametricNoiseNormalizationFunctor
{
struct Segment
{
double lower, a, b, shift;
};
ArrayVector<Segment> segments_;
template <class T>
double exec(unsigned int k, T t) const
{
if(segments_[k].a == 0.0)
{
return t / VIGRA_CSTD::sqrt(segments_[k].b);
}
else
{
return 2.0 / segments_[k].a * VIGRA_CSTD::sqrt(std::max(0.0, segments_[k].a * t + segments_[k].b));
}
}
public:
typedef ArgumentType argument_type;
typedef ResultType result_type;
template <class Vector>
NonparametricNoiseNormalizationFunctor(Vector const & clusters)
: segments_(clusters.size()-1)
{
for(unsigned int k = 0; k<segments_.size(); ++k)
{
segments_[k].lower = clusters[k][0];
segments_[k].a = (clusters[k+1][1] - clusters[k][1]) / (clusters[k+1][0] - clusters[k][0]);
segments_[k].b = clusters[k][1] - segments_[k].a * clusters[k][0];
// FIXME: set a to zero if it is very small
// - determine what 'very small' means
// - shouldn't the two formulas (for a == 0, a != 0) be equal in the limit a -> 0 ?
if(k == 0)
{
segments_[k].shift = segments_[k].lower - exec(k, segments_[k].lower);
}
else
{
segments_[k].shift = exec(k-1, segments_[k].lower) - exec(k, segments_[k].lower) + segments_[k-1].shift;
}
}
}
result_type operator()(argument_type t) const
{
// find the segment
unsigned int k = 0;
for(; k < segments_.size(); ++k)
if(t < segments_[k].lower)
break;
if(k > 0)
--k;
return detail::RequiresExplicitCast<ResultType>::cast(exec(k, t) + segments_[k].shift);
}
};
template <class ArgumentType, class ResultType>
class QuadraticNoiseNormalizationFunctor
{
double a, b, c, d, f, o;
void init(double ia, double ib, double ic, double xmin)
{
a = ia;
b = ib;
c = ic;
d = VIGRA_CSTD::sqrt(VIGRA_CSTD::fabs(c));
if(c > 0.0)
{
o = VIGRA_CSTD::log(VIGRA_CSTD::fabs((2.0*c*xmin + b)/d + 2*VIGRA_CSTD::sqrt(c*sq(xmin) +b*xmin + a)))/d;
f = 0.0;
}
else
{
f = VIGRA_CSTD::sqrt(b*b - 4.0*a*c);
o = -VIGRA_CSTD::asin((2.0*c*xmin+b)/f)/d;
}
}
public:
typedef ArgumentType argument_type;
typedef ResultType result_type;
template <class Vector>
QuadraticNoiseNormalizationFunctor(Vector const & clusters)
{
double xmin = NumericTraits<double>::max();
Matrix<double> m(3,3), r(3, 1), l(3, 1);
for(unsigned int k = 0; k<clusters.size(); ++k)
{
l(0,0) = 1.0;
l(1,0) = clusters[k][0];
l(2,0) = sq(clusters[k][0]);
m += outer(l);
r += clusters[k][1]*l;
if(clusters[k][0] < xmin)
xmin = clusters[k][0];
}
linearSolve(m, r, l);
init(l(0,0), l(1,0), l(2,0), xmin);
}
result_type operator()(argument_type t) const
{
double r;
if(c > 0.0)
r = VIGRA_CSTD::log(VIGRA_CSTD::fabs((2.0*c*t + b)/d + 2.0*VIGRA_CSTD::sqrt(c*t*t +b*t + a)))/d-o;
else
r = -VIGRA_CSTD::asin((2.0*c*t+b)/f)/d-o;
return detail::RequiresExplicitCast<ResultType>::cast(r);
}
};
template <class ArgumentType, class ResultType>
class LinearNoiseNormalizationFunctor
{
double a, b, o;
void init(double ia, double ib, double xmin)
{
a = ia;
b = ib;
if(b != 0.0)
{
o = xmin - 2.0 / b * VIGRA_CSTD::sqrt(a + b * xmin);
}
else
{
o = xmin - xmin / VIGRA_CSTD::sqrt(a);
}
}
public:
typedef ArgumentType argument_type;
typedef ResultType result_type;
template <class Vector>
LinearNoiseNormalizationFunctor(Vector const & clusters)
{
double xmin = NumericTraits<double>::max();
Matrix<double> m(2,2), r(2, 1), l(2, 1);
for(unsigned int k = 0; k<clusters.size(); ++k)
{
l(0,0) = 1.0;
l(1,0) = clusters[k][0];
m += outer(l);
r += clusters[k][1]*l;
if(clusters[k][0] < xmin)
xmin = clusters[k][0];
}
linearSolve(m, r, l);
init(l(0,0), l(1,0), xmin);
}
result_type operator()(argument_type t) const
{
double r;
if(b != 0.0)
r = 2.0 / b * VIGRA_CSTD::sqrt(a + b*t) + o;
else
r = t / VIGRA_CSTD::sqrt(a) + o;
return detail::RequiresExplicitCast<ResultType>::cast(r);
}
};
#define VIGRA_NoiseNormalizationFunctor(name, type, size) \
template <class ResultType> \
class name<type, ResultType> \
{ \
ResultType lut_[size]; \
\
public: \
typedef type argument_type; \
typedef ResultType result_type; \
\
template <class Vector> \
name(Vector const & clusters) \
{ \
name<double, ResultType> f(clusters); \
\
for(unsigned int k = 0; k < size; ++k) \
{ \
lut_[k] = f(k); \
} \
} \
\
result_type operator()(argument_type t) const \
{ \
return lut_[t]; \
} \
};
VIGRA_NoiseNormalizationFunctor(NonparametricNoiseNormalizationFunctor, UInt8, 256)
VIGRA_NoiseNormalizationFunctor(NonparametricNoiseNormalizationFunctor, UInt16, 65536)
VIGRA_NoiseNormalizationFunctor(QuadraticNoiseNormalizationFunctor, UInt8, 256)
VIGRA_NoiseNormalizationFunctor(QuadraticNoiseNormalizationFunctor, UInt16, 65536)
VIGRA_NoiseNormalizationFunctor(LinearNoiseNormalizationFunctor, UInt8, 256)
VIGRA_NoiseNormalizationFunctor(LinearNoiseNormalizationFunctor, UInt16, 65536)
#undef VIGRA_NoiseNormalizationFunctor
namespace detail {
template <class SrcIterator, class SrcAcessor,
class GradIterator>
bool
iterativeNoiseEstimationChi2(SrcIterator s, SrcAcessor src, GradIterator g,
double & mean, double & variance,
double robustnessThreshold, int windowRadius)
{
double l2 = sq(robustnessThreshold);
double countThreshold = 1.0 - VIGRA_CSTD::exp(-l2);
double f = (1.0 - VIGRA_CSTD::exp(-l2)) / (1.0 - (1.0 + l2)*VIGRA_CSTD::exp(-l2));
Diff2D ul(-windowRadius, -windowRadius);
int r2 = sq(windowRadius);
for(int iter=0; iter<100 ; ++iter) // maximum iteration 100 only for terminating
// if something is wrong
{
double sum=0.0;
double gsum=0.0;
unsigned int count = 0;
unsigned int tcount = 0;
SrcIterator siy = s + ul;
GradIterator giy = g + ul;
for(int y=-windowRadius; y <= windowRadius; y++, ++siy.y, ++giy.y)
{
typename SrcIterator::row_iterator six = siy.rowIterator();
typename GradIterator::row_iterator gix = giy.rowIterator();
for(int x=-windowRadius; x <= windowRadius; x++, ++six, ++gix)
{
if (sq(x) + sq(y) > r2)
continue;
++tcount;
if (*gix < l2*variance)
{
sum += src(six);
gsum += *gix;
++count;
}
}
}
if (count==0) // not homogeneous enough
return false;
double oldvariance = variance;
variance= f * gsum / count;
mean = sum / count;
if ( closeAtTolerance(oldvariance - variance, 0.0, 1e-10))
return (count >= tcount * countThreshold / 2.0); // sufficiently many valid points
}
return false; // no convergence
}
template <class SrcIterator, class SrcAcessor,
class GradIterator>
bool
iterativeNoiseEstimationGauss(SrcIterator s, SrcAcessor src, GradIterator,
double & mean, double & variance,
double robustnessThreshold, int windowRadius)
{
double l2 = sq(robustnessThreshold);
double countThreshold = erf(VIGRA_CSTD::sqrt(0.5 * l2));
double f = countThreshold / (countThreshold - VIGRA_CSTD::sqrt(2.0/M_PI*l2)*VIGRA_CSTD::exp(-l2/2.0));
mean = src(s);
Diff2D ul(-windowRadius, -windowRadius);
int r2 = sq(windowRadius);
for(int iter=0; iter<100 ; ++iter) // maximum iteration 100 only for terminating
// if something is wrong
{
double sum = 0.0;
double sum2 = 0.0;
unsigned int count = 0;
unsigned int tcount = 0;
SrcIterator siy = s + ul;
for(int y=-windowRadius; y <= windowRadius; y++, ++siy.y)
{
typename SrcIterator::row_iterator six = siy.rowIterator();
for(int x=-windowRadius; x <= windowRadius; x++, ++six)
{
if (sq(x) + sq(y) > r2)
continue;
++tcount;
if (sq(src(six) - mean) < l2*variance)
{
sum += src(six);
sum2 += sq(src(six));
++count;
}
}
}
if (count==0) // not homogeneous enough
return false;
double oldmean = mean;
double oldvariance = variance;
mean = sum / count;
variance= f * (sum2 / count - sq(mean));
if ( closeAtTolerance(oldmean - mean, 0.0, 1e-10) &&
closeAtTolerance(oldvariance - variance, 0.0, 1e-10))
return (count >= tcount * countThreshold / 2.0); // sufficiently many valid points
}
return false; // no convergence
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
symmetricDifferenceSquaredMagnitude(
SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest)
{
using namespace functor;
int w = slr.x - sul.x;
int h = slr.y - sul.y;
typedef typename NumericTraits<typename SrcAccessor::value_type>::RealPromote TmpType;
typedef BasicImage<TmpType> TmpImage;
Kernel1D<double> mask;
mask.initSymmetricGradient();
mask.setBorderTreatment(BORDER_TREATMENT_REFLECT);
TmpImage dx(w, h), dy(w, h);
separableConvolveX(srcIterRange(sul, slr, src), destImage(dx), kernel1d(mask));
separableConvolveY(srcIterRange(sul, slr, src), destImage(dy), kernel1d(mask));
combineTwoImages(srcImageRange(dx), srcImage(dy), destIter(dul, dest), Arg1()*Arg1() + Arg2()*Arg2());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
findHomogeneousRegionsFoerstner(
SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
unsigned int windowRadius = 6, double homogeneityThreshold = 40.0)
{
using namespace vigra::functor;
int w = slr.x - sul.x;
int h = slr.y - sul.y;
BImage btmp(w, h);
transformImage(srcIterRange(sul, slr, src), destImage(btmp),
ifThenElse(Arg1() <= Param(homogeneityThreshold), Param(1), Param(0)));
// Erosion
discErosion(srcImageRange(btmp), destIter(dul, dest), windowRadius);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
findHomogeneousRegions(
SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest)
{
localMinima(sul, slr, src, dul, dest);
}
template <class Vector1, class Vector2>
void noiseVarianceListMedianCut(Vector1 const & noise, Vector2 & clusters,
unsigned int maxClusterCount)
{
typedef typename Vector2::value_type Result;
clusters.push_back(Result(0, noise.size()));
while(clusters.size() <= maxClusterCount)
{
// find biggest cluster
unsigned int kMax = 0;
double diffMax = 0.0;
for(unsigned int k=0; k < clusters.size(); ++k)
{
int k1 = clusters[k][0], k2 = clusters[k][1]-1;
#if 0 // turned the "internal error" in a postcondition message
// for the most likely case
std::string message("noiseVarianceListMedianCut(): internal error (");
message += std::string("k: ") + asString(k) + ", ";
message += std::string("k1: ") + asString(k1) + ", ";
message += std::string("k2: ") + asString(k2) + ", ";
message += std::string("noise.size(): ") + asString(noise.size()) + ", ";
message += std::string("clusters.size(): ") + asString(clusters.size()) + ").";
vigra_invariant(k1 >= 0 && k1 < (int)noise.size() && k2 >= 0 && k2 < (int)noise.size(), message.c_str());
#endif
vigra_postcondition(k1 >= 0 && k1 < (int)noise.size() &&
k2 >= 0 && k2 < (int)noise.size(),
"noiseVarianceClustering(): Unable to find homogeneous regions.");
double diff = noise[k2][0] - noise[k1][0];
if(diff > diffMax)
{
diffMax = diff;
kMax = k;
}
}
if(diffMax == 0.0)
return; // all clusters have only one value
unsigned int k1 = clusters[kMax][0],
k2 = clusters[kMax][1];
unsigned int kSplit = k1 + (k2 - k1) / 2;
clusters[kMax][1] = kSplit;
clusters.push_back(Result(kSplit, k2));
}
}
struct SortNoiseByMean
{
template <class T>
bool operator()(T const & l, T const & r) const
{
return l[0] < r[0];
}
};
struct SortNoiseByVariance
{
template <class T>
bool operator()(T const & l, T const & r) const
{
return l[1] < r[1];
}
};
template <class Vector1, class Vector2, class Vector3>
void noiseVarianceClusterAveraging(Vector1 & noise, Vector2 & clusters,
Vector3 & result, double quantile)
{
typedef typename Vector1::iterator Iter;
typedef typename Vector3::value_type Result;
for(unsigned int k=0; k<clusters.size(); ++k)
{
Iter i1 = noise.begin() + clusters[k][0];
Iter i2 = noise.begin() + clusters[k][1];
std::sort(i1, i2, SortNoiseByVariance());
std::size_t size = static_cast<std::size_t>(VIGRA_CSTD::ceil(quantile*(i2 - i1)));
if(static_cast<std::size_t>(i2 - i1) < size)
size = i2 - i1;
if(size < 1)
size = 1;
i2 = i1 + size;
double mean = 0.0,
variance = 0.0;
for(; i1 < i2; ++i1)
{
mean += (*i1)[0];
variance += (*i1)[1];
}
result.push_back(Result(mean / size, variance / size));
}
}
template <class SrcIterator, class SrcAccessor, class BackInsertable>
void noiseVarianceEstimationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
BackInsertable & result,
NoiseNormalizationOptions const & options)
{
typedef typename BackInsertable::value_type ResultType;
unsigned int w = slr.x - sul.x;
unsigned int h = slr.y - sul.y;
typedef typename NumericTraits<typename SrcAccessor::value_type>::RealPromote TmpType;
typedef BasicImage<TmpType> TmpImage;
TmpImage gradient(w, h);
symmetricDifferenceSquaredMagnitude(sul, slr, src, gradient.upperLeft(), gradient.accessor());
BImage homogeneous(w, h);
findHomogeneousRegions(gradient.upperLeft(), gradient.lowerRight(), gradient.accessor(),
homogeneous.upperLeft(), homogeneous.accessor());
// Generate noise of each of the remaining pixels == centers of homogeneous areas (border is not used)
unsigned int windowRadius = options.window_radius;
for(unsigned int y=windowRadius; y<h-windowRadius; ++y)
{
for(unsigned int x=windowRadius; x<w-windowRadius; ++x)
{
if (! homogeneous(x, y))
continue;
Diff2D center(x, y);
double mean = 0.0, variance = options.noise_variance_initial_guess;
bool success;
if(options.use_gradient)
{
success = iterativeNoiseEstimationChi2(sul + center, src,
gradient.upperLeft() + center, mean, variance,
options.noise_estimation_quantile, windowRadius);
}
else
{
success = iterativeNoiseEstimationGauss(sul + center, src,
gradient.upperLeft() + center, mean, variance,
options.noise_estimation_quantile, windowRadius);
}
if (success)
{
result.push_back(ResultType(mean, variance));
}
}
}
}
template <class Vector, class BackInsertable>
void noiseVarianceClusteringImpl(Vector & noise, BackInsertable & result,
unsigned int clusterCount, double quantile)
{
std::sort(noise.begin(), noise.end(), detail::SortNoiseByMean());
ArrayVector<TinyVector<unsigned int, 2> > clusters;
detail::noiseVarianceListMedianCut(noise, clusters, clusterCount);
std::sort(clusters.begin(), clusters.end(), detail::SortNoiseByMean());
detail::noiseVarianceClusterAveraging(noise, clusters, result, quantile);
}
template <class Functor,
class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
noiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options)
{
ArrayVector<TinyVector<double, 2> > noiseData;
noiseVarianceEstimationImpl(sul, slr, src, noiseData, options);
if(noiseData.size() < 10)
return false;
ArrayVector<TinyVector<double, 2> > noiseClusters;
noiseVarianceClusteringImpl(noiseData, noiseClusters,
options.cluster_count, options.averaging_quantile);
transformImage(sul, slr, src, dul, dest, Functor(noiseClusters));
return true;
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
nonparametricNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraTrueType /* isScalar */)
{
typedef typename SrcAccessor::value_type SrcType;
typedef typename DestAccessor::value_type DestType;
return noiseNormalizationImpl<NonparametricNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, src, dul, dest, options);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
nonparametricNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraFalseType /* isScalar */)
{
int bands = src.size(sul);
for(int b=0; b<bands; ++b)
{
VectorElementAccessor<SrcAccessor> sband(b, src);
VectorElementAccessor<DestAccessor> dband(b, dest);
typedef typename VectorElementAccessor<SrcAccessor>::value_type SrcType;
typedef typename VectorElementAccessor<DestAccessor>::value_type DestType;
if(!noiseNormalizationImpl<NonparametricNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, sband, dul, dband, options))
return false;
}
return true;
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
quadraticNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraTrueType /* isScalar */)
{
typedef typename SrcAccessor::value_type SrcType;
typedef typename DestAccessor::value_type DestType;
return noiseNormalizationImpl<QuadraticNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, src, dul, dest, options);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
quadraticNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraFalseType /* isScalar */)
{
int bands = src.size(sul);
for(int b=0; b<bands; ++b)
{
VectorElementAccessor<SrcAccessor> sband(b, src);
VectorElementAccessor<DestAccessor> dband(b, dest);
typedef typename VectorElementAccessor<SrcAccessor>::value_type SrcType;
typedef typename VectorElementAccessor<DestAccessor>::value_type DestType;
if(!noiseNormalizationImpl<QuadraticNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, sband, dul, dband, options))
return false;
}
return true;
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
quadraticNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1, double a2,
VigraTrueType /* isScalar */)
{
ArrayVector<TinyVector<double, 2> > noiseClusters;
noiseClusters.push_back(TinyVector<double, 2>(0.0, a0));
noiseClusters.push_back(TinyVector<double, 2>(1.0, a0 + a1 + a2));
noiseClusters.push_back(TinyVector<double, 2>(2.0, a0 + 2.0*a1 + 4.0*a2));
transformImage(sul, slr, src, dul, dest,
QuadraticNoiseNormalizationFunctor<typename SrcAccessor::value_type,
typename DestAccessor::value_type>(noiseClusters));
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
quadraticNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1, double a2,
VigraFalseType /* isScalar */)
{
int bands = src.size(sul);
for(int b=0; b<bands; ++b)
{
VectorElementAccessor<SrcAccessor> sband(b, src);
VectorElementAccessor<DestAccessor> dband(b, dest);
quadraticNoiseNormalizationImpl(sul, slr, sband, dul, dband, a0, a1, a2, VigraTrueType());
}
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
linearNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraTrueType /* isScalar */)
{
typedef typename SrcAccessor::value_type SrcType;
typedef typename DestAccessor::value_type DestType;
return noiseNormalizationImpl<LinearNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, src, dul, dest, options);
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool
linearNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options,
VigraFalseType /* isScalar */)
{
int bands = src.size(sul);
for(int b=0; b<bands; ++b)
{
VectorElementAccessor<SrcAccessor> sband(b, src);
VectorElementAccessor<DestAccessor> dband(b, dest);
typedef typename VectorElementAccessor<SrcAccessor>::value_type SrcType;
typedef typename VectorElementAccessor<DestAccessor>::value_type DestType;
if(!noiseNormalizationImpl<LinearNoiseNormalizationFunctor<SrcType, DestType> >
(sul, slr, sband, dul, dband, options))
return false;
}
return true;
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
linearNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1,
VigraTrueType /* isScalar */)
{
ArrayVector<TinyVector<double, 2> > noiseClusters;
noiseClusters.push_back(TinyVector<double, 2>(0.0, a0));
noiseClusters.push_back(TinyVector<double, 2>(1.0, a0 + a1));
transformImage(sul, slr, src, dul, dest,
LinearNoiseNormalizationFunctor<typename SrcAccessor::value_type,
typename DestAccessor::value_type>(noiseClusters));
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void
linearNoiseNormalizationImpl(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1,
VigraFalseType /* isScalar */)
{
int bands = src.size(sul);
for(int b=0; b<bands; ++b)
{
VectorElementAccessor<SrcAccessor> sband(b, src);
VectorElementAccessor<DestAccessor> dband(b, dest);
linearNoiseNormalizationImpl(sul, slr, sband, dul, dband, a0, a1, VigraTrueType());
}
}
} // namespace detail
template <bool P>
struct noiseVarianceEstimation_can_only_work_on_scalar_images
: vigra::staticAssert::AssertBool<P>
{};
/** \addtogroup NoiseNormalization Noise Normalization
Estimate noise with intensity-dependent variance and transform it into additive Gaussian noise.
*/
//@{
/********************************************************/
/* */
/* noiseVarianceEstimation */
/* */
/********************************************************/
/** \brief Determine the noise variance as a function of the image intensity.
This operator applies an algorithm described in
W. Förstner: <i>"Image Preprocessing for Feature Extraction in Digital Intensity, Color and Range Images"</i>,
Proc. Summer School on Data Analysis and the Statistical Foundations of Geomatics,
Lecture Notes in Earth Science, Berlin: Springer, 1999
in order to estimate the noise variance as a function of the image intensity in a robust way,
i.e. so that intensity changes due to edges do not bias the estimate. The source value type
(<TT>SrcAccessor::value_type</TT>) must be a scalar type which is convertible to <tt>double</tt>.
The result is written into the \a result sequence, whose <tt>value_type</tt> must be constructible
from two <tt>double</tt> values. The following options can be set via the \a options object
(see \ref vigra::NoiseNormalizationOptions for details):<br><br>
<tt>useGradient</tt>, <tt>windowRadius</tt>, <tt>noiseEstimationQuantile</tt>, <tt>noiseVarianceInitialGuess</tt>
<b> Declarations:</b>
pass 2D array views:
\code
namespace vigra {
template <class T1, class S1, class BackInsertable>
void
noiseVarianceEstimation(MultiArrayView<2, T1, S1> const & src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedAPI{noiseVarianceEstimation}
pass \ref ImageIterators and \ref DataAccessors :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor, class BackInsertable>
void noiseVarianceEstimation(SrcIterator sul, SrcIterator slr, SrcAccessor src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor, class BackInsertable>
void noiseVarianceEstimation(triple<SrcIterator, SrcIterator, SrcAccessor> src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedEnd
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
MultiArray<2, float> src(w,h);
std::vector<TinyVector<double, 2> > result;
...
noiseVarianceEstimation(src, result,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0));
// print the intensity / variance pairs found
for(int k=0; k<result.size(); ++k)
std::cout << "Intensity: " << result[k][0] << ", estimated variance: " << result[k][1] << std::endl;
\endcode
\deprecatedUsage{noiseVarianceEstimation}
\code
vigra::BImage src(w,h);
std::vector<vigra::TinyVector<double, 2> > result;
...
vigra::noiseVarianceEstimation(srcImageRange(src), result,
vigra::NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0));
// print the intensity / variance pairs found
for(int k=0; k<result.size(); ++k)
std::cout << "Intensity: " << result[k][0] << ", estimated variance: " << result[k][1] << std::endl;
\endcode
<b> Required Interface:</b>
\code
SrcIterator upperleft, lowerright;
SrcAccessor src;
typedef SrcAccessor::value_type SrcType;
typedef NumericTraits<SrcType>::isScalar isScalar;
assert(isScalar::asBool == true);
double value = src(uperleft);
BackInsertable result;
typedef BackInsertable::value_type ResultType;
double intensity, variance;
result.push_back(ResultType(intensity, variance));
\endcode
\deprecatedEnd
*/
doxygen_overloaded_function(template <...> void noiseVarianceEstimation)
template <class SrcIterator, class SrcAccessor, class BackInsertable>
inline
void noiseVarianceEstimation(SrcIterator sul, SrcIterator slr, SrcAccessor src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
typedef typename SrcAccessor::value_type SrcType;
typedef typename NumericTraits<SrcType>::isScalar isScalar;
VIGRA_STATIC_ASSERT((
noiseVarianceEstimation_can_only_work_on_scalar_images<(isScalar::asBool)>));
detail::noiseVarianceEstimationImpl(sul, slr, src, result, options);
}
template <class SrcIterator, class SrcAccessor, class BackInsertable>
inline void
noiseVarianceEstimation(triple<SrcIterator, SrcIterator, SrcAccessor> src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
noiseVarianceEstimation(src.first, src.second, src.third, result, options);
}
template <class T1, class S1, class BackInsertable>
inline void
noiseVarianceEstimation(MultiArrayView<2, T1, S1> const & src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
noiseVarianceEstimation(srcImageRange(src), result, options);
}
/********************************************************/
/* */
/* noiseVarianceClustering */
/* */
/********************************************************/
/** \brief Determine the noise variance as a function of the image intensity and cluster the results.
This operator first calls \ref noiseVarianceEstimation() to obtain a sequence of intensity/variance pairs,
which are then clustered using the median cut algorithm. Then the cluster centers (i.e. average variance vs.
average intensity) are determined and returned in the \a result sequence.
In addition to the options valid for \ref noiseVarianceEstimation(), the following options can be set via
the \a options object (see \ref vigra::NoiseNormalizationOptions for details):<br><br>
<tt>clusterCount</tt>, <tt>averagingQuantile</tt>
<b> Declarations:</b>
pass 2D array views:
\code
namespace vigra {
template <class T1, class S1, class BackInsertable>
void
noiseVarianceClustering(MultiArrayView<2, T1, S1> const & src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedAPI{noiseVarianceClustering}
pass \ref ImageIterators and \ref DataAccessors :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor, class BackInsertable>
void noiseVarianceClustering(SrcIterator sul, SrcIterator slr, SrcAccessor src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor, class BackInsertable>
void noiseVarianceClustering(triple<SrcIterator, SrcIterator, SrcAccessor> src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedEnd
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
MultiArray<2, float> src(w,h);
std::vector<TinyVector<double, 2> > result;
...
noiseVarianceClustering(src, result,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
// print the intensity / variance pairs representing the cluster centers
for(int k=0; k<result.size(); ++k)
std::cout << "Cluster: " << k << ", intensity: " << result[k][0] << ", estimated variance: " << result[k][1] << std::endl;
\endcode
\deprecatedUsage{noiseVarianceClustering}
\code
vigra::BImage src(w,h);
std::vector<vigra::TinyVector<double, 2> > result;
...
vigra::noiseVarianceClustering(srcImageRange(src), result,
vigra::NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
// print the intensity / variance pairs representing the cluster centers
for(int k=0; k<result.size(); ++k)
std::cout << "Cluster: " << k << ", intensity: " << result[k][0] << ", estimated variance: " << result[k][1] << std::endl;
\endcode
<b> Required Interface:</b>
same as \ref noiseVarianceEstimation()
\deprecatedEnd
*/
doxygen_overloaded_function(template <...> void noiseVarianceClustering)
template <class SrcIterator, class SrcAccessor, class BackInsertable>
inline
void noiseVarianceClustering(SrcIterator sul, SrcIterator slr, SrcAccessor src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
ArrayVector<TinyVector<double, 2> > variance;
noiseVarianceEstimation(sul, slr, src, variance, options);
detail::noiseVarianceClusteringImpl(variance, result, options.cluster_count, options.averaging_quantile);
}
template <class SrcIterator, class SrcAccessor, class BackInsertable>
inline void
noiseVarianceClustering(triple<SrcIterator, SrcIterator, SrcAccessor> src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
noiseVarianceClustering(src.first, src.second, src.third, result, options);
}
template <class T1, class S1, class BackInsertable>
inline void
noiseVarianceClustering(MultiArrayView<2, T1, S1> const & src,
BackInsertable & result,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
noiseVarianceClustering(srcImageRange(src), result, options);
}
/********************************************************/
/* */
/* nonparametricNoiseNormalization */
/* */
/********************************************************/
/** \brief Noise normalization by means of an estimated non-parametric noise model.
The original image is assumed to be corrupted by noise whose variance depends on the intensity in an unknown way.
The present functions first calls \ref noiseVarianceClustering() to obtain a sequence of intensity/variance pairs
(cluster centers) which estimate this dependency. The cluster centers are connected into a piecewise linear
function which is the inverted according to the formula derived in
W. Förstner: <i>"Image Preprocessing for Feature Extraction in Digital Intensity, Color and Range Images"</i>,
Proc. Summer School on Data Analysis and the Statistical Foundations of Geomatics,
Lecture Notes in Earth Science, Berlin: Springer, 1999
The inverted formula defines a pixel-wise intensity transformation whose application turns the original image
into one that is corrupted by additive Gaussian noise with unit variance. Most subsequent algorithms will be able
to handle this type of noise much better than the original noise.
RGB and other multiband images will be processed one band at a time. The function returns <tt>true</tt> on success.
Noise normalization will fail if the original image does not contain sufficiently homogeneous regions that
allow robust estimation of the noise variance.
The \a options object may use all options described in \ref vigra::NoiseNormalizationOptions.
The function returns <tt>false</tt> if the noise estimation failed, so that no normalization could be performed.
<b> Declarations:</b>
pass 2D array views:
\code
namespace vigra {
template <class T1, class S1,
class T2, class S2>
bool
nonparametricNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedAPI{nonparametricNoiseNormalization}
pass \ref ImageIterators and \ref DataAccessors :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool nonparametricNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool nonparametricNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
}
\endcode
\deprecatedEnd
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
MultiArray<2, RGBValue<float> > src(w,h), dest(w, h);
...
nonparametricNoiseNormalization(src, dest,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
\endcode
\deprecatedUsage{nonparametricNoiseNormalization}
\code
vigra::BRGBImage src(w,h), dest(w, h);
...
vigra::nonparametricNoiseNormalization(srcImageRange(src), destImage(dest),
vigra::NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
\endcode
<b> Required Interface:</b>
same as \ref noiseVarianceEstimation()
\deprecatedEnd
*/
doxygen_overloaded_function(template <...> bool nonparametricNoiseNormalization)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
nonparametricNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
typedef typename SrcAccessor::value_type SrcType;
return detail::nonparametricNoiseNormalizationImpl(sul, slr, src, dul, dest, options,
typename NumericTraits<SrcType>::isScalar());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
nonparametricNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
return nonparametricNoiseNormalization(src.first, src.second, src.third, dest.first, dest.second, options);
}
template <class T1, class S1,
class T2, class S2>
inline bool
nonparametricNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
vigra_precondition(src.shape() == dest.shape(),
"nonparametricNoiseNormalization(): shape mismatch between input and output.");
return nonparametricNoiseNormalization(srcImageRange(src), destImage(dest), options);
}
/********************************************************/
/* */
/* quadraticNoiseNormalization */
/* */
/********************************************************/
/** \brief Noise normalization by means of an estimated or given quadratic noise model.
This function works like \ref nonparametricNoiseNormalization() excapt that the model for the
dependency between intensity and noise variance is assumed to be a
quadratic function rather than a piecewise linear function. If the data conform to the quadratic model,
this leads to a somewhat smoother transformation. The function returns <tt>false</tt> if the noise
estimation failed, so that no normalization could be performed.
In the second variant of the function, the parameters of the quadratic model are not estimated,
but explicitly given according to:
\code
variance = a0 + a1 * intensity + a2 * sq(intensity)
\endcode
<b> Declarations:</b>
pass 2D array views:
\code
namespace vigra {
// estimate and apply a quadratic noise model
template <class T1, class S1,
class T2, class S2>
bool
quadraticNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given quadratic noise model
template <class T1, class S1,
class T2, class S2>
void
quadraticNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
double a0, double a1, double a2);
}
\endcode
\deprecatedAPI{quadraticNoiseNormalization}
pass \ref ImageIterators and \ref DataAccessors :
\code
namespace vigra {
// estimate and apply a quadratic noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool quadraticNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given quadratic noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void quadraticNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1, double a2);
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
// estimate and apply a quadratic noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool quadraticNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given quadratic noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void quadraticNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
double a0, double a1, double a2);
}
\endcode
\deprecatedEnd
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
MultiArray<2, RGBValue<float> > src(w,h), dest(w, h);
...
// estimate the noise model and apply it to normalize the noise variance
bool success = quadraticNoiseNormalization(src, dest,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
vigra_postcondition(success, "quadraticNoiseNormalization(): Unable to estimate noise model.");
// apply a pre-computed noise model
quadraticNoiseNormalization(src, dest, 100, 0.02, 1e-6);
\endcode
\deprecatedUsage{quadraticNoiseNormalization}
\code
vigra::BRGBImage src(w,h), dest(w, h);
...
// estimate the noise model and apply it to normalize the noise variance
vigra::quadraticNoiseNormalization(srcImageRange(src), destImage(dest),
vigra::NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
// apply a pre-computed noise model
vigra::quadraticNoiseNormalization(srcImageRange(src), destImage(dest),
100, 0.02, 1e-6);
\endcode
\deprecatedEnd
<b> Required Interface:</b>
The source value type must be convertible to <tt>double</tt> or must be a vector whose elements
are convertible to <tt>double</tt>. Likewise, the destination type must be assignable from <tt>double</tt>
or a vector whose elements are assignable from <tt>double</tt>.
*/
doxygen_overloaded_function(template <...> bool quadraticNoiseNormalization)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
quadraticNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options)
{
typedef typename SrcAccessor::value_type SrcType;
return detail::quadraticNoiseNormalizationImpl(sul, slr, src, dul, dest, options,
typename NumericTraits<SrcType>::isScalar());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
quadraticNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
return quadraticNoiseNormalization(src.first, src.second, src.third, dest.first, dest.second, options);
}
template <class T1, class S1,
class T2, class S2>
inline bool
quadraticNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
vigra_precondition(src.shape() == dest.shape(),
"quadraticNoiseNormalization(): shape mismatch between input and output.");
return quadraticNoiseNormalization(srcImageRange(src), destImage(dest), options);
}
/********************************************************/
/* */
/* quadraticNoiseNormalization */
/* (variant) */
/* */
/********************************************************/
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
quadraticNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1, double a2)
{
typedef typename SrcAccessor::value_type SrcType;
detail::quadraticNoiseNormalizationImpl(sul, slr, src, dul, dest, a0, a1, a2,
typename NumericTraits<SrcType>::isScalar());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
quadraticNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
double a0, double a1, double a2)
{
quadraticNoiseNormalization(src.first, src.second, src.third, dest.first, dest.second, a0, a1, a2);
}
template <class T1, class S1,
class T2, class S2>
inline void
quadraticNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
double a0, double a1, double a2)
{
vigra_precondition(src.shape() == dest.shape(),
"quadraticNoiseNormalization(): shape mismatch between input and output.");
quadraticNoiseNormalization(srcImageRange(src), destImage(dest), a0, a1, a2);
}
/********************************************************/
/* */
/* linearNoiseNormalization */
/* */
/********************************************************/
/** \brief Noise normalization by means of an estimated or given linear noise model.
This function works like \ref nonparametricNoiseNormalization() excapt that the model for the
dependency between intensity and noise variance is assumed to be a
linear function rather than a piecewise linear function. If the data conform to the linear model,
this leads to a very simple transformation which is similar to the familiar gamma correction.
The function returns <tt>false</tt> if the noise estimation failed, so that no
normalization could be performed.
In the second variant of the function, the parameters of the linear model are not estimated,
but explicitly given according to:
\code
variance = a0 + a1 * intensity
\endcode
<b> Declarations:</b>
pass 2D array views:
\code
namespace vigra {
// estimate and apply a linear noise model
template <class T1, class S1,
class T2, class S2>
bool
linearNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given linear noise model
template <class T1, class S1,
class T2, class S2>
void
linearNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
double a0, double a1);
}
\endcode
\deprecatedAPI{linearNoiseNormalization}
pass \ref ImageIterators and \ref DataAccessors :
\code
namespace vigra {
// estimate and apply a linear noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool linearNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given linear noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void linearNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1);
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
// estimate and apply a linear noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
bool linearNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions());
// apply a given linear noise model
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
void linearNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
double a0, double a1);
}
\endcode
\deprecatedEnd
<b> Usage:</b>
<b>\#include</b> \<vigra/noise_normalization.hxx\><br>
Namespace: vigra
\code
vigra::BRGBImage src(w,h), dest(w, h);
...
// estimate the noise model and apply it to normalize the noise variance
bool success = linearNoiseNormalization(src, dest,
NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
vigra_postcondition(success, "linearNoiseNormalization(): Unable to estimate noise model.");
// apply a pre-computed noise model
linearNoiseNormalization(src, dest, 100, 0.02);
\endcode
\deprecatedUsage{linearNoiseNormalization}
\code
vigra::BRGBImage src(w,h), dest(w, h);
...
// estimate the noise model and apply it to normalize the noise variance
vigra::linearNoiseNormalization(srcImageRange(src), destImage(dest),
vigra::NoiseNormalizationOptions().windowRadius(9).noiseVarianceInitialGuess(25.0).
clusterCount(15));
// apply a pre-computed noise model
vigra::linearNoiseNormalization(srcImageRange(src), destImage(dest),
100, 0.02);
\endcode
\deprecatedEnd
<b> Required Interface:</b>
The source value type must be convertible to <tt>double</tt> or must be a vector whose elements
are convertible to <tt>double</tt>. Likewise, the destination type must be assignable from <tt>double</tt>
or a vector whose elements are assignable from <tt>double</tt>.
*/
doxygen_overloaded_function(template <...> bool linearNoiseNormalization)
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
linearNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
typedef typename SrcAccessor::value_type SrcType;
return detail::linearNoiseNormalizationImpl(sul, slr, src, dul, dest, options,
typename NumericTraits<SrcType>::isScalar());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline bool
linearNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
return linearNoiseNormalization(src.first, src.second, src.third, dest.first, dest.second, options);
}
template <class T1, class S1,
class T2, class S2>
inline bool
linearNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
NoiseNormalizationOptions const & options = NoiseNormalizationOptions())
{
vigra_precondition(src.shape() == dest.shape(),
"linearNoiseNormalization(): shape mismatch between input and output.");
return linearNoiseNormalization(srcImageRange(src), destImage(dest), options);
}
/********************************************************/
/* */
/* linearNoiseNormalization */
/* (variant) */
/* */
/********************************************************/
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline
void linearNoiseNormalization(SrcIterator sul, SrcIterator slr, SrcAccessor src,
DestIterator dul, DestAccessor dest,
double a0, double a1)
{
typedef typename SrcAccessor::value_type SrcType;
detail::linearNoiseNormalizationImpl(sul, slr, src, dul, dest, a0, a1,
typename NumericTraits<SrcType>::isScalar());
}
template <class SrcIterator, class SrcAccessor,
class DestIterator, class DestAccessor>
inline void
linearNoiseNormalization(triple<SrcIterator, SrcIterator, SrcAccessor> src,
pair<DestIterator, DestAccessor> dest,
double a0, double a1)
{
linearNoiseNormalization(src.first, src.second, src.third, dest.first, dest.second, a0, a1);
}
template <class T1, class S1,
class T2, class S2>
inline void
linearNoiseNormalization(MultiArrayView<2, T1, S1> const & src,
MultiArrayView<2, T2, S2> dest,
double a0, double a1)
{
vigra_precondition(src.shape() == dest.shape(),
"linearNoiseNormalization(): shape mismatch between input and output.");
linearNoiseNormalization(srcImageRange(src), destImage(dest), a0, a1);
}
//@}
} // namespace vigra
#endif // VIGRA_NOISE_NORMALIZATION_HXX
|