I am looking to implement shape recognition/matching of similar curves (discreet point arrays) in 2D.
I have found a paper on the subject but Im somewhat lost when it comes to implementing this in code.
I have figured out that this function needs to be minimized:
But where do I start?
Can somebody please outline an approach to this in english? And perhaps in some pseudo-code?
I think it's unlikely that you'll be able to get this to work without understanding the math, and the way to understand the math is to work through the paper from the beginning; if you jump to the last equation and try to code it, naturally it won't make sense. Here are the answers to your specific questions, for what they're worth:
We start of with some definitions:
As for the minimisation, you can have a look here: http://en.wikipedia.org/wiki/Calculus_of_variations
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.