Graph Cuts—Combinatorial Optimization in Vision
Department of Computer Science and EngineeringWaseda UniversityTokyo, Japan
Email: hfs@waseda.jp
CONTENTS
2.2.1 Labeling Problem: A Simple Example
2.3 Basic Graph Cuts: Binary Labels
2.3.4 Nonsubmodular Case: The BHS Algorithm
Get Image Processing and Analysis with Graphs now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.