Sciweavers

1594 search results - page 21 / 319
» Sampling and Reconstruction of Operators
Sort
View
DCC
2006
IEEE
14 years 7 months ago
Distributed Sampling and Compression of Scenes with Finite Rate of Innovation in Camera Sensor Networks
We study the problem of distributed sampling and compression in sensor networks when the sensors are digital cameras that acquire a 3-D visual scene of interest from different vie...
Nicolas Gehrig, Pier Luigi Dragotti
RT
1999
Springer
13 years 12 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
COMPGEOM
2006
ACM
14 years 1 months ago
A sampling theory for compact sets in Euclidean space
Abstract We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size and the recently introduced weak feature size. Based on...
Frédéric Chazal, David Cohen-Steiner...
ICASSP
2009
IEEE
14 years 2 months ago
Sampling signals with finite rate of innovation in the presence of noise
Recently, it has been shown that it is possible to sample non-bandlimited signals that possess a limited number of degrees of freedom and uniquely reconstruct them from a finite ...
Pier Luigi Dragotti, Felix Homann