Sciweavers

117 search results - page 5 / 24
» Sparse reconstruction by separable approximation
Sort
View
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 2 months ago
Sparsity Equivalence of Anisotropic Decompositions
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...
Gitta Kutyniok
VMV
2003
165views Visualization» more  VMV 2003»
13 years 9 months ago
C1-Continuous Terrain Reconstruction from Sparse Contours
Contour lines from topographic maps are still the most common form of elevation data for the Earth’s surface and in the case of historical landscapes, they often are the only av...
Kai Hormann, Salvatore Spinello, Peter Schröd...
CGI
2009
IEEE
13 years 11 months ago
Automatic registration of color images to 3D geometry
We present an approach to automatically register a large set of color images to a 3D geometric model. The problem arises from the modeling of real-world environments, where surfac...
Yunzhen Li, Kok-Lim Low
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 9 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
ICIP
2007
IEEE
14 years 1 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...