CN1874507A - Layered transmission method of multimedia video stream in real time - Google Patents
Layered transmission method of multimedia video stream in real time Download PDFInfo
- Publication number
- CN1874507A CN1874507A CN 200610027987 CN200610027987A CN1874507A CN 1874507 A CN1874507 A CN 1874507A CN 200610027987 CN200610027987 CN 200610027987 CN 200610027987 A CN200610027987 A CN 200610027987A CN 1874507 A CN1874507 A CN 1874507A
- Authority
- CN
- China
- Prior art keywords
- data
- frame
- packet
- layer
- service end
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The method can transmit a hierarchical video stream between the client side and serving side through network; with a splitting algorithm the serving side splits each frame in video stream into several data packet having the hierarchical sequence and outputs them to the network; the client side receives said data packets having the hierarchical sequence, and with the inverse operation of the splitting algorithm, restores said packets to each frame in video stream. The invention can be used in the transmission of video stream between the network terminal devices having different bandwidths and different capacities such as PC, PDA, mobile phone and set-top box.
Description
Technical field
The present invention relates to a kind of method of multi-media network transmission technique field, relate in particular to a kind of layered transmission method of multimedia video stream in real time, the multimedia synchronous broadcast that adapts to diverse network bandwidth and equipment is put.
Background technology
Rapid rise and extensive use along with all kinds of internet, the multimedia network broadcasting business increases day by day, and it is multi-platform to what broadcast, real-time and definition also require more and more higher, the multimedia network broadcasting business is play from traditional PC, develop into mobile notebook PDA, mobile phone, device plays such as set-top box.Because network bandwidth size and terminal equipment performance ginseng are inferior uneven, even difference is very big, this realizes bringing very hang-up just for the multimedia network broadcasting technology.The way that solves at present this difficult problem roughly has two: one, and each network bandwidth situation and mobile notebook situation are provided with alone server serve separately, the 2nd, utilization is based on the hierarchical coding of wavelet algorithm.Before a kind of solutions because service is classified, and equipment cost and system maintenance cost are very high, second workaround calculation requirement height need certain terminal be provided with the calculated performance requirement, and can not accurately reduce when reducing primitive frame.
Find through literature search prior art, Application No. is: US6,965,700, patent name is: Embedded and efficient low-complexity hierarchical image coder andcorresponding methods, this patent has been described a kind of codec, but it comprises three technology and a selecting technology.First technology: cut apart in sub-band transforms to two set, these two set are designated first set and second set respectively; First set is joined in the non-important set tabulation (LIS); The important pixel tabulation of initialization (LSP).Second technology: at the importance of critical value test two set in front; The important member of cutting apart two set according to the segmentation function corresponding with set; Important pixel is added among the LSP.Three technology improves the quantization of pixel among the LSP.The critical value corresponding performing step of three technology in front all can reduce after each step.The 4th step is optionally, by the common average information braiding importance figure that produces of second three technology.
This United States Patent (USP) be owing to need refine operation such as important pixel repeatedly when hierarchical coding, also will repeatedly such operation when multi-layer coding, and these operations have certain requirement for operational performance.
Summary of the invention
The object of the invention is at the deficiencies in the prior art and defective, a kind of layered transmission method of multimedia video stream in real time is provided, can adapt to the transmission of heterogeneous networks bandwidth and different performance terminal equipment multimedia video stream high-efficiency and low-cost, utilize the present invention can realize that a kind of method can be at PC, PDA, mobile phone, with broadcasting simultaneously on the different performance terminal equipment such as set-top box, and these terminal equipments can be at GPS, and CDMA is on the heterogeneous networks platforms such as ADSL.
The objective of the invention is to be achieved through the following technical solutions:
The layered transmission method of multimedia video stream in real time of the present invention, can be between client and service end video flowing by the Network Transmission layering, service end all exports each frame data in the video flowing to network according to the packet that decomposition algorithm resolves into several sequences that have levels; Client from network obtain the video flowing individual-layer data bag of orderly uninterrupted level of service end output, inverse operation according to decomposition algorithm, the individual-layer data bag is reverted to frame data of setting big or small video flowing, the perhaps harmless fully video flowing frame data that return to original size.
Described client and service end refer to user or server, and when the user's download data, the user is a client, and server then is a service end, and when uploading data, the user is a service end, and server then is a client.Pass through the video flowing of Network Transmission layering between service end and the client.Service end need be decomposed video stream data according to decomposition algorithm; Client is recovered required video flowing frame data according to the inverse operation of service end decomposition algorithm.
One section video stream data is made up of some video requency frame datas, and the object that the present invention will decompose is a primitive frame; The target of recovering is a primitive frame.Primitive frame can be encoded separately to each packet after decomposition; If, then after decoding, recover for being used for the data recovered bag through coding.Can add between client and the service end as H264, encryption algorithms such as XIVD, but code decode algorithm can only join after original frame data is decomposed and recover before the original frame data.Service end uses diagram method that one frame data A is resolved into A1, two packets of Q, and the Q packet is complete frame data, and frame sign is less than original frame data A, and the A1 packet is not complete frame data, and A1 has only to merge with Q and could form original frame data A.Claim that the A1 packet is the ground floor data, the Q packet is the 2nd layer data, perhaps is called layer data of the end one.Each decompose frame sign that the current bottom packet of gained can express, and successively reduce always less than primitive frame.Service end can resolve into frame data two-layer and two-layer above packet, the number of plies two-layer above is olation all with decompose for the first time identically, just decompose each time liking one deck packet of the current end.As follows as three layers of decomposition example: as to decompose for the first time, original frame data A is resolved into ground floor packet A1, current bottom packet Q1; Decomposition is for the second time resolved into second layer packet A2 with current bottom packet Q1 and the 3rd layer data bag is bottom packet Q.Decomposition method by that analogy more than three layers.Service end resolves into original frame data after the plurality of data bag, if needing coding then encodes separately to each packet, otherwise can upload packet, upload packet according to sending from the hierarchical sequence of bottom to high level, and begin continuously upwards from the bottom, send pre-set continuous which floor packet.When the client downloads multimedia video stream, the contrary order that decomposes the order of each frame according to server receives packet, promptly begin upwards to receive continuously the packet of the required number of plies, and once need download the continuous data bag of the uninterrupted sequence that can form a complete frame from the bottom.After packet received, client both can be recovered computing.Client is recovered frame data must be from the bottom, and order upwards successively merges.Foregoing bottom packet data itself is complete frame data, concerning the client that only needs frame data of the end, needn't remake recovery operation.It is as follows that three layer data bags recover example: three layer data bags are arranged, bottom Q, layer B second from the bottom and reciprocal according to the 3rd layer of C; Recover for the first time, bottom packet Q is merged into Q1 with reciprocal according to second layer packet B; Recover for the second time, Q1 and C are merged into A, so just recover to form the required multimedia video stream frame data of this user.Restoration methods by that analogy more than three layers.
Used diagram method among the present invention all is used in the analysis frames process of service end and the recovery frame process of client.Service end is determined the vegetarian refreshments that is decomposed according to chart of inquiry.Has only 0 and 1 value in the chart.In the chart 0,1 be the pixel of corresponding frame correspondence respectively, if the value in the frame pixel data correspondence graph is 0, then current point data is left for and is worked as anterior layer; If the value in the frame pixel data correspondence graph is 1, then current point data is left the current bottom for.Separated pixel data still is kept at respectively in the two-layer packet by original order.The generation of chart can preestablish, and also can calculate according to breath that video flowing is taken a message and produce.One frame data are decomposed respectively corresponding chart each time.If client determines that according to tabling look-up the frame pixel is merged into a frame.This chart needs in full accord, corresponding one by one with the used chart of decomposition.If current point value is 0 in the chart, then this layer corresponding points pixel data is filled into the frame respective pixel data position of this less important recovery, if current point value is 1 in the chart, then current bottom respective pixel data are filled into the frame respective pixel data position of this less important recovery.So just can recover these frame data.
Compared with prior art, the invention has the beneficial effects as follows: service end is passed through each frame data of multimedia video stream according to each sublevel is recovered the required size of frame, successively decompose, data volume before and after decomposing does not reduce or increases, each client downloads from the bottom continuous several packets that make progress from service end according to own required frame sign, needn't download by decomposing the entire packet that original frame data obtained.Can fall wide requirement of tail band and operational data amount like this, which floor packet the terminal equipment of diverse network bandwidth and various performances can select to download according to own environmental condition.Thereby multimedia video can be broadcasted on each network bandwidth and various performance terminal equipment to greatest extent.Because a cover service can solve various multimedia video sizes and broadcast simultaneously, thereby has fallen at the end equipment cost and system maintenance cost.The present invention can accurately go back primitive frame, this be based on the wavelet algorithm hierarchical coding can not accomplish.Because the present invention does not have complicated calculating, so the server device calculated performance is not had too high requirement, client is decomposed inverse operation to packet just can recover frame data, client does not need very strong operational performance yet.
Description of drawings
Fig. 1 of the present inventionly decomposes the multimedia video stream frame data from service end and recovers the frame data general illustration to client
Fig. 2 is a frame data decomposing schematic representation of the present invention, wherein, the current primitive frame of 2-a (12*6) pixel dot matrix, X and Q represent pixel; The chart of 2-b and the corresponding pixel of current primitive frame; After 2-c decomposed, current layer number can be taken as frame data and carry out encoding and decoding according to the bag pixel dot matrix that forms (9*6); After 2-d decomposes, the denotable complete frame of current bottom packet (6*3) pixel dot matrix.
Specific implementation
For a more clear understanding of the present invention, the present invention is described in further detail below in conjunction with drawings and Examples.
The present invention decomposes the multimedia video stream frame data from service end and comprises the following aspects content to client recovery frame data process:
See also Fig. 1, this is that the present invention decomposes the multimedia video stream frame data to client recovery frame data overview flow chart from service end.Realization of the present invention is divided into three steps: one. and service end is decomposed the stratified packet of several layers according to the requirement of setting with each frame frame data in the multimedia video stream.Two. according to the requirement of reality, can encode separately to each packet, the packet behind the coding still sends the corresponding number of plies according to original order according to the requirement of each client packet is to client, and client is to decoded packet data.This cataloged procedure is not necessarily looked actual requirement and is determined to have or not.If there is not encoding-decoding process, then decomposed data bag in the first step directly is sent to client according to the predefined number of plies.Three. client receives a string packet orderly, successively returns to needed frame data from the bottom to the upper strata.Thereby finish whole process of the present invention.
The most important process of realization of the present invention is decomposed the multimedia video stream frame data exactly.Please see Figure 2 embodiment.Wherein Fig. 2-a is a frame primitive frame pixel dot matrix, wide 12 pixels, high 6 row pixels; Fig. 2-b is a chart, and 6 line number words are corresponding with 6 row pixels among Fig. 2-a in the chart, and every row 12 numbers are corresponding with 12 pixels of corresponding row among Fig. 2-a; Fig. 2-c decomposes back residue pixel by primitive frame and is formed the pixel dot matrix, wide 9 pixels, high 6 row; Fig. 2-d is that primitive frame decomposes the formed pixel dot matrix of the select pixel in back, and it is current bottom packet, can represent complete frame data, and on visual effect, its expressed image is the same with primitive frame, and is just little than primitive frame.Pixel among Fig. 2-a decomposes among Fig. 2-c and Fig. 2-d according to the chart among Fig. 2-b, if the currency among Fig. 2-b is 0, then still be put among Fig. 2-c in proper order pixel corresponding with it among Fig. 2-a according to original front and back, if the currency among Fig. 2-b is 1, then pixel corresponding with it among Fig. 2-a still is put among Fig. 2-d in proper order according to original front and back.Contrast each among Fig. 2-b is worth the frame pixel among the exploded view 2-c in order, finally can form Fig. 2-c and Fig. 2-d.Decomposable process finishes like this, and frame data are separated into two packets.Two-layer if desired above packet, then can according to take a picture with method decompose current bottom packet and get final product.
It is algorithm for inversions of the algorithm of service end analysis frames data that client becomes the algorithm of frame data with data packet recovery.Still contrast Fig. 2, chart is put back into oneself pixel in order and has then recovered Fig. 2-a among Fig. 2-a among Fig. 2-c and Fig. 2-d contrast Fig. 2-b.Establish four pointer corresponding diagram 2-a, Fig. 2-b, Fig. 2-c and Fig. 2-d in the program, pointer from left to right, move from the top down, if being 0 pixel that Fig. 2-c current pointer is pointed to, the value that Fig. 2-b current pointer points to composes pixel location to Fig. 2-a pointer appointment, if being 1 pixel that Fig. 2-d current pointer is pointed to, the value that Fig. 2-b current pointer points to composes pixel location to Fig. 2-a pointer appointment, after assignment is finished, then (perhaps the pointer of Fig. 2-d) moves forward a pixel, carries out the recovery of next pixel again according to identical method with Fig. 2-b and Fig. 2-c.Thereby finally recover Fig. 2-a frame pixel dot matrix.
Claims (5)
1, a kind of layered transmission method of multimedia video stream in real time, can be between client and service end video flowing by the Network Transmission layering, it is characterized in that: service end all exports each frame data in the video flowing to network according to the packet that decomposition algorithm resolves into several sequences that have levels; Client from network obtain the video flowing individual-layer data bag of orderly uninterrupted level of service end output, inverse operation according to decomposition algorithm, the individual-layer data bag is reverted to frame data of setting big or small video flowing, the perhaps harmless fully video flowing frame data that return to original size.
2, the layered transmission method of multimedia video stream in real time as claimed in claim 1, it is characterized in that: described service end all resolves into each frame data in the video flowing packet of several sequences that have levels according to decomposition algorithm, wherein: a frame data A is resolved into A1, two packets of Q, the Q packet is complete frame data, frame sign is less than original frame data A, the A1 packet has only to merge with Q and could form original frame data A, claim that the A1 packet is the ground floor data, the Q packet is the 2nd layer data, perhaps is called layer data of the end one; Each decompose frame sign that the current bottom packet of gained can express, and successively reduce always less than primitive frame; One frame data are resolved into two-layer and two-layer above packet, the number of plies two-layer above is olation all with decompose for the first time identically, just decompose each time liking one deck packet of the current end.
3, as the layered transmission method of claim 1 or 2 described multimedia video stream in real time, it is characterized in that: described service end all resolves into each frame data in the video flowing packet of several sequences that have levels according to decomposition algorithm, be specially: the decomposition algorithm that decomposes adopts diagram method each time, determines the vegetarian refreshments that is decomposed according to tabling look-up; If the value in the frame pixel data correspondence graph is 0, then current point data is left for and worked as anterior layer; If the value in the frame pixel data correspondence graph is 1, then current point data is left the current bottom for; Separated pixel data still is kept at respectively in the two-layer packet by original order.
4, the layered transmission method of multimedia video stream in real time as claimed in claim 1, it is characterized in that: described frame data that the individual-layer data bag reverted to the video flowing of setting size, be specially: to the diagram method of frame data restoration methods employing each time, if determine that according to tabling look-up the frame pixel is merged into a frame; This chart needs in full accord with the used chart of decomposition, corresponding one by one, if current point value is 0 in the chart, then this layer corresponding points pixel data is filled into the frame respective pixel data position of this less important recovery, if current point value is 1 in the chart, then current bottom respective pixel data are filled into the frame respective pixel data position of this less important recovery, have so just recovered these frame data.
5, the layered transmission method of multimedia video stream in real time as claimed in claim 1, it is characterized in that: described client and service end refer to user or server, when the user's download data, the user is a client, server then is a service end, when the user uploaded data, the user was a service end, and server is a client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100279871A CN100411439C (en) | 2006-06-22 | 2006-06-22 | Layered transmission method of multimedia video stream in real time |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100279871A CN100411439C (en) | 2006-06-22 | 2006-06-22 | Layered transmission method of multimedia video stream in real time |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1874507A true CN1874507A (en) | 2006-12-06 |
| CN100411439C CN100411439C (en) | 2008-08-13 |
Family
ID=37484729
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100279871A Expired - Fee Related CN100411439C (en) | 2006-06-22 | 2006-06-22 | Layered transmission method of multimedia video stream in real time |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100411439C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425915B (en) * | 2007-10-30 | 2011-04-20 | 大唐移动通信设备有限公司 | Transmission method, system and device for hierarchy transmission data |
| CN101170393B (en) * | 2007-12-04 | 2011-07-20 | 腾讯科技（深圳）有限公司 | Data transmission method, data transmission device |
| CN101662680B (en) * | 2008-08-28 | 2012-07-04 | 华为技术有限公司 | Method, device and system for measuring video flow performance |
| CN104618804A (en) * | 2014-12-31 | 2015-05-13 | 山东泰信电子股份有限公司 | Method and system for obtaining television channel information |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU718453B2 (en) * | 1996-07-17 | 2000-04-13 | Sony Corporation | Image coding and decoding using mapping coefficients corresponding to class information of pixel blocks |
| JP2005142654A (en) * | 2003-11-04 | 2005-06-02 | Matsushita Electric Ind Co Ltd | Video transmitting apparatus and video receiving apparatus |
-
2006
- 2006-06-22 CN CNB2006100279871A patent/CN100411439C/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425915B (en) * | 2007-10-30 | 2011-04-20 | 大唐移动通信设备有限公司 | Transmission method, system and device for hierarchy transmission data |
| CN101170393B (en) * | 2007-12-04 | 2011-07-20 | 腾讯科技（深圳）有限公司 | Data transmission method, data transmission device |
| CN101662680B (en) * | 2008-08-28 | 2012-07-04 | 华为技术有限公司 | Method, device and system for measuring video flow performance |
| CN104618804A (en) * | 2014-12-31 | 2015-05-13 | 山东泰信电子股份有限公司 | Method and system for obtaining television channel information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100411439C (en) | 2008-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10798386B2 (en) | Video compression with generative models | |
| EP3278559B1 (en) | Training end-to-end video processes | |
| CN110072119B (en) | Content-aware video self-adaptive transmission method based on deep learning network | |
| WO2008021320A3 (en) | A scalable, progressive image compression and archiving system over a low bit rate internet protocol network | |
| CN1250289A (en) | Progressive 3D lattice encoding method and apparatus | |
| CN105100823B (en) | A kind of processing method, device, encoder and the decoder of adaptive media business | |
| CN102065295A (en) | Device and method for decoding a data stream for representing an image or image sequence | |
| CN111586412B (en) | High-definition video processing method, master device, slave device and chip system | |
| EP1886503A1 (en) | Compression and decompression of media data | |
| CN100411439C (en) | Layered transmission method of multimedia video stream in real time | |
| US11451836B2 (en) | Techniques and apparatus for PCM patch creation using Morton codes | |
| CN107295084A (en) | A kind of video editing system and method based on high in the clouds | |
| US11587263B2 (en) | Method and apparatus for enhanced patch boundary identification for point cloud compression | |
| US10904579B2 (en) | Method and apparatus for annealing iterative geometry smoothing | |
| CN105393481A (en) | Information processing device, information processing method, and program | |
| JP2005094578A (en) | Image server device, client device, moving image distribution method, program, and information recording medium | |
| CN1672421A (en) | Method and apparatus for performing multiple description motion compensation using hybrid predictive codes | |
| CN102075766A (en) | Video coding and decoding methods and devices, and video coding and decoding system | |
| CN111080729B (en) | Training picture compression network construction method and system based on Attention mechanism | |
| CN1454429A (en) | Multimedia communication terminal | |
| CN115942009A (en) | Remote video service handling method and device based on hybrid coding | |
| Jovanova et al. | Mpeg-4 part 25: A generic model for 3d graphics compression | |
| CN115665427A (en) | Live broadcast data processing method and device and electronic equipment | |
| Quinlan et al. | ALD: adaptive layer distribution for scalable video | |
| CN1396561A (en) | Code and decode device and method for key data of graphic animation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080813 Termination date: 20150622 |
|
| EXPY | Termination of patent right or utility model |