Directional pyramid coding method of image

Abstract

The invention discloses a directional pyramid coding method of an image. By changing a data structure of a traditional set partitioning in hierarchical tree (SPIHT) algorithm, a directional pyramid of coding of the algorithm is possible to realize. Because a directional pyramid SPIHT algorithm is characterized by being high in redundancy and practical, the directional pyramid SPIHT algorithm is put forward and is preferable, and therefore rebuilding effects of the whole, especially rebuilding effects of image edges and other features are better improved. The algorithm can effectively code and compress images applied to the field of machine visions.

Description

technical field [0001] The invention relates to the field of image compression, in particular to a method for image directional pyramid compression and encoding. Background technique [0002] 1. Signal transformation and image pyramid [0003] Signals are carriers of information. How to achieve effective representation of signals is a core issue in the field of signal processing. From a mathematical point of view, an image is a two-dimensional matrix of gray values. In an image, it is common to see regions of connected textures and similar gray levels that combine to form objects. If the object size is large or the contrast is strong (the overall image), usually only need to use a lower resolution ( figure 1 (a), (b)); if the size of the object is small or the contrast is not high (details of the image), it needs to be observed with a higher resolution ( figure 1 (c), (d)). If objects vary in size, or in contrast, it is advantageous to study them at several resolutions...

AI Technical Summary

Problems solved by technology

[0017] The main shortcoming of the direction pyramid is its over-completeness, and its over-completeness is where K is the number of direction subbands

Images