Fast Optimal Mass Transport for Dynamic Active Contour Tracking on the GPU

CDC(2007)

引用 4|浏览4
暂无评分
摘要
In computational vision, visual tracking remains one of the most challenging problems due to noise, clutter, occlusion, and dynamic scenes. No one technique has yet managed to solve this problem completely, but those that employ control- theoretic filtering techniques have proven to be quite successful. In this work, we extend one such technique by Niethammer et al. in which implicitly represented dynamically evolving contours are filtered using a geometric observer framework. The effectiveness of the observer hangs upon the solution of two major problems: (1) the calculation of accurate curve velocities and (2) the determination of diffeomorphic correspondence maps between curves for geometric interpolation. We propose the use of novel image registration techniques such as image warping and optimal mass transport for the solution of these problems which increase the performance of the framework and reduce algorithmic complexity. One major drawback to the original scheme, as it relies on PDE solutions, is its computational burden restricting it from real time use. We show that the framework can, in fact, run in near real time by implementing our additions to the framework on the graphics processing unit (GPU) and show better execution times for these algorithms than reported in recent literature.
更多
查看译文
关键词
computational complexity,computer vision,coprocessors,edge detection,filtering theory,geometry,image registration,interpolation,partial differential equations,tracking,algorithmic complexity,computational vision,contours filtering,control- theoretic filtering,curve velocities,diffeomorphic correspondence maps,dynamic active contour tracking,geometric interpolation,geometric observer framework,graphics processing unit,image warping,optimal mass transport,partial differential equation,visual tracking,active contour,real time,near real time,mass transport
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要