Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
Given an arbitrary image, our goal is to segment all distinct
texture subimages. This is done by discovering distinct,
cohesive groups of spatially repeating patterns, called tex...
In this paper, we introduce a new approach for modeling
visual context. For this purpose, we consider the leaves of a
hierarchical segmentation tree as elementary units. Each
le...
Joseph J. Lim, Pablo Arbelaez, Chunhui Gu, and Jit...
We present an algorithm for detecting human actions
based upon a single given video example of such actions.
The proposed method is unsupervised, does not require
learning, segm...
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...
The intrinsic image decomposition aims to retrieve “intrinsic”
properties of an image, such as shading and reflectance.
To make it possible to quantitatively compare
differe...
Roger Grosse, Micah K. Johnson, Edward H. Adelson,...
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
We present a novel multi-view stereo method designed
for image-based rendering that generates piecewise planar
depth maps from an unordered collection of photographs.
First a di...
Sudipta N. Sinha, Drew Steedly and Richard Szelisk...
In this paper we pursue the task of aligning an ensemble
of images in an unsupervised manner. This task has
been commonly referred to as “congealing” in literature.
A form o...
Mark Cox, Sridha Sridharan, Simon Lucey, Jeffrey C...
We present a wide-baseline image matching approach
based on line segments. Line segments are clustered into
local groups according to spatial proximity. Each group is
treated as...