Video frequency compression encoding method for partitional arithmetics of three dimentional hierarchical tree sets

A technology of set division and video compression, which is used in image coding, digital video signal modification, television, etc.

Inactive Publication Date: 2006-10-18
FUDAN UNIV
View PDF1 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There is no essential difference between these two methods, and the transformation results are similar

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
  • Video frequency compression encoding method for partitional arithmetics of three dimentional hierarchical tree sets
  • Video frequency compression encoding method for partitional arithmetics of three dimentional hierarchical tree sets
  • Video frequency compression encoding method for partitional arithmetics of three dimentional hierarchical tree sets

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0061] The following takes the Salesman (352×288, 30 frames per second) video stream of the common intermediate format CIF (Common Intermediate Format) as an example to illustrate the specific implementation method. The entire implementation process is similar to figure 1 unanimous. Codec takes 8 frames as one OFG or one RFG.

[0062] A: Video stream processing

[0063] Divide the input video stream into the form of 8 original frames (OFG) and 8 residual frames (RFG). If it is an odd multiple of 8 frames ((2n+1)*8), that is, it is transmitted as an original frame group, then go to B for processing. If it is an even multiple of 8 frames (2n*8), the last frame after decoding the 2nd (n-1) video frame group should be recovered as The reference frame is subtracted from each frame in the 2nth video frame group and the reference frame to obtain 8 consecutive processed residual frames as the residual frame group, and then go to B.

[0064] B: wavelet transform

[0065] Step 1. ...

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 is a compression encoding method that is based on three dimension wavelet transform Shift-set partition in Hierarchical Trees based on time domain multi wavelet basis. It is improvement for video image three dimension wavelet transform compression encoding system. Considering real-time of video process, storage capacity of system, statistic characteristics of coefficient and Spiht encoding algorithm after wavelet transform, the invention introduces a method that is to further utilize time dependency of the video flow and to divide the video flow into OFG and RFG that is taken as encoding unit for processing. Meanwhile the time domain adopts the method combining Haar wavelet basis and Daubechies 9 / 7 wavelet basis.

Description

technical field [0001] The invention belongs to the technical field of video compression, and in particular relates to a three-dimensional hierarchical tree set partition (3D-DWT-SPIHT) video compression coding method. technical background [0002] Because wavelet transform overcomes the shortcomings of block effect and non-mosquito effect exposed by block transform coding in low bit rate environment, it has made great progress in image processing in recent years. figure 2 (a) Give a schematic diagram of a two-dimensional first-level wavelet decomposition (a total of 4 subbands: LL1, LH1, HL1, and HH1). LH1, HL1, and HH1 are the high-frequency parts of the first-level transformation, and LL1 is the low-frequency part of the first-level decomposition. part. figure 2 (b) is a schematic diagram of two-dimensional three-level wavelet decomposition (10 subbands in total), which generates LL2, LH2, HL2, and HH2 by performing wavelet decomposition on LL1, and then performs wavelet...

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 Patents(China)
IPC IPC(8): H04N7/26G06T9/00H04N19/63
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap