为什么图像压缩算法通过子块处理图像？ [英] Why do image compression algorithms process the image by sub-blocks?

问题描述

例如，考虑DFT或DCT。确切地说，由子块变换的图像和图像变换的整体之间的区别是什么？生成的文件大小更小吗？算法是否更有效？变换的图像看起来不同吗？感谢。

For instance, consider the DFT or DCT. Precisely, what would be the differences between an image transformed by sub-blocks, and an image transformed whole? Is the resulting file size smaller? Is the algorithm more efficient? Does the transformed image look different? Thanks.

推荐答案

它们的设计使它们可以使用并行硬件实现。每个块是独立的，并且可以在不同的计算节点上计算，或者共享到与您拥有的节点一样多的节点。

They are designed so they can be implemented using parallel hardware. Each block is independent, and can be calculated on a different computing node, or shared out to as many nodes as you have.

href =http://stackoverflow.com/questions/10780425/why-jpeg-compression-processes-image-by-8x8-blocks>为什么JPEG压缩通过8x8块处理图像？计算复杂性高。 I thing block_y_size ² ×block_y_size ²

Also as noted in an answer to Why JPEG compression processes image by 8x8 blocks? the computational complexity is high. I thing block_y_size² × block_y_size²

这篇关于为什么图像压缩算法通过子块处理图像？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！