Sciweavers

1859 search results - page 132 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
CVPR
2006
IEEE
16 years 7 months ago
Semi-Supervised Classification Using Linear Neighborhood Propagation
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
Fei Wang, Changshui Zhang, Helen C. Shen, Jingdong...
JMLR
2012
13 years 7 months ago
Generic Methods for Optimization-Based Modeling
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
Justin Domke
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
17 years 6 days ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)
CVPR
2012
IEEE
13 years 7 months ago
Part-based multiple-person tracking with partial occlusion handling
Single camera-based multiple-person tracking is often hindered by difficulties such as occlusion and changes in appearance. In this paper, we address such problems by proposing a...
Guang Shu, Afshin Dehghan, Omar Oreifej, Emily Han...
177
Voted
CVPR
2003
IEEE
16 years 7 months ago
Learning Affinity Functions for Image Segmentation: Combining Patch-based and Gradient-based Approaches
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...
Charless Fowlkes, David R. Martin, Jitendra Malik