#include "graph.h"
#include <boost/graph/adjacency_list.hpp>
#include <boost/random/linear_congruential.hpp>
#include <boost/graph/random.hpp>
#include <boost/graph/connected_components.hpp>
#include "pricer.h"
#include <scip/scipdefplugins.h>
#include <iostream>
#include <math.h>
#include <string>
#include "vardata.h"
#include "image.h"
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/highgui/highgui.hpp>
|
SCIP_RETCODE | master_problem (Graph &g, std::vector< Graph::vertex_descriptor > master_nodes, std::vector< std::set< Graph::vertex_descriptor >> initial_segments, std::vector< std::vector< Graph::vertex_descriptor >> &segments) |
| Setup and solve the master problem. More...
|
|
int | main (int argc, char **argv) |
| The main function reads the image, retrieves the graph of superpixels, solves the master problem and outputs the solution.
|
|
|
std::vector< std::pair< uint32_t, uint32_t > > | master_pixels |
|
SCIP_RETCODE master_problem |
( |
Graph & |
g, |
|
|
std::vector< Graph::vertex_descriptor > |
master_nodes, |
|
|
std::vector< std::set< Graph::vertex_descriptor >> |
initial_segments, |
|
|
std::vector< std::vector< Graph::vertex_descriptor >> & |
segments |
|
) |
| |
Setup and solve the master problem.
- Parameters
-
g | the graph of superpixels |
master_nodes | master nodes of all segments |
initial_segments | an initial set of segments that will be added as variables These should form a feasible solution, but do not need to be connected. |
segments | the selected segments will be stored in here |