Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/b/libdtw
Fast dynamic time warping library based on the UCR Suite http://www.cs.ucr.edu/~eamonn/UCRsuite.html
https://github.com/b/libdtw
Last synced: 16 days ago
JSON representation
Fast dynamic time warping library based on the UCR Suite http://www.cs.ucr.edu/~eamonn/UCRsuite.html
- Host: GitHub
- URL: https://github.com/b/libdtw
- Owner: b
- Created: 2012-11-17T21:50:26.000Z (almost 12 years ago)
- Default Branch: master
- Last Pushed: 2012-11-20T23:50:26.000Z (almost 12 years ago)
- Last Synced: 2024-07-31T22:55:59.621Z (3 months ago)
- Language: C
- Homepage:
- Size: 3.87 MB
- Stars: 36
- Watchers: 6
- Forks: 16
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
### libdtw
libdtw is a fast, dynamic time warping library based on the [UCR Suite](http://www.cs.ucr.edu/~eamonn/UCRsuite.html).
### Building
cd src && make
This will produce libdtw.a. You will need to link against this library.
### Usage
The only interface is the ucr_query() function. The function accepts 6 arguments:
int ucr_query(double *q, int m, double r, double *buffer, int buflen, struct ucr_index *result);
_q_ is the pattern to be matched.
_m_ is the number of elements in q.
_r_ is the size of the warping window.
_buffer_ is the data.
_buflen_ is the length of the data array.
_result_ is the output.result->index is the index of the first element in the best matching sequence in the data. result->value is the
DTW distance between the query and the matching sequence in the data.ucr_query() returns 0 on success and -1 on failure.