Download - Compression of Stereo Images
![Page 1: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/1.jpg)
John HamannVickey Yeh
Compression of Stereo Images
![Page 2: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/2.jpg)
OutlineBasic Algorithm
Color Compression
Motion Compensation
Conclusion
![Page 3: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/3.jpg)
Basic AlgorithmDiscrete Cosine Transform
Uniform QuantizationNo Quantization Tables
Directly Store the DC Coefficients
Huffman Code the AC CoefficientsNo Run-Length Encoding
Zip the Final Binary Stream
![Page 4: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/4.jpg)
Results
![Page 5: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/5.jpg)
Color CompressionAlgorithm A
Mode 0: Encode Cr, Cb Mode 1: Encode Cr, Cb + Cr Mode 2: Encode Cr, Cb – Cr
Algorithm A VariantMode 0: Encode Cb, Cr Mode 1: Encode Cb, Cr + Cb Mode 2: Encode Cb, Cr – CbPerforms Markedly Worse
![Page 6: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/6.jpg)
Algorithm A
![Page 7: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/7.jpg)
Algorithm A
![Page 8: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/8.jpg)
About 1% Improvement
![Page 9: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/9.jpg)
Algorithm B• Estimate Cb, Cr based on Y
• Cb = acb Y + bcb
• Cr = acr Y + bcr
• For each block• Intra-mode• Code acb , acr , bcb , bcb
• For small blocks,• Too expensive
• For large blocks,• Too much MSE
![Page 10: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/10.jpg)
Motion Compensation• Search for Nearest Match
• Make Decision Based on Lowest MSE
• Give Bonus to Certain Intervals to Cause Clustering of Motion Vectors
• Encode the Residuals Using DCT as Before
![Page 11: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/11.jpg)
Results
![Page 12: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/12.jpg)
ConclusionHuffman Coding then Zip outperforms
Run-Length Encoding then Huffman Coding
Color Compression Using Algorithm A3 Modes of Operation {Cb, Cb+Cr, Cb-Cr}Provides slight gainsLimited by nature of Cb and Cr
Motion CompensationDid not prove beneficial
![Page 13: Compression of Stereo Images](https://reader036.vdocuments.net/reader036/viewer/2022062310/56815dd0550346895dcbfa8f/html5/thumbnails/13.jpg)
Questions