2100 search results - page 272 / 420 » Fundamentals of the problem |
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
123
click to vote
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
The accurate localization of facial features plays a fundamental
role in any face recognition pipeline. Constrained
local models (CLM) provide an effective approach to localizati...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Many tracking methods face a fundamental dilemma in practice: tracking has to be computationally efficient but verifying if or not the tracker is following the true target tends t...