no code implementations • 5 Nov 2015 • Manjunath Narayana, Allen Hanson, Erik Learned-Miller
In particular, it is essential to have a background likelihood, a foreground likelihood, and a prior at each pixel.
no code implementations • 5 Nov 2015 • Manjunath Narayana, Allen Hanson, Erik Learned-Miller
In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussians at each pixel [7], to kernel density estimates at each pixel [1], and more recently to joint domainrange density estimates that incorporate spatial information [6].
no code implementations • 5 Nov 2015 • Manjunath Narayana, Allen Hanson, Erik Learned-Miller
Our goal is to develop a segmentation algorithm that clusters pixels that have similar real-world motion irrespective of their depth in the scene.