Sciweavers

67 search results - page 7 / 14
» Representing the space of linear programs as the Grassmann m...
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
14 years 9 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert
UAI
2004
13 years 10 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
ICPR
2004
IEEE
14 years 9 months ago
Selecting Models from Videos for Appearance-Based Face Recognition
In this paper, we propose an unsupervised approach to select representative face samples (models) from raw videos and build an appearance-based face recognition system. The approa...
Abdenour Hadid, Matti Pietikäinen
CPAIOR
2007
Springer
14 years 2 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus