Sciweavers

5580 search results - page 728 / 1116
» Randomized priority algorithms
Sort
View
192
Voted
CVPR
2009
IEEE
16 years 11 months ago
Learning color and locality cues for moving object detection and segmentation
This paper presents an algorithm for automatically detecting and segmenting a moving object from a monocular video. Detecting and segmenting a moving object from a video with limit...
Feng Liu (University of Wisconsin-Madison), Michae...
142
Voted
CVPR
2009
IEEE
16 years 11 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
149
Voted
CVPR
2009
IEEE
16 years 11 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
163
Voted
ICCV
2009
IEEE
16 years 9 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
CVPR
2000
IEEE
16 years 6 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu