Sciweavers

186 search results - page 19 / 38
» Fast Computation of Sparse Datacubes
Sort
View
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 11 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 4 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
CVPR
2004
IEEE
14 years 12 months ago
A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...
George Papandreou, Petros Maragos
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
13 years 11 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
PC
2010
101views Management» more  PC 2010»
13 years 4 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...