Sciweavers

5263 search results - page 820 / 1053
» Open Constraint Optimization
Sort
View
ICIP
2010
IEEE
15 years 5 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
INFORMS
2010
147views more  INFORMS 2010»
15 years 4 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 3 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
CVPR
2011
IEEE
15 years 3 months ago
Learning A Discriminative Dictionary for Sparse Coding via Label Consistent K-SVD
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
Zhuolin Jiang, Zhe Lin, Larry Davis
246
Voted
CVPR
2011
IEEE
15 years 3 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang