Revision as of 03:14, 11 May 2023 edit 7iro (talk \| contribs) 1 edit In the a-expansion and ab-swap algorithms there was a mistake in the comparision, where instead of cost, the argument to cost function was used in the rhs of the expression Tag: Visual edit ← Previous edit		Revision as of 02:40, 25 July 2023 edit undo Citation bot (talk \| contribs) Bots 5,867,084 edits Misc citation tidying. \| Use this bot. Report bugs. \| #UCB_CommandLine Next edit →
Line 175: * {{cite journal\|first1=Pushmeet\|last1=Kohli\|first2=M. Pawan\|last2=Kumar\|first3=Philip H.S.\|last3=Torr\|title=P<sup>3</sup> & Beyond: Move Making Algorithms for Solving Higher Order Functions\|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence\|volume=31\|number=9\|year=2009\|pages=1645–1656\|url=http://www.robots.ox.ac.uk/~phst/Papers/2008/P3%20Journal/p3_pami.pdf\|doi=10.1109/tpami.2008.217\|pmid=19574624\|s2cid=91470}} * {{cite conference\|title=Visual correspondence using energy minimization and mutual information\|conference=Proceedings of the Ninth IEEE International Conference on Computer Vision\|year=2003\|last1=Kim\|first1=Junhwan\|last2=Kolmogorov\|first2=Vladimir\|last3=Zabih\|first3=Ramin\|pages=1033–1040\|url=http://www.academia.edu/download/30739536/1033_kim.pdf}}{{dead link\|date=July 2022\|bot=medic}}{{cbignore\|bot=medic}} * {{cite ~~techreport~~tech report\|title=Graph cuts for minimizing robust higher order potentials\|year=2008\|institution=Oxford Brookes University\|last1=Kohli\|first1=Pushmeet\|last2=Ladicky\|first2=Lubor\|last3=Torr\|first3=PHS\|pages=1–9\|url=https://www.researchgate.net/profile/Pushmeet_Kohli/publication/228338783_Graph_cuts_for_minimizing_robust_higher_order_potentials/links/544a74be0cf2f10303a41de2/Graph-cuts-for-minimizing-robust-higher-order-potentials.pdf}} * {{cite journal\|first1=Vladimir\|last1=Kolmogorov\|first2=Carsten\|last2=Rother\|title=Minimizing Nonsubmodular Functions: A Review\|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence\|volume=29\|number=7\|year=2007\|pages=1274–1279\|doi=10.1109/tpami.2007.1031\|pmid=17496384\|s2cid=15319364}} * {{cite journal\|first1=Vladimir\|last1=Kolmogorov\|first2=Ramin\|last2=Zabin\|title=What energy functions can be minimized via graph cuts?\|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence\|volume=26\|number=2\|year=2004\|pages=1645–1656\|url=https://ecommons.cornell.edu/bitstream/handle/1813/5842/2001-1857.pdf?sequence=1\|doi=10.1109/TPAMI.2004.1262177\|pmid=15376891\|hdl=1813/5842\|hdl-access=free}}

Graph cut optimization: Difference between revisions