Sciweavers

32 search results - page 3 / 7
» Using Lattices for Reconstructing Stemma
Sort
View
DGCI
2006
Springer
13 years 7 months ago
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
Sara Brunetti, Alain Daurat, Attila Kuba
ICIP
2004
IEEE
14 years 6 months ago
Scalable predictive coding by nested quantization with layered side information
An efficient scalable predictive coding method is proposed for the Wyner-Ziv problem, using nested lattice quantization followed by multi-layer Slepian-Wolf coders (SWC) with laye...
Huisheng Wang, Antonio Ortega
TVCG
2008
103views more  TVCG 2008»
13 years 5 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&...
ICIAP
2009
ACM
14 years 5 months ago
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
Zachary A. Garrett, Hideo Saito
CVPR
2008
IEEE
14 years 7 months ago
Superpixel lattices
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Ideally, every pixel within each superpixel region will be...
Alastair P. Moore, Simon Prince, Jonathan Warrell,...