Fast resampling using vector quantization
We present a fast resampling scheme using vector quantization. Our method differs from prior work applying vector quantization to speeding up image and volume processing in two essential aspects. First, our method uses blocks with overlapping rather than disjoint extents. Second, we present a means of trading off smaller block sizes for additional computation. These two innovations allow vector quantization to be used in performing a broader class of operations. We demonstrate the performance of our method in warping both images and volumes, and have also implemented a ray-traced volume renderer utilizing this technique. Experiments demonstrate a speed up of 2–3 times over conventional resampling with minimal errors.
KeywordsMean Square Error Codebook Size Large Block Size Small Block Size Trilinear Interpolation
Unable to display preview. Download preview PDF.
- 1.J. L. Bentley and J. H. Friedman. Data structures for range searching. ACM Computing Surveys, 11(4):397–409, December 1979.Google Scholar
- 2.P. Cosman, K. Oehler, E. Riskin, and R. Gray. Combined vector quantization and adaptive histogram equalization. In SPIE Proc. Medical Imaging VI, 1992.Google Scholar
- 3.P. Cosman, K. Oehler, E. Riskin, and R. Gray. Combining vector quantization and histogram equalization. Information Processing Management, 28(6):681–686, 1992.Google Scholar
- 4.W. Equitz. A new vector quantization clustering algorithm. IEEE Trans. on Acoustics, Speech and Signal Processing, 37(10):1568–1575, 1989.Google Scholar
- 5.Y. Linde, A. Buzo, and R. Gray. An algorithm for vector quantizer design. IEEE Trans. on Communications, 28:84–95, 1980.Google Scholar
- 6.P. Ning. Applications of data compression to 3-d scalar field visualization. Technical report, Stanford University, 1993. PhD Dissertation.Google Scholar