2527 search results - page 120 / 506 » Discrete optimization in computer vision |
126
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
183
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
132
Voted
AI
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
146
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper studies automatic segmentation of multiple
motions from tracked feature points through spectral embedding
and clustering of linear subspaces. We show that
the dimensi...
109
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper we describe a method to learn parameters
which govern pedestrian motion by observing video
data. Our learning framework is based on variational
mode learning and a...