OrgLion-ML
/
dlib
mirror of https://github.com/davisking/dlib.git
1
0
Fork 0
Code Issues Releases Wiki Activity

clarified spec

This commit is contained in:
Davis King 2012-04-28 23:43:08 -04:00
parent 9caa96c94c
commit 9cc3947a85
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
View File

@ -178,9 +178,9 @@ namespace dlib
precisely below:
- let L(i) == the boolean label of the ith variable in prob. Or in other
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.
- 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:
- i and j are neighbors in the graph defined by prob, that is,
it is valid to call prob.factor_value_disagreement(i,j).