Image compression method based on vectors among k-order zero trees

A zero-tree and vector technology, which is applied in the field of image compression based on k-order zero-tree vectors, can solve the problems of affecting the quality of reconstructed images, low efficiency of synchronous information representation, repeated scanning, etc.

Inactive Publication Date: 2013-07-17
LIAONING NORMAL UNIVERSITY
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, these methods still spend a considerable amount of bit overhead on the synchronization information, which affects the quality of the reconstructed image (especially at low bit rates), and the synchronization information used to identify the position of important wavelet coefficients is inefficient. The phenomenon of repeated scanning for unimportant coefficients

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Image compression method based on vectors among k<th>-order zero trees
  • Image compression method based on vectors among k<th>-order zero trees
  • Image compression method based on vectors among k<th>-order zero trees

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0029] k Definition of order zero tree:

[0030] k The zero-order tree is a data structure used to represent the position information of the coefficients of the image after wavelet transformation. For any t-ary source tree with a height of h, if it starts from the bottom layer to the kth layer ( ) Wavelet coefficient values ​​corresponding to all nodes If all values ​​are less than the current threshold T, the source tree is called a zero-tree of order k.

[0031] The specific method of the present invention is as figure 1 Shown includes four steps: the wavelet transform of the lifting scheme of the original image, the main scan based on the k-order zero tree, the auxiliary scan (SAQ) and the adaptive arithmetic coding, and finally the code stream is formed.

[0032] Specific steps are as follows:

[0033] a. Perform wavelet transformation of the source image with a 5-level lifting scheme.

[0034] b. Initialize the information table and threshold;

[0035] b.1 Initialize the auxiliar...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an image compression method based on vectors among k-order zero trees. The image compression method is suitable for gradable compression of digit rates of digital images and capable of improving the code efficiency of the existing embedded images. The image compression method comprises firstly, finding zero trees under a current threshold from all sub-bands of images after wavelet decomposition according to the importance order and determining orders of the zero trees; then, establishing association among the zero trees through a vector representation method which records relative position relations among all orders of zero trees, wherein vectors connect root nodes of all k-order zero trees together and a coordinate of a next root node can be determined according to the position of the previous root node; and finally, coding significant coefficients by using successive approximation quantization based on a bit plane to guarantee the gradable characteristic of digit rates of formed code streams. By the aid of the image compression method, the repeated scanning times of insignificant coefficients can be reduced, bits of coding position information can be reduced, a representation mechanism of vectors among zero trees enables scattered zero trees to associate one another, and therefore expenses of synchronizing information in the existing zero tree coding algorithm are reduced.

Description

Technical field [0001] The invention relates to a digital image compression method, in particular to a data rate scalable compression suitable for digital images, which can improve the efficiency of existing embedded image coding based on k An image compression method for vectors between order zero trees. Background technique [0002] With the continuous development of network multimedia technology and its applications, people’s requirements for image coding continue to increase. This requires removing various redundancies on the premise of ensuring image quality, using as few bits as possible to characterize image information, and at the same time The image coding stream can well adapt to the fluctuation of network bandwidth and the decoding requirements of terminals with different computing capabilities. The scalability of the code stream of an image refers to the ability to use a part (or subset) of the code stream to produce a useful representation of the image, that is, the ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04N7/26H04N19/63H04N19/64
Inventor 宋传鸣王相海刘男汲海巍
Owner LIAONING NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products