| Fri, 27 Feb 2015 12:59:37 +0000 |
Chris Cannam |
Make some checks optional
memory
|
| Fri, 27 Feb 2015 12:53:04 +0000 |
Chris Cannam |
Simplify memory reduction
memory
|
| Fri, 27 Feb 2015 12:35:02 +0000 |
Chris Cannam |
Don't create matrices in other matcher, now they aren't referred to
memory
|
| Fri, 27 Feb 2015 12:21:58 +0000 |
Chris Cannam |
Rename getRowRange/getColRange to make nature of arg clearer
memory
|
| Fri, 27 Feb 2015 12:20:32 +0000 |
Chris Cannam |
Make getRowRange/getColRange operate on first matcher only
memory
|
| Fri, 27 Feb 2015 12:09:43 +0000 |
Chris Cannam |
Make isRowAvailable/isColAvailable operate on first matcher only
memory
|
| Fri, 27 Feb 2015 11:38:04 +0000 |
Chris Cannam |
Stats
memory
|
| Thu, 26 Feb 2015 15:52:16 +0000 |
Chris Cannam |
Normalised path costs should use a different type from un-normalised ones (because they are in a different range)
re-minimise
|
| Thu, 26 Feb 2015 12:19:17 +0000 |
Chris Cannam |
distance_t * diagonalWeight might not fit in distance_t; use pathcost_t for it. Also remove C-style casts.
re-minimise
|
| Thu, 19 Feb 2015 17:17:20 +0000 |
Chris Cannam |
Toward allowing types to be small again. Doesn't currently build
re-minimise
|
| Thu, 19 Feb 2015 16:57:19 +0000 |
Chris Cannam |
Start using properly-named types
types
|
| Thu, 19 Feb 2015 16:45:42 +0000 |
Chris Cannam |
Introduce (though don't use properly) types header; get to build
types
|
| Thu, 19 Feb 2015 16:14:33 +0000 |
Chris Cannam |
Build with -Wconversion
tuning-rescale
|
| Fri, 23 Jan 2015 14:55:19 +0000 |
Chris Cannam |
More cost query methods
structure
|
| Thu, 15 Jan 2015 17:29:49 +0000 |
Chris Cannam |
Attempt naive silence penalty -- not currently working, but the plots are food for thought
silence_penalty
|
| Thu, 08 Jan 2015 12:11:27 +0000 |
Chris Cannam |
Separate out the raw & conditioned feature outputs (previously only conditioned was available, but we want raw for our tests). Plus some optional debug output
refactors
|
| Thu, 18 Dec 2014 17:56:54 +0000 |
Chris Cannam |
The finder is supposed to use normalised path-cost when calculation expand direction (as in Java implementation). Also, provide a way to query the forward path.
refactors
|
| Thu, 04 Dec 2014 13:23:10 +0000 |
Chris Cannam |
Feature size is not actually needed in Matcher
feature_conditioner
|
| Thu, 27 Nov 2014 16:50:14 +0000 |
Chris Cannam |
Tidy
refactors
|
| Thu, 27 Nov 2014 16:05:19 +0000 |
Chris Cannam |
Ah, it's subtler than that -- we have to handle the case where this is not the first matcher as well, if we're to get precisely the same results
refactors
|
| Thu, 27 Nov 2014 15:56:12 +0000 |
Chris Cannam |
Fix inconsistency (with Finder) in choice of preference where two costs come out equal
refactors
|
| Thu, 27 Nov 2014 13:02:28 +0000 |
Chris Cannam |
Remove some debug out
refactors
|
| Thu, 27 Nov 2014 12:59:23 +0000 |
Chris Cannam |
Fix diagonal handling: there was an implicit fixed diagonal weight of 2 in comparison of diagmin+distance to othermin directly
refactors
|
| Thu, 27 Nov 2014 12:54:20 +0000 |
Chris Cannam |
Move some functions about
refactors
|
