Sciweavers

518 search results - page 68 / 104
» Beating a Random Assignment
Sort
View
CVPR
2009
IEEE
16 years 9 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...
ICCV
2005
IEEE
16 years 4 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss
127
Voted
ECCV
2006
Springer
16 years 4 months ago
Learning and Incorporating Top-Down Cues in Image Segmentation
Abstract. Bottom-up approaches, which rely mainly on continuity principles, are often insufficient to form accurate segments in natural images. In order to improve performance, rec...
Xuming He, Richard S. Zemel, Debajyoti Ray
116
Voted
IPMI
2005
Springer
16 years 3 months ago
Unified Statistical Approach to Cortical Thickness Analysis
This paper presents a unified image processing and analysis framework for cortical thickness in characterizing a clinical population. The emphasis is placed on the development of d...
Moo K. Chung, Steve Robbins, Alan C. Evans
122
Voted
RECOMB
2007
Springer
16 years 2 months ago
GIMscan: A New Statistical Method for Analyzing Whole-Genome Array CGH Data
Genetic instability represents an important type of biological markers for cancer and many other diseases. Array Comparative Genome Hybridization (aCGH) is a high-throughput cytoge...
Yanxin Shi, Fan Guo, Wei Wu, Eric P. Xing