Sciweavers

715 search results - page 26 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
ICIP
2004
IEEE
14 years 10 months ago
Progressive polygon encoding of segmentation maps
A new method for the lossy compression of segmentation maps is presented. In the first stage of the proposed algorithm, region boundary segments are coded, providing a coarse poly...
Marc Servais, Theodore Vlachos, Thomas Davies
COMPGEOM
2010
ACM
14 years 1 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
NIPS
1992
13 years 9 months ago
A Note on Learning Vector Quantization
Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...
Virginia R. de Sa, Dana H. Ballard
ICCV
2011
IEEE
12 years 8 months ago
Superpixels via Pseudo-Boolean Optimization
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
Yuhang Zhang, Richard Hartley, John Mashford, Stew...
AES
2005
Springer
137views Cryptology» more  AES 2005»
13 years 8 months ago
Design of a multimedia processor based on metrics computation
Media-processing applications, such as signal processing, 2D and 3D graphics rendering, and image compression, are the dominant workloads in many embedded systems today. The real-...
Nader Ben Amor, Yannick Le Moullec, Jean-Philippe ...