I am supposed to implement Dynamic programming algorithm for Stereo matching problem. I have read 2 research papers but still haven't understood as to how do I write my own c++ program for that !
Is there any book or resource that's available somewhere that I can use to get an idea as to how to start coding actually ?
Internet search only gives me journal and conference papers regarding Dynamic Programming but not how to implement the algorithm step by step.
Thanks
Varun
Read this paper by Cox, Hingorany and Rao, old but still a classic.
Cost computation is pixel based, but the generalization to cross-correlation in a neigborhood is trivial, as is also its generalization to a pyramid scheme in which full match is done only at the lowest resolution, and the result used to refine at higher resolutions by doing the DP search only in a small band around the lower res match. This idea was the basis of the better known paper by Luc van Gool and Marc Pollefeys
Part of the challenge of implementing dynamic programming is that it is more of a problem-solving technique than it is a pure algorithm.
An effective resource that I used once to implement a DP solution is Michael Trick's tutorial; it's not been kept up-to-date, but it's still a good place to start. This tutorial's section on common characteristics of DP problems is still one of the best conceptual roadmaps I've found for DP.
I'd also check out the resources listed in the Wikipedia dynamic programming article
Here's a dynamic programming tutorial (well lecture actually) in video form, might help: http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-ten
精彩评论