Sciweavers

4377 search results - page 491 / 876
» Mass problems and randomness
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 7 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
CVPR
2005
IEEE
16 years 8 months ago
Digital Tapestry
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov,...
CVPR
2008
IEEE
16 years 8 months ago
Image super-resolution as sparse representation of raw image patches
This paper addresses the problem of generating a superresolution (SR) image from a single low-resolution input image. We approach this problem from the perspective of compressed s...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
ECCV
2008
Springer
16 years 8 months ago
Fast Automatic Single-View 3-d Reconstruction of Urban Scenes
We consider the problem of estimating 3-d structure from a single still image of an outdoor urban scene. Our goal is to efficiently create 3-d models which are visually pleasant. W...
Olga Barinova, Vadim Konushin, Anton Yakubenko, Ke...
ECCV
2002
Springer
16 years 8 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára