Sciweavers

4886 search results - page 623 / 978
» Approximate Data Exchange
Sort
View
TVCG
2008
103views more  TVCG 2008»
15 years 6 months ago
Practical Box Splines for Reconstruction on the Body Centered Cubic Lattice
We introduce a family of box splines for efficient, accurate and smooth reconstruction of volumetric data sampled on the Body Centered Cubic (BCC) lattice, which is the favorable v...
Alireza Entezari, Dimitri Van De Ville, Torsten M&...
CGF
1998
116views more  CGF 1998»
15 years 6 months ago
A Light Hierarchy for Fast Rendering of Scenes with Many Lights
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
Eric Paquette, Pierre Poulin, George Drettakis
JVCIR
2010
162views more  JVCIR 2010»
15 years 5 months ago
Tetrolet transform: A new adaptive Haar wavelet algorithm for sparse image representation
In order to get an efficient image representation we introduce a new adaptive Haar wavelet transform, called Tetrolet Transform. Tetrolets are Haar-type wavelets whose supports ar...
Jens Krommweh
ICIP
2010
IEEE
15 years 4 months ago
High quality scanned book compression using pattern matching
This paper proposes a hybrid approximate pattern matching/ transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorit...
Alexandre Zaghetto, Ricardo L. de Queiroz
193
Voted
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud