Wikipedia

Graph cuts in computer vision: Difference between revisions

Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
m Added a 'not a typo tag so that jargon isn't detected as typos by spellcheckers like Wikipedia:Typo_Team/moss, deleted some useless jargon abbreviations.
Vrtlsclpl (talk | contribs)
263 edits
No edit summary
Line 82:
=== Implementation (approximation) ===
 
The Sim Cut algorithm<ref>P.J. Yim: "[https://patentimages.storage.googleapis.com/2b/1e/e9/5834a9cc3312a0/US9214029.pdf Method and System for Image Segmentation]," United States Patent US8929636, January 6, 2016</ref> approximates the graph cut. by theThe solutionalgorithm ofimplements thea setsolution ofto simultaneouselectrical non-linearnetwork equationsdescribed basedby on[[Cederbaum's_maximum_flow_theorem|Cederbaum's the analog electrical model of themaximum flow networktheorem]].<ref>{{Cite journal|last=Cederbaum|first=I.|date=1962-08-01|title=On optimal operation of communication nets|url=http://www.sciencedirect.com/science/article/pii/0016003262904015|journal=Journal of the Franklin Institute|volume=274|issue=2|pages=130–141|doi=10.1016/0016-0032(62)90401-5|issn=0016-0032}}</ref><ref>I.T. Frisch, "On Electrical analogs for flow networks," Proceedings of IEEE, 57:2, pp. 209-210, 1969</ref> Acceleration of the algorithm is possible through parallel computing.
 
== Software ==
Retrieved from "https://en.wikipedia.org/wiki/Graph_cuts_in_computer_vision"