IAM

OPENSOURCEFAN STUDYING
STUDYINGCOMPUTERSCIENCEANDMATH COMPUTERSCIENCE

DAVIDSTUTZ

Check out the latest superpixel benchmark — Superpixel Benchmark (2016) — and let me know your opinion! @david_stutz
18thAUGUST2014

READING

A. A. Amini, T. E. Weymouth, R. C. Jain. Using Dynamic Programming for Solving Variational Problems in Vision. Transactions on Pattern Analysis and Machine Intelligence, 2002.
In the course of the lecture "Computer Vision II" by Prof. Leibe at RWTH Aachen University, we discussed contour based tracking as proposed in "Snakes: Active Contour Models" by Kass et al. and used dynamic programming to solve the resulting optimization problem. At this point, Amini et al. give a thorough discussion of how to use dynamic programming to solve variational problems in vision. This can be used to avoid a greedy approach to optimize the energy function of the "snake" (that is, the active contour used for tracking).

What is your opinion on the summarized work? Or do you know related work that is of interest? Let me know your thoughts in the comments below or using the following platforms: