Graph cut optimization - LambLabs/Lider-DERS GitHub Wiki
Graph cut optimization block diagram is presented below
+----------------+
| Initialization |
Input views images +----------------+
| |
Output views images | v
| | +--------------------+
Segment index maps | | | |
| | | | |
| | | +--------------v---------------+ |
| | +---->| Calculation of Matching Cost | |
| +---------------->| for label=source | |
| | +------------------------------+ |
| | | |
| | v |
| | +----------------------------------+ |
| +-------------->| Graph Cut iteration | ^
+------------------------->| current labeling vs source label | |
+----------------------------------+ |
| |
v |
+---------------------------+ |
| Update best matching cost | |
+---------------------------+ |
| |
v |
+--------------------+
|
v
+--------------------+
+----------| Label to Depth Map |
| | Converter |
| +--------------------+
v
Estimated Depth maps
xx