Tree-structure-based grade tree aggregation-divided video image compression method

A tree structure, video image technology, applied in the direction of image communication, image coding, image data processing, etc., can solve the problems of increasing system cost and complexity, and achieve the effect of improving the compression effect

Inactive Publication Date: 2005-02-16
FUDAN UNIV
View PDF0 Cites 94 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, as the amount of data in the tree structure increases, the length of the three linked lists becomes longer and l

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
  • Tree-structure-based grade tree aggregation-divided video image compression method
  • Tree-structure-based grade tree aggregation-divided video image compression method
  • Tree-structure-based grade tree aggregation-divided video image compression method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0013] Each composition in the invention is discussed separately below.

[0014] 1. Tree structure division of discrete wavelet transform results

[0015] Discrete wavelet transform can use three-dimensional discrete wavelet transform, that is, perform discrete wavelet transform in row direction, column direction and time direction respectively. Each coefficient of the lowest frequency of the transformation result is used as the root node of a tree, and a tree structure is formed according to the following relationship. Suppose the size of the lowest frequency coefficient is W min ×H min , where W min and H min are the width and height of the lowest frequency subband of the lowest frequency frame, respectively.

[0016] 1) The method of finding the children of the root node The children are:

[0017]

[0018] 2) Two-dimensional children search method The children are:

[0019]

[0020] 3) Method for finding three-dimensional children The children are:

[0021] ...

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 method includes steps: first at encoding end, obtaining distribution of image energy on time and frequency domain through discrete wavelet transform; based on correlation between wavelet coefficient, wavelet coefficient in each order is divided according to tree structure; SPIHT encoding is carried out for wavelet coefficient of each tree; encoding result is deposited on encoding end momentarily; finally, results of encoding each tree are synthesized as a code stream in use for storing or transferring. The invention realizes video compression in high compression ratio and low degree of distortion by using less memory space, particular suitable to dedicated system realized through hardware.

Description

technical field [0001] The invention belongs to the technical field of video image compression, and in particular relates to a video image compression method based on hierarchical tree set division of a tree structure. Background technique [0002] The Hierarchical Tree Set Partitioning (SPIHT) algorithm fully considers the correlation between data, and also considers the characteristic that high-bit data is more important than low-bit data in the same data when encoding. So using the SPIHT method to compress and decompress video images can get a relatively high compression ratio without increasing the distortion of the decompressed results, so this method has received increasing attention. In the specific implementation process, the encoding system needs to establish three linked lists, namely the important pixel linked list (LSP), the unimportant pixel linked list (LIP) and the unimportant pixel set linked list (LIS). These three linked lists are used to record the tree st...

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
IPC IPC(8): G06T9/00H04N19/96
Inventor 华赟胡波徐晟高佳
Owner FUDAN UNIV
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