/** Set the data costs of the MRF. */
void
set_data_costs(std::vector<FaceInfo> const & face_infos, ST const & data_costs,
std::vector<mrf::Graph::Ptr> const & mrfs) {
/* Set data costs for all labels except label 0 (undefined) */
for (std::size_t i = 0; i < data_costs.rows(); i++) {
ST::Row const & data_costs_for_label = data_costs.row(i);
std::vector<std::vector<mrf::SparseDataCost> > costs(mrfs.size());
for(std::size_t j = 0; j < data_costs_for_label.size(); j++) {
const std::size_t id = data_costs_for_label[j].first;
const float data_cost = data_costs_for_label[j].second;
const std::size_t component = face_infos[id].component;
const std::size_t cid = face_infos[id].id;
//TODO change index type of mrf::Graph
costs[component].push_back({static_cast<int>(cid), data_cost});
}
int label = i + 1;
for (std::size_t j = 0; j < mrfs.size(); ++j) {
mrfs[j]->set_data_costs(label, costs[j]);
}
}
for (std::size_t i = 0; i < mrfs.size(); ++i) {
/* Set costs for undefined label */
std::vector<mrf::SparseDataCost> costs(mrfs[i]->num_sites());
for (std::size_t j = 0; j < costs.size(); j++) {
costs[j].site = j;
costs[j].cost = MRF_MAX_ENERGYTERM;
}
mrfs[i]->set_data_costs(0, costs);
}
}
void
view_selection(ST const & data_costs, UniGraph * graph, Settings const & settings) {
UniGraph mgraph(*graph);
isolate_unseen_faces(&mgraph, data_costs);
unsigned int num_components = 0;
std::vector<FaceInfo> face_infos(mgraph.num_nodes());
std::vector<std::vector<std::size_t> > components;
// get components in the graph
mgraph.get_subgraphs(0, &components);
for (std::size_t i = 0; i < components.size(); ++i) {
if (components.size() > 1000) num_components += 1;
for (std::size_t j = 0; j < components[i].size(); ++j) {
face_infos[components[i][j]] = {i, j};
}
}
#ifdef RESEARCH
mrf::SOLVER_TYPE solver_type = mrf::GCO;
#else
mrf::SOLVER_TYPE solver_type = mrf::LBP;
#endif
/* Label 0 is undefined. */
const std::size_t num_labels = data_costs.rows() + 1;
std::vector<mrf::Graph::Ptr> mrfs(components.size());
for (std::size_t i = 0; i < components.size(); ++i) {
mrfs[i] = mrf::Graph::create(components[i].size(), num_labels, solver_type);
}
/* Set neighbors must be called prior to set_data_costs (LBP). */
set_neighbors(mgraph, face_infos, mrfs);
set_data_costs(face_infos, data_costs, mrfs);
bool multiple_components_simultaneously = false;
#ifdef RESEARCH
multiple_components_simultaneously = true;
#endif
#ifndef _OPENMP
multiple_components_simultaneously = false;
#endif
if (multiple_components_simultaneously) {
if (num_components > 0) {
std::cout << "\tOptimizing " << num_components
<< " components simultaneously." << std::endl;
}
std::cout << "\tComp\tIter\tEnergy\t\tRuntime" << std::endl;
}
#ifdef RESEARCH
#pragma omp parallel for schedule(dynamic)
#endif
for (std::size_t i = 0; i < components.size(); ++i) {
switch (settings.smoothness_term) {
case POTTS:
mrfs[i]->set_smooth_cost(*potts);
break;
}
bool verbose = mrfs[i]->num_sites() > 10000;
util::WallTimer timer;
mrf::ENERGY_TYPE const zero = mrf::ENERGY_TYPE(0);
mrf::ENERGY_TYPE last_energy = zero;
mrf::ENERGY_TYPE energy = mrfs[i]->compute_energy();
mrf::ENERGY_TYPE diff = last_energy - energy;
unsigned int iter = 0;
std::string const comp = util::string::get_filled(i, 4);
if (verbose && !multiple_components_simultaneously) {
std::cout << "\tComp\tIter\tEnergy\t\tRuntime" << std::endl;
}
while (diff != zero) {
#pragma omp critical
if (verbose) {
std::cout << "\t" << comp << "\t" << iter << "\t" << energy
<< "\t" << timer.get_elapsed_sec() << std::endl;
}
last_energy = energy;
++iter;
energy = mrfs[i]->optimize(1);
diff = last_energy - energy;
if (diff <= zero) break;
}
#pragma omp critical
if (verbose) {
std::cout << "\t" << comp << "\t" << iter << "\t" << energy << std::endl;
if (diff == zero) {
std::cout << "\t" << comp << "\t" << "Converged" << std::endl;
}
if (diff < zero) {
std::cout << "\t" << comp << "\t"
<< "Increase of energy - stopping optimization" << std::endl;
}
}
/* Extract resulting labeling from MRF. */
for (std::size_t j = 0; j < components[i].size(); ++j) {
int label = mrfs[i]->what_label(static_cast<int>(j));
assert(0 <= label && static_cast<std::size_t>(label) < num_labels);
graph->set_label(components[i][j], static_cast<std::size_t>(label));
}
}
}
