We propose to bridge the gap between Random Field (RF) formulations for joint categorization and segmentation (JCaS), which model local interactions among pixels and superpixels, ...
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
— The new theory of compressive sensing enables direct analog-to-information conversion of compressible signals at subNyquist acquisition rates. We develop new theory, algorithms...
Jason N. Laska, Sami Kirolos, Marco F. Duarte, Tam...
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...