Sciweavers

3422 search results - page 579 / 685
» Random Subset Optimization
Sort
View
196
Voted
CVPR
2012
IEEE
13 years 5 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
152
Voted
CVPR
2009
IEEE
16 years 9 months ago
LidarBoost: Depth Superresolution for ToF 3D Shape Scanning
Depth maps captured with time-of-flight cameras have very low data quality: the image resolution is rather limited and the level of random noise contained in the depth maps is v...
Sebastian Schuon (Stanford University), Christian ...
131
Voted
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...
CVPR
2009
IEEE
16 years 8 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...