Sciweavers

2100 search results - page 272 / 420
» Fundamentals of the problem
Sort
View
99
Voted
COCOON
2009
Springer
15 years 7 months ago
Online Tree Node Assignment with Resource Augmentation
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...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
252
Voted

Book
5396views
16 years 11 months ago
Markov Random Field Modeling in Computer Vision
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...
Stan Z. Li
120
Voted
CVPR
2009
IEEE
16 years 8 months ago
StaRSaC: Stable Random Sample Consensus for Parameter Estimation
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...
Jongmoo Choi, Gérard G. Medioni
123
Voted
CVPR
2009
IEEE
16 years 8 months ago
Convexity and Bayesian Constrained Local Models
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...
Ulrich Paquet (Imense Ltd)
CVPR
2006
IEEE
16 years 2 months ago
Intelligent Collaborative Tracking by Mining Auxiliary Objects
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...
Ming Yang, Ying Wu, Shihong Lao