110 likes | 274 Views
Comparison Study on the Performance of Critically Sampled Pyramid vs. Over-Complete Pyramid. Overview. Introduction of multiresolution and pyramid coding Critically sampled and overcomplete pyramids Bit allocation and quantization Comparison and results. Multiresolution and Pyramid Coding.
E N D
Comparison Study on the Performance of Critically Sampled Pyramid vs. Over-Complete Pyramid
Overview • Introduction of multiresolution and pyramid coding • Critically sampled and overcomplete pyramids • Bit allocation and quantization • Comparison and results
Multiresolution and Pyramid Coding • Multiresolution offers excellent coding efficiency. • Multiresolution supports scalability. r=0.09, 0.23, 0.60, 1.00 bpp
2 2 2 2 2 2 2 2 Critically Sampled Pyramid H1 Q G1 Q H1 G1 + Input H0 Recon. G0 + Q H0 G0 Octave subband coding Channel Original Image Decomp. Subbands
Bit Allocation • Analytical form Critically sampled, open-loop oversampled • The “greedy” algorithm Close-loop oversampled where
Comparison of Rate-distortion Performance In general, critically sampled outperforms oversampled in terms of rate-distortion. Reason: oversampling.
Scalability Critically sampled Overcomplete PSNR = 28.4 dB PSNR = 28.4 dB PSNR = 27.2 dB PSNR = 27.2 dB PSNR = 23.8 dB PSNR = 20.9 dB PSNR = 25.8 dB PSNR = 22.8 dB
Number of Layers Critically sampled Overcomplete
Conclusions • Critically sampled pyramid outperforms the over-complete pyramid in terms of rate-distortion. • Coarse images from overcomplete pyramids show better subjective quality. • Other features of overcomplete pyramid: lower complexity, freedom in choosing filters, control of quantization noise.