Skip to content

GitLab

Commit 9cc3947a authored by Davis King's avatar Davis King
Browse files

clarified spec

parent 9caa96c9
Show whitespace changes
Inline Side-by-side
Showing with 2 additions and 2 deletions
dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
View file @ 9cc3947a
...@@ -178,9 +178,9 @@ namespace dlib ...@@ -178,9 +178,9 @@ namespace dlib
precisely below: precisely below:
- let L(i) == the boolean label of the ith variable in prob. Or in other - let L(i) == the boolean label of the ith variable in prob. Or in other
words, L(i) == (prob.get_label(i) != 0). words, L(i) == (prob.get_label(i) != 0).
- let F == the sum of all values of prob.factor_value(i) for only i values - let F == the sum of values of prob.factor_value(i) for only i values
where L(i) == true. where L(i) == true.
- Let D == the sum of all values of prob.factor_value_disagreement(i,j) - Let D == the sum of values of prob.factor_value_disagreement(i,j)
for only i and j values which meet the following conditions: for only i and j values which meet the following conditions:
- i and j are neighbors in the graph defined by prob, that is, - i and j are neighbors in the graph defined by prob, that is,
it is valid to call prob.factor_value_disagreement(i,j). it is valid to call prob.factor_value_disagreement(i,j).
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment