Sciweavers

5331 search results - page 681 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ACCV
2010
Springer
15 years 1 months ago
Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
Lun Wu, Arvind Ganesh, Boxin Shi, Yasuyuki Matsush...
CVPR
2007
IEEE
16 years 8 months ago
Stereo Matching on Objects with Fractional Boundary
Conventional stereo matching algorithms assume color constancy on the corresponding opaque pixels in the stereo images. However, when the foreground objects with fractional bounda...
Wei Xiong, Jiaya Jia
MICCAI
2009
Springer
16 years 8 months ago
Estimating Orientation Distribution Functions with Probability Density Constraints and Spatial Regularity
High angular resolution diffusion imaging (HARDI) has become an important magnetic resonance technique for in vivo imaging. Current techniques for estimating the diffusion orientat...
Alvina Goh, Christophe Lenglet, Paul M. Thompson, ...
ICFCA
2009
Springer
16 years 1 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil