Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have read this paper about correlation optimized warping algorithm for time series (or here chromatograms) alignment.

Level of detail is not sufficient regarding implementation of optimization procedure in 1D COW, to find optimal linear shifts $u_{i}$ for each section. Then, 2D COW algorithm is rooted on this 1D COW algo. Dynamic programming procedure is mentionned, but I dont know how it is used here exactly.

Do you have references with more details, or implementations of COW?

thanks and regards

share|improve this question

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.