— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Abstract— Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to simultaneously learn the names and appearances o...
Michael Jamieson, Afsaneh Fazly, Suzanne Stevenson...
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
—Medial representations of shapes are useful due to their use of an object-centered coordinate system that directly captures intuitive notions of shape such as thickness, bending...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...