Sciweavers

131 search results - page 23 / 27
» Colouring Random Regular Graphs
Sort
View
AI
2006
Springer
13 years 7 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
CVPR
2011
IEEE
13 years 3 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
ICML
2008
IEEE
14 years 8 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
IPMI
2011
Springer
12 years 11 months ago
Globally Optimal Tumor Segmentation in PET-CT Images: A Graph-Based Co-segmentation Method
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
Dongfeng Han, John E. Bayouth, Qi Song, Aakant Tau...
ICCV
2009
IEEE
2301views Computer Vision» more  ICCV 2009»
15 years 18 days ago
Class Segmentation and Object Localization with Superpixel Neighborhoods
We propose a method to identify and localize object classes in images. Instead of operating at the pixel level, we advocate the use of superpixels as the basic unit of a class s...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto