Sciweavers

27 search results - page 3 / 6
» Fast Resampling Using Vector Quantization
Sort
View
HIS
2009
13 years 5 months ago
An Efficient VQ-Based Data Hiding Scheme Using Voronoi Clustering
In this paper, we propose a vector quantization (VQ) -based information hiding scheme that cluster the VQ codeowrds according the codewords' relation on Voronoi Diagram (VD). ...
Ming-Ni Wu, Puu-An Juang, Yu-Chiang Li
CAGD
2005
113views more  CAGD 2005»
13 years 7 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
WSCG
2003
179views more  WSCG 2003»
13 years 9 months ago
Antipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...
Sebastiano Battiato, Alfredo Pulvirenti, Diego Ref...
ICIP
2007
IEEE
14 years 1 months ago
A VQ-Based Demosaicing by Self-Similarity
In this paper, we propose a learning-based demosaicing and a restoration error detection. A Vector Quantization (VQ)based method is utilized for learning. We take advantage of a s...
Yoshikuni Nomura, Shree K. Nayar
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
13 years 11 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale