Sciweavers

774 search results - page 84 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICIP
2010
IEEE
14 years 11 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
PAMI
2011
14 years 8 months ago
Coded Strobing Photography: Compressive Sensing of High Speed Periodic Videos
—We show that, via temporal modulation, one can observe and capture a high-speed periodic video well beyond the abilities of a low-frame-rate camera. By strobing the exposure wit...
Ashok Veeraraghavan, Dikpal Reddy, Ramesh Raskar
SIAMIS
2010
190views more  SIAMIS 2010»
14 years 8 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
95
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama
ICCV
2011
IEEE
14 years 1 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert