Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in
Toggle navigation
D
dlib
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
钟尚武
dlib
Commits
a69aecf6
Commit
a69aecf6
authored
Apr 28, 2012
by
Davis King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
clarified spec
parent
af45dedd
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
1 addition
and
0 deletions
+1
-0
find_max_factor_graph_potts_abstract.h
dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
+1
-0
No files found.
dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
View file @
a69aecf6
...
...
@@ -208,6 +208,7 @@ namespace dlib
- This function is a tool for exactly solving the MAP problem in a Potts
model. In particular, this means that this function finds the assignments
to all the labels in prob which maximizes potts_model_score(#prob).
- The optimal labels are stored in #prob.
- Note that this routine is a little bit faster if all the values
returned by prob.factor_value() are negative. So if you can arrange for that
to be true without spending any extra CPU cycles then it might be a good idea
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment