146 SubPart *subPart(
int r,
int featseed,
int *isIn );
148 void initialization();
150 double compute_feature_cost(
SubPart *part,
int feat_id,
int label_id,
int *nbOverlap );
151 double compute_subsolution_cost(
SubPart *part,
int *
s,
int * nbOverlap );
156 double popmusic_chain(
SubPart *part );
158 double popmusic_tabu(
SubPart *part );
165 double popmusic_tabu_chain(
SubPart *part );
170 void init_sol_empty();
171 void init_sol_falp();
180 int nbLabelledLayers;
212 double *labelPositionCost;
224 double *inactiveCost;
235 Chain *chain(
int seed );
239 void solution_cost();
240 void check_solution();
void addCandidatePosition(LabelPosition *position)
Adds a candidate label position to the problem.
int getFeatureCandidateCount(int i)
int probSize
of features in problem
Main Pal labelling class.
void seed(uint32_t value)
struct pal::_subpart SubPart
int * sub
wrap bw sub feat and main feat
int subSize
total # features (prob + border)
Summary statistics of labelling problem.
LabelPosition is a candidate feature label position.
Representation of a labeling problem.
LabelPosition * getFeatureCandidate(int fi, int ci)
int borderSize
of features bounding the problem
int seed
first feat in sub part