Mercurial > hg > match-vamp
comparison src/Finder.h @ 191:f415747b151b re-minimise
Normalised path costs should use a different type from un-normalised ones (because they are in a different range)
| author | Chris Cannam |
|---|---|
| date | Thu, 26 Feb 2015 15:52:16 +0000 |
| parents | a67663dc698d |
| children | 175c8f044e7c |
comparison
equal
deleted
inserted
replaced
| 190:48f9c50587dc | 191:f415747b151b |
|---|---|
| 41 * duration of each input will be considered. | 41 * duration of each input will be considered. |
| 42 */ | 42 */ |
| 43 void setDurations(int d1, int d2); | 43 void setDurations(int d1, int d2); |
| 44 | 44 |
| 45 /** | 45 /** |
| 46 * Find the location and cost of the column with the cheapest path | 46 * Find the location and normalised path cost of the column with |
| 47 * cost within the given row. If the row is out of range, return | 47 * the cheapest path cost within the given row. If the row is out |
| 48 * false and leave the bestCol and bestCost variables unchanged. | 48 * of range, return false and leave the bestCol and bestCost |
| 49 * variables unchanged. | |
| 49 */ | 50 */ |
| 50 bool getBestRowCost(int row, int &bestCol, pathcost_t &bestCost); | 51 bool getBestRowCost(int row, int &bestCol, normpathcost_t &bestCost); |
| 51 | 52 |
| 52 /** | 53 /** |
| 53 * Find the location and cost of the row with the cheapest path | 54 * Find the location and normalised path cost of the row with the |
| 54 * cost within the given column. If the column is out of range, | 55 * cheapest path cost within the given column. If the column is |
| 55 * return false and leave the bestRow and bestCost variables | 56 * out of range, return false and leave the bestRow and bestCost |
| 56 * unchanged. | 57 * variables unchanged. |
| 57 */ | 58 */ |
| 58 bool getBestColCost(int col, int &bestRow, pathcost_t &bestCost); | 59 bool getBestColCost(int col, int &bestRow, normpathcost_t &bestCost); |
| 59 | 60 |
| 60 /** | 61 /** |
| 61 * Find the location and cost of the cheapest path cost within the | 62 * Find the location and normalised path cost of the cheapest path |
| 62 * final row and column of the search area, given that the area | 63 * cost within the final row and column of the search area, given |
| 63 * extends as far as the point at (row, col). This is used by | 64 * that the area extends as far as the point at (row, col). This |
| 64 * getExpandDirection and can also be used, for example, to | 65 * is used by getExpandDirection and can also be used, for |
| 65 * determine the current best estimate alignment for a frame we | 66 * example, to determine the current best estimate alignment for a |
| 66 * have just reached. | 67 * frame we have just reached. |
| 67 */ | 68 */ |
| 68 void getBestEdgeCost(int row, int col, | 69 void getBestEdgeCost(int row, int col, |
| 69 int &bestRow, int &bestCol, | 70 int &bestRow, int &bestCol, |
| 70 pathcost_t &bestCost); | 71 normpathcost_t &bestCost); |
| 71 | 72 |
| 72 /** | 73 /** |
| 73 * Calculate which direction to expand the search area in, given | 74 * Calculate which direction to expand the search area in, given |
| 74 * its current extents. | 75 * its current extents. |
| 75 */ | 76 */ |