NextCloud/dlib
1
0
Fork 0
mirror of https://github.com/davisking/dlib.git synced 2024-11-01 10:14:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

clarified spec and fixed typos.

Browse Source
This commit is contained in:
Davis King 2012-04-28 23:40:53 -04:00
parent 552ca77a64
commit 9caa96c94c
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
View File

@ -174,13 +174,14 @@ namespace dlib
- for all valid i and j:
- prob.factor_value_disagreement(i,j) == prob.factor_value_disagreement(j,i)
ensures
- computes the model score for the given potts_problem. To define this
precisely:
- computes the model score for the given potts_problem. We define this
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) where whenever L(i) == true.
- let F == the sum of all 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)
whenever the following conditions are true about i and 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).
- L(i) != L(j)