Searched refs:gamma_ji (Results 1 – 2 of 2) sorted by relevance
/dports/science/py-dlib/dlib-19.22/dlib/optimization/ |
H A D | find_max_factor_graph_nmplp.h | 197 std::vector<std::vector<double> > gamma_ji; in find_max_factor_graph_nmplp() local 203 gamma_ji.reserve(10000); in find_max_factor_graph_nmplp() 228 if (jcnt >= gamma_ji.size()) in find_max_factor_graph_nmplp() 230 gamma_ji.resize(gamma_ji.size()+1); in find_max_factor_graph_nmplp() 238 gamma_ji[jcnt].assign(num_states_xi, -std::numeric_limits<double>::infinity()); in find_max_factor_graph_nmplp() 259 …gamma_ji[jcnt][xi] = std::max(gamma_ji[jcnt][xi], prob.factor_value(i,j,xi,xj) + delta_to_j_no_i[j… in find_max_factor_graph_nmplp() 261 gamma_i[xi] += gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp() 285 … double val = prob.factor_value(i,j,xi,xj) + 2/(num_neighbors+1)*gamma_i[xi] -gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp() 299 double new_val = -1/(num_neighbors+1)*gamma_i[xi] + gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp()
|
/dports/science/dlib-cpp/dlib-19.22/dlib/optimization/ |
H A D | find_max_factor_graph_nmplp.h | 197 std::vector<std::vector<double> > gamma_ji; in find_max_factor_graph_nmplp() local 203 gamma_ji.reserve(10000); in find_max_factor_graph_nmplp() 228 if (jcnt >= gamma_ji.size()) in find_max_factor_graph_nmplp() 230 gamma_ji.resize(gamma_ji.size()+1); in find_max_factor_graph_nmplp() 238 gamma_ji[jcnt].assign(num_states_xi, -std::numeric_limits<double>::infinity()); in find_max_factor_graph_nmplp() 259 …gamma_ji[jcnt][xi] = std::max(gamma_ji[jcnt][xi], prob.factor_value(i,j,xi,xj) + delta_to_j_no_i[j… in find_max_factor_graph_nmplp() 261 gamma_i[xi] += gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp() 285 … double val = prob.factor_value(i,j,xi,xj) + 2/(num_neighbors+1)*gamma_i[xi] -gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp() 299 double new_val = -1/(num_neighbors+1)*gamma_i[xi] + gamma_ji[jcnt][xi]; in find_max_factor_graph_nmplp()
|