10988 search results - page 1988 / 2198 » Algorithmic Folding Complexity |
158
Voted
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
160
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
145
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
147
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
141
click to vote
ADC
2010
Springer
14 years 10 months ago
2010
Springer
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...