A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation

We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation algorithms are known, some of them, such as the fast marching method, are not applicable to the video segmentation problem since the front being computed does not advance monotonically. We study narrow-banding, pyramidal and a pyramidal/narrow-banding schemes that leads to a 70-fold time gain over the single-resolution scheme