Image Compression(DFS)

最新推荐文章于 2023-04-11 12:43:43 发布

漂流瓶终结者

最新推荐文章于 2023-04-11 12:43:43 发布

阅读量303

点赞数

分类专栏：练习文章标签： DFS

本文链接：https://blog.csdn.net/ZCMU_2024/article/details/81568764

版权

该博客讨论了一种基于图像区域分解的无损和有损图像压缩策略。使用深度优先搜索来创建表示图像的树结构，当区域颜色达到阈值百分比时停止分解。博客提供了示例和输入输出说明，解释了如何根据阈值压缩和解压图像。

摘要由CSDN通过智能技术生成

Description

Strategies for compressing two-dimensional images are often based on finding regions with high similarity. In this problem, we explore a particular approach based on a hierarchical decomposition of the image. For simplicity, we consider only bitmapped images such as the one on the right:

The image is encoded as a tree, with the root representing the entire image region. If a region is monochromatic, then the node for that region is a leaf storing the color of the region. Otherwise, the region is divided into four parts about its center, and the approach is applied recursively to each quadrant. For a non-leaf node, its four children represent the four quadrants ordered as upper-right, upper-left, lower-left, lower-right respectively.

As an example, on the right is the tree encoding of the above image.

The original image is not monochromatic, so we considered the four quadrants. The top-right quadrant is monochromatic white, so the first child of the root node is a leaf with value 0. The top-left quadrant is not monoch