Sciweavers

4451 search results - page 145 / 891
» On Random Ordering Constraints
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
158
Voted
ICCV
2003
IEEE
16 years 6 months ago
Stochastic Refinement of the Visual Hull to Satisfy Photometric and Silhouette Consistency Constraints
An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a tex...
John Isidoro, Stan Sclaroff
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
16 years 1 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz
ICPR
2008
IEEE
15 years 11 months ago
Video object segmentation based on graph cut with dynamic shape prior constraint
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
Peng Tang, Lin Gao
117
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...