Sciweavers

1378 search results - page 170 / 276
» The Tractability of Global Constraints
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CVPR
2006
IEEE
16 years 8 months ago
Accurate Face Alignment using Shape Constrained Markov Network
In this paper, we present a shape constrained Markov network for accurate face alignment. The global face shape is defined as a set of weighted shape samples which are integrated ...
Lin Liang, Fang Wen, Ying-Qing Xu, Xiaoou Tang, He...
ICCV
2007
IEEE
16 years 8 months ago
Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
Sudipta N. Sinha, Philippos Mordohai, Marc Pollefe...
ECCV
2006
Springer
16 years 8 months ago
Tracking Dynamic Near-Regular Texture Under Occlusion and Rapid Movements
We present a dynamic near-regular texture (NRT) tracking algorithm nested in a lattice-based Markov-Random-Field (MRF) model of a 3D spatiotemporal space. One basic observation use...
Wen-Chieh Lin, Yanxi Liu
ICML
2009
IEEE
16 years 7 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye