summaryrefslogtreecommitdiff
path: root/src/ipa/libipa/awb_bayes.cpp
diff options
context:
space:
mode:
authorStefan Klug <stefan.klug@ideasonboard.com>2025-01-23 12:41:06 +0100
committerStefan Klug <stefan.klug@ideasonboard.com>2025-02-21 17:51:10 +0100
commitd98f3512ec92f3e25a05f0b2a0676cd3576fe333 (patch)
tree05cb55b2605ca6f5e27669ddcb6dc8a0811f5f9d /src/ipa/libipa/awb_bayes.cpp
parentc2059585f3c7289af000b6d40734b94ece5c083c (diff)
libipa: awb_bayes: Remove overly verbose log messages
Logging every search step is too verbose even with debug messages enabled and it hides the more important messages (min max values of errors and likelihoods). Remove the debug messages in a separate commit, so that it can easily be reverted if needed. Signed-off-by: Stefan Klug <stefan.klug@ideasonboard.com> Reviewed-by: Paul Elder <paul.elder@ideasonboard.com> Reviewed-by: Daniel Scally <dan.scally@ideasonboard.com>
Diffstat (limited to 'src/ipa/libipa/awb_bayes.cpp')
-rw-r--r--src/ipa/libipa/awb_bayes.cpp13
1 files changed, 0 insertions, 13 deletions
diff --git a/src/ipa/libipa/awb_bayes.cpp b/src/ipa/libipa/awb_bayes.cpp
index fc8502a2..c3e0b69b 100644
--- a/src/ipa/libipa/awb_bayes.cpp
+++ b/src/ipa/libipa/awb_bayes.cpp
@@ -329,12 +329,6 @@ double AwbBayes::coarseSearch(const ipa::Pwl &prior, const AwbStats &stats) cons
errorLimits.record(delta2Sum);
priorLogLikelihoodLimits.record(priorLogLikelihood);
- LOG(Awb, Debug) << "Coarse search t: " << t
- << " gains: " << gains
- << " error: " << delta2Sum
- << " prior: " << priorLogLikelihood
- << " likelihood: " << finalLogLikelihood;
-
points.push_back({ { t, finalLogLikelihood } });
if (points.back().y() < points[bestPoint].y())
bestPoint = points.size() - 1;
@@ -452,13 +446,6 @@ void AwbBayes::fineSearch(double &t, double &r, double &b, ipa::Pwl const &prior
double delta2Sum = stats.computeColourError(gains);
errorLimits.record(delta2Sum);
double finalLogLikelihood = delta2Sum - priorLogLikelihood;
- LOG(Awb, Debug)
- << "Fine search t: " << tTest
- << " r: " << rbTest[0]
- << " b: " << rbTest[1]
- << " offset: " << bestOffset
- << " likelihood: " << finalLogLikelihood
- << (finalLogLikelihood < bestLogLikelihood ? " NEW BEST" : "");
if (bestT == 0 || finalLogLikelihood < bestLogLikelihood) {
bestLogLikelihood = finalLogLikelihood;