CN1148975C - MPEG start code compatible overlay graphics encoding - Google Patents
MPEG start code compatible overlay graphics encoding Download PDFInfo
- Publication number
- CN1148975C CN1148975C CNB981168361A CN98116836A CN1148975C CN 1148975 C CN1148975 C CN 1148975C CN B981168361 A CNB981168361 A CN B981168361A CN 98116836 A CN98116836 A CN 98116836A CN 1148975 C CN1148975 C CN 1148975C
- Authority
- CN
- China
- Prior art keywords
- data
- data word
- color
- bit
- sequence
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 claims abstract description 24
- 230000006835 compression Effects 0.000 claims description 11
- 238000007906 compression Methods 0.000 claims description 11
- 230000001360 synchronised effect Effects 0.000 claims description 10
- 238000003780 insertion Methods 0.000 claims 2
- 230000037431 insertion Effects 0.000 claims 2
- 239000003086 colorant Substances 0.000 abstract description 5
- 230000005236 sound signal Effects 0.000 description 7
- 239000004744 fabric Substances 0.000 description 3
- 238000000926 separation method Methods 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
A method for coding image data sequence for n bit data words, each data word represents at most one kind of 2<n> kinds of colors of each pixel, n>1. The method is characterized in that it includes the steps of (a) identifying the i repeat continuous subsequence of special data word value in the image data sequence, the special data word value represents special color, here 1 <= i <= 2<n>; and (b) replacing the identified continuous sequence by a pair of n bit data words, the first data word of the said pair is the special data word data and the second data word of the pair is the binary of i-1.
Description
The present invention relates to such as the encoded video signal of the vision signal of encoding and the figure overlapping data such as closed caption, document, key entry text, roll screen text according to the MPEG-2 coding standard.The present invention be more particularly directed to encode and overlap on the method and system of graph data on the decompressed video data.
Announced the several encoding video standard of (for example the vision signal of compressing according to the syntax and semantics compressed video signal and the format of explication comprises the formating coding bit stream of compressed video with generation).The most popular Moving Picture Experts Group-2 of counting possibly.Referring to ISO/IEC 13818-1,2,3: the universal coding of moving image and related audio: system, video and audio frequency, Nov, 13,1994.Video compression according to Moving Picture Experts Group-2 comprises the room and time compression.
According to the MPEG-2 grammer, the bit stream that comprises encoding digital video signal is organized as follows.The image encoded data are organized as video sequence.Video sequence can comprise: the sequence extension of selection, and it can comprise adjustable decoding of certain limit and identification parameter; And/or user data (being called user data (0)).Video sequence also comprises the coded image that can select to be organized as one or more groups image.Every group of image comprises image encoded and can comprise optional user data (being called user data (1)).Every width of cloth image can comprise optional image encoding expansion and/or optional user data (being called user data (2)).Every width of cloth image can selectively be divided into sheet, and sheet is the macroblock sequence of adjacency on the single macro-block line.Every width of cloth picture further is divided into macro block.Each macro block is the luminance block of 2 * 2 arrays and the chrominance block on it of overlapping, and wherein each piece is 8 * 8 array pixel data.
Each structure in the above-mentioned laminated tissue structure, promptly video sequence, sequence extension, user data (0), image sets, image encoding expansion, user data (1), image, user data (2), sheet and macro block all start from unique initial code.According to MPEG-2, each initial code is 4 byte values, is made up of unique byte of three byte start code prefix and corresponding layering subsequently, for example 0x00 is used for image, and 0xA1-0xAF is used for sheet, and 0xB2 is used for user data, 0xB3 is used for sequence, and 0xB5 is used for expansion, and 0xB8 is used for image sets.Start code prefix is a bit string, and it is followed one 1 by 23 0 and forms.Therefore, for example video sequence starts from four-byte value: 0,000 0,000 0,000 0,000 0,000 0,001 1,011 0111.
Flow filament is the general term that is used for MPEG-2, refers to the bit stream of an encoded video, a coded audio or a kind of other type.Compiling of the flow filament that the term video frequency program refers to performance is relevant simultaneously.Except one or more video flow filaments and one or more audio frequency flow filament, single video frequency program can comprise the figure overlapping data flow filament that overlaps on above the decompressed video stream.For example, figure overlapping data can comprise as text or computer generation visual information by pattern generator closed caption information, subtitle, credit or out of Memory.
MPEG-2 does not have special regulation for coded graphics overlapping data.Utilize the dvd standard of MPEG-2 video standard and MPEG-2 system standard program stream, utilize the coded graphics overlapping data following grammer of (being called " sub-image data ") according to dvd standard.Pixel data is expressed as 2 bit data word sequences, wherein a kind of color of each each pixel of data word presentation video overlapping window line.Data word values " 00 " is represented the background colour (for example graph data overlap the video of the decoding and rebuilding on it) of each pixel.Data word values " 01 " is represented the pattern pixel or the main color of each pixel.Data word values " 10 " is represented first Accent colour of each pixel.Data word values " 11 " is represented second Accent colour of each pixel.The pixel data of every line of figure overlapping window scans from left to right.If detect any pixel color, the contiguous sequence that repeats of particular data value for example, then with following compressed value replacement contiguous sequence:
(1) if the pixel quantity of operation is 1-3, then operation connects the data word of indicating pixel color after replacing the binary representation (promptly 01,10 or 11) of pixel quantity;
(2) if the pixel quantity of operation is 4-15, then operation replaces pattern: 00, after connect the binary representation of 4 of pixel quantities in service, connect the data word of indication pixel color after again;
(3) if the pixel quantity of operation is 16-63, then operation replaces pattern: 0000, after connect the binary representation of 6 of pixel counts in service, again with the data word that connects the indication pixel color;
(4) if the pixel quantity of operation is 64-255, then operation replaces pattern: 0,000 00, after connect the binary representation of 8 of pixel quantities in service, connect the data word of indication pixel color after again; And
(5) if the pixel end of run in the end of figure overlapping window current line, then operation replaces pattern: 0,000 0,000 0,000 00, after connect pixel color.
Though DVD has utilized program stream, DVD is strict with sub-image data and is placed on not in the sub-picture pack such as the MPEG-2 data of the video of coding or voice data.DVD player in DVD, further provides special file structure and navigation data so that can be identified as sub-picture pack sub-picture pack and prevent that DVD player is decoded as coding video frequency data mistakenly with sub-image data.
In using, other does not have such regulation, for example in the broadcasted application.In the broadcasted application occasion, image overlapping data can be arranged in (such as a user data part of encoded video bit stream) or personal data flow filament on any one position of bit stream that comprises video frequency program.In this case, decoder must make himself and bit stream synchronous once in a while after bit stream begins.For example may need under following situation synchronously: decoder may be connected after bit stream begins; Decoder may be tuned to problematic bit stream from another bit stream; And/or decoder can't be synchronous because mistake receives bit stream data (for example in the passage noise being arranged).Now the situation of considering is, according to the dvd standard image encoded overlapping data multiplex of coding sub-image data in the broadcast video program of band bit stream.Connect the capable background colour of pattern pixel color whole piece after supposing that the whole piece of image overlapping window is capable and being.Such data are encoded as sequence 0,000 0,000 0,000 0,000 0,000 00,000 0,000 0001.Therefore last three bytes of coded graphics data sequence are similar to the MPEG-2 start code prefix.The data word of being followed according to this pattern back is with specific of imitation MPEG-2 initial code.Like this decoder just may attempt mistakenly with figure overlapping data in so identical initial code pattern synchronization and can't be correctly synchronous with bit stream.
Target of the present invention is the shortcoming that overcomes prior art.
The present invention realizes all types of target.According to an embodiment, the method and apparatus that provides is encoded to n bit data word graph data sequence.Each data word of graph data sequence is represented each pixel maximum 2
nA kind of in kind of the color, n＞1 here.Provide routine analyzer to be used for discerning contiguous sequence, the particular data value of the single particular color of indication, 1＜i＜2 here that the particular data word value repeats for i time in the graph data sequence
nEncoder links to each other with routine analyzer, and the contiguous sequence that is identified with the continuous replacement of n bit data word is right.This first right data word is a specific data word values and second data word is the binary representation of I-1.
According to another embodiment, the coded graphics data sequence provides a plurality of n bit data word, and each word is to a kind of color of each pixel indication except that particular color.The coded graphics data sequence also comprises at least one pair of n bit data word, and it is inserted between the plural n bit data word.This first right n bit data word is the data word values of indication particular color.Second n bit data word is the binary representation of digital i-1, and i is illustrated in the number of pixels that has particular color in the subsequence of graph data sequence before the coding here.
According to another embodiment, storage medium provides first storage area of a plurality of storage indications n bit data word of color except particular color.Storage medium also comprises at least one pair of second storage area, is used for storing indication particular color and a pair of n bit data word of representing i-1.
According to further embodiment, method and apparatus of the present invention is the graph data sequence of n bit data word with the graph data sequential decoding of coding.Each data word of graph data sequence is indicated each pixel maximum 2
nA kind of in kind of the color, n＞1 here.Device comprises routine analyzer, is used in the recognition coding graph data sequence in abutting connection with right n bit data word continuously, and it comprises specific data word values, after connect the binary representation of several i-1.Decoder links to each other right continuously with the particular data value replacement that repeats with i time with routine analyzer.
Fig. 1 shows the run length coding scheme according to one embodiment of the invention.
Fig. 2 shows second kind of run length coding scheme according to one embodiment of the invention.
Fig. 3 shows the end-end Code And Decode system according to the embodiment of the invention.
The present invention wherein wants figure and/or character data (being referred to as graph data) coding to inserting MPEG-2 encoded video program by being used for description.But, any code signal is inserted another bit stream to guarantee that inserting code signal is conspicuous with the bit stream synchronizing signal dissmilarity of inserting code signal for those skilled in the art.
Before describing Code And Decode graph data sequential system, coding techniques is described earlier.Fig. 1 shows the part of overlapping data window one-row pixels 100.Suppose that each pixel can get a kind of in 4 kinds of colors.For the different colored pixels of expression in graph data sequence 105, the graph data sequence must comprise the data word of n bit length, n=10g here
2(pixel color kind number).This moment, n=2 as shown in the figure, had data available word value 00 representatives of pixel 100-1,100-2,100-6,100-7,100-8,100-9,100-10,100-12,100-17,100-18,100-19 and 100-20 of background colour.Having the first non-background pixel color pixel 100-3,100-13 and 100-14 can represent with data word values 01.Having the second non-background pixel color pixel 100-4,100-5 and 100-20 can represent with data word values 10.Having the 3rd non-background pixel color pixel 100-11,100-15 and 100-16 can represent with data word values 11.
Do not compress graph data sequence 105 and comprise 20 data words, each word comprises 2 positions, 40 altogether.
Coding techniques according to the embodiment of the invention comprises the running length compressed format, but only to the data word compression of special value, promptly only represents single specific color of planting.As mentioned above, figure overlapping data generally comprise the background color pixel operation longer than other colour element distance.Therefore when the color of corresponding background color is chosen when being used for run length coding, the compression maximum.In addition, the overlay graphics data of overlapping window can check before coding, to determine the most frequent appearance or to comprise at most and/or the particular color of long running the compression that will produce maximum when promptly encoding.For example, consider to show the figure overlapping window of " anti-" text, promptly on the figure overlapping window rectangular area of even opaque color, text occurs with background colour.The specific even color of figure overlapping window rectangle part can each pixel and each palette of colors of palette lookup table of coded graphics data sequence be chosen to be the run length coding color by suitable data word value being distributed to not.In this case, reasonable is to download the palette lookup table, for example by the data flow that comprises with the multiplexed palette lookup table of coded graphics data sequence is provided.
And, select the suitable data value not similar with the initial code (or other synchronous code) of guaranteeing coded graphics sequence and any bit stream, the graph data sequence of coding is inserted into bit stream.As mentioned above, MPEG-2 adopts the front that the initial code of start code prefix is arranged, and prefix connects one 1 after by 23 zero-bits and forms.It is worthy of note, MPEG-2 usually allow before start code prefix, to insert as required any amount zero with align data or be used for filling.Therefore, thus be to reduce zero-bit continuous in the coded graphics data sequence according to the purpose of coding techniques of the present invention all the time less than 23 zero-bits.Certainly, avoid different synchronous modes if desired, then can select different data values to be used for run length coding.
According to technology of the present invention, do not scan to discern the operation of particular data value compressing the graph data sequence.Rerun for 1-n time of particular data value and replace with a pair of n bit data word.This first right data word is simple escape.For simplicity, specific data word values is used as escape.Second data word is that the data word quantity i in service that is encoded subtracts 1 binary representation.Owing to have only the operation of maximum i=n data word once to substitute, and typical n data word length of data word operating ratio many, so the data word that may need several successive is moved the single of the particular value data word of encoding.
Consider example shown in Figure 1 now.Suppose that the particular data word value that is encoded is 00 of a corresponding background colour.As shown in the figure, the subsequence of pixel 100-1 and 100-2 produce i=2 data word values 00 in abutting connection with subsequence.This subsequence is replaced 00 01 by data word, and first data word 00 here is escape and second data word 01 is represented I-1=1.
Because represent pixel 100-3 is not specific data word values 00 to three data words of 100-5, so do not carry out run length coding.
The data word subsequence of i=4 is represented the color of pixel 100-6 to 100-9, the identified predetermined data value 00 that comprises.This subsequence is encoded to 00 11, and first data word 00 is escape and second data word is the binary representation of i-1 or 3 here.
The operation of the individual data value of remarked pixel 100-10 color is encoded as 00 00.Though remarked pixel 100-6 forms the operation of length 5 to the operation of the data word of 100-10 color, can utilize the long running of n=2 bit data word replacement to be i=4.Therefore this operation must be encoded to a pair of above data word.
The data value of remarked pixel 100-11 colour is not a run length coding.
The data value of remarked pixel 100-12 colour is encoded as 00 00.
Remarked pixel 100-13 is not a run length coding to the data value of 100-16 colour.
Remarked pixel 100-17 constitutes the operation of length I=3 to the data value of 100-19 colour.Therefore should operation replace with sequence 00 10.
The data value of remarked pixel 100-20 colour is not a run length coding.
Final coded sequence 106 is 00 01 01 10 10 00 11 00 00 11 00 00 01 01 11 11 00 1010, promptly 38 long.Typical situation is that compression level is higher than example shown in Figure 1 far away, and this is because being included in the figure overlapping window than long running of background color pixel, thereby will be with data word to replacing the operation many times of length i=4.
This data sequence can be before the palette lookup table or afterwards.In addition, palette lookup table data also can be placed on the diverse location of the multiplexed bit stream of graph data sequence.Palette lookup table data can be series of data words (for example each numerical value R, G, B and A are 8 long data words, and numerical value A is treated to the binary fraction of expression harmonic proportion here) simply.
Notice that above-mentioned coding techniques has been supposed when analysis betides the data word of sequential scanning graph data sequence.But this only is for convenience of explanation.Considering that the graph data sequence is general always generates by pattern generator is artificial, so can not need the scanning of this entire data word.In this case, pattern generator is reasonable is to insert suitable operation level coded data word to replace predetermined data value.For example, when generating the bitmap (bitmap generally is stored in the chip memory) of specific character or figure, pattern generator can insert the data of suitable running length compression simply.
The present invention also can be used for long data word.For example, as shown in Figure 2, suppose that each pixel can get in 8 color values.In this case, n=10g
28, promptly represent each color of pixel value with 3 long data words.Select data word values 000 to be used for run length coding, and this data value reasonable be to represent background colour.In this case, before coding, the data word that needs 22 length n=3 positions i.e. the uncoded graph data sequence 115 of totally 66 bit representations.But the graph data sequence 116 that only needs 45 bit representations coding.000 operation is discerned and is encoded to following predetermined data value:
(a) operation of the length i=1 of the data value of remarked pixel 110-1 color is encoded to 000 000;
(b) remarked pixel 110-3 is encoded to 000100 to the operation of the length i=5 of the data value of 110-7 color;
(c) remarked pixel 110-10 is encoded to 000001 to the operation of the length i=2 of the data value of 110-11 color;
(d) remarked pixel 110-13 is encoded to 000111 to the operation of the length i=8 of the data value of 110-20 color; And
(e) operation of the length i=1 of the data value of remarked pixel 110-21 color is encoded to 000 000;
In order to prevent to produce similar start code prefix, can do certain restriction to the size of n.Reasonable is that n is no more than 8 in MPEG-2 uses.
The decode procedure of coded graphics data sequence is as follows.Discern each that insert in the above-mentioned cataloged procedure substitute right.This can finish by the escape in the recognition sequence.Add the running length of determining to be omitted operation by second data word to every pair.The series of data words of tentation data word value replaces each right subsequently.Data word quantity in each alternative sequence equals from the right definite running length I of second data word of each identification.
Therefore in coded data word sequence 106, first pair 00 01 is identified and is replaced by sequence 00 00.Be identified and be replaced by sequence 00 00 00 00 for second pair 00 11.Be identified and be replaced by sequence 00 for the 3rd pair 00 00, the rest may be inferred.The graph data sequence of decoding has by this way produced original graph data sequence, and they can overlap with the figure that generates on the reconstruction video image that overlaps on decoding.
Referring to Fig. 3, structure and operation according to end-end system 200 of the present invention are described now.As shown in the figure, system 200 comprises encoder section 210 and decoder section 220.Encoder section 210 comprises video source 232, video encoder 234, audio-source 236, audio coder 238, pattern generator 241, routine analyzer 243, figure run-length coder 245, storage device 247, multiplexer 250, storage device 252 and transmitter 254.They are separately represented it is for convenience's sake.Utilize one or more similar installations can replace above-mentioned two or more this type of device, the DV Expert of one or more suitable programmed of C-Cube microsystems for example
TMThe video encoder integrated circuit.Decoder section 220 comprises receiver 262, multichannel separation 64, Video Decoder 272, overlapping generator 274, display monitor 276, audio decoder 266, speaker system 268, routine analyzer 281 and figure running length decoder 283.The same with decoder section 210, utilize single or multiple similar devices can replace the device of two or more decoder section 220, for example the ZiVA of one or more suitable programmed of providing of C-Cube microsystems
TMDecoder integrated circuit.
Video source 232 can be video camera, video editor, special-effect generator, CD, disk, video tape recorder etc.The vision signal of video source 232 outputs is by video encoder 234 codings.Reasonable is that vision signal is encoded according to Moving Picture Experts Group-2.
Audio-source 236 can be microphone, audio editing device, CD, disk, video tape recorder or recorder etc.The audio signal of audio-source 236 outputs is compressed in audio coder 238.Reasonable is that audio signal is placed in the system level data stream according to the mpeg audio standard code and according to Moving Picture Experts Group-2.
Pattern generator 241 produces unpressed graph data sequence.Unpressed graph data sequence delivery is to routine analyzer 243.Routine analyzer 243 or pattern generator 241 can comprise preliminary sweep that palette generator (not shown) is used for finishing packed data not to select the highest particular color of the long running frequency of occurrences or to produce optimum compression (minimum amount of coded data).The palette generator distributes or the reallocation data value subsequently as required, thereby the data word values that will replace/compress (being 00 in this case) is distributed to the color of selected compression.In addition, the palette generator produces the part of palette lookup table data flow as graph data sequence or separated flow,
Routine analyzer 243 is discerned the operation of particular data word values, for example represents the data word values 00 of background colour pixel.Figure run-length coder 245 is subsequently by replacing this operation to come with the encode operation of particular data word value of each identification of running length mode with one or more pairs of data words.As mentioned above, this first right data word is escape, such as specific data word values.Second data word is that running length subtracts one.As mentioned above, the function of pattern generator 241, routine analyzer 243 and figure run-length coder 245 can be combined in the single assembly, finishes above-mentioned graph data generation, identification and alternative steps simultaneously.The coded graphics data sequence that figure run-length coder 245 produces can directly output to multiplexer 250, output to multiplexer 250 and storage device 247 simultaneously, perhaps at first output to storage device 247 and output to multiplexer 250 from storage device 247 then.
The graph data sequence of the vision signal of multiplexer 250 received codes, the audio signal of coding and coding (with the palette lookup table data flow of selecting), and multiplexed together to them to generate multiplexed bit stream (for example compatible transport stream of MPEG-2 or MPEG-2 compatible program stream).The graph data sequence is inserted bit stream thus.As mentioned above, bit stream comprises various synchronous codes, for example various initial codes.But the graph data sequence of coding forms in some way, thereby does not have start code prefix, with any initial code dissmilarity.
The graph data sequence (with the palette lookup table data flow of selecting for use) of coding can in-line coding vision signal, for example insert one of them user data part.In this case, multiplexed can the finishing of coded graphics data sequence (with the palette lookup table data flow of selecting for use) with the multiplexer/inserter of video encoder 234 inside.
The bitstream recording that multiplexer 250 produces is in storage device 252 (for example disk, CD, video tape etc.).Bit stream also can offer transmitter 254.Bit stream also can offer storage device 252 earlier, reproduces from storage device 252 subsequently and offers transmitter 254.Transmitter 254 can be broadcast modulator or storage media replication device (for example magnetic tape station, disc driver, CD master-disc producing device etc.).
In storage device 247 or 252, provide storage area (for example piece, memory track etc.) for whole coding video frequency data sequence.First group of storage area stored inoperative compresses in length data word, promptly comprises the data word of corresponding non-background colour data word values.In order to store every pair of escape (predetermined data word), a pair of storage area is provided and has replaced running length to subtract one (i-1).If optional palette lookup table data flow is provided, then storage device is reasonable is the storage area that comprises one or more storage palette lookup table data flow.
The first-class receiver 262 of playback that bit stream can be broadcasted demodulator, media playing apparatus receives.The bit stream that receives is separated by multichannel, promptly is separated into composition encoded video signal, coding audio signal and coded graphics data sequence (and optional palette lookup table data flow) by demultiplexer 264.
Coded graphics data sequence (with optional palette lookup table data flow) can be inserted encoded video signal (for example in the user data part).In this case, the operation of separation coded graphics data sequence (with optional palette lookup table data flow) is reasonable is to be finished by the demultiplexer/routine analyzer that is positioned at Video Decoder 272 inside.
For the bit stream of multichannel separation correctly, demultiplexer 264 comprises the synchronizer (not shown) of initial code in identification and the synchronous bit stream.Because the uniqueness of initial code, the video signal portions that demultiplexer 264 can identification selection and with they as bit stream locking relatively synchronously inner/basis of aliging.
The audio signal of coding receives at audio decoder 266 places of decoding and reconstructed audio signals.Decoding, the audio signal of rebuilding are output to speaker system 268 to be reproduced at the appropriate time.
The vision signal of coding receives at Video Decoder 272 places of decoding and reconstruction video signal.Decoding, the vision signal of rebuilding are output to figure overlapping generator 274.If optional palette lookup table data flow is provided, then can export to figure overlapping generator 274 from demultiplexer 264 or Video Decoder 272.
Video Decoder 272 also can/alignment inner tracking/routine analyzer mechanism synchronous to each bit stream part.Utilize identification and synchronous bit stream initial code synchronizer also can realize.
The graph data of coding receives at routine analyzer device 281 places.The running length that replacement is followed in every pair of back of routine analyzer 281 identifications subtracts the data word of the formation escape (tentation data word) of one (i-1).Figure path length decoder 283 utilizes running length (the subtracting) i-1 of identification to replace amounting to the right of 1 repeating sequences identification by particular data word.The graph data of decoding exports figure overlapping generator 274 subsequently to.
Figure overlapping generator 274 utilizes the graph data word sequence of decoding and the suitable figure of optional palette lookup table data flow generation to overlap.The palette lookup table that figure overlapping generator 274 will (the palette lookup table data flow that go multichannel to separate from bit stream) this machine storage device of packing into particularly.Figure overlapping generator 274 utilizes the pixel color of the data word definition of series of data words to rebuild figure overlapping window to indicate corresponding color data in the palette lookup table subsequently.The figure overlapping window of rebuilding overlaps on the video image of decoding, reconstruction with proper spacing (being suitable decoding and rebuilding video image number) between in due course.Formed video image (being to have image to overlap on it or mediation) exports monitor 276 subsequently at the appropriate time to and shows.
The spirit and scope of the present invention are limited by following claims.
Claims (25)
1. the method for the graph data sequence of the n bit data word of encoding, each data word are indicated a kind of in the maximum 2n kind of each pixel color, and n＞1 is characterized in that comprising following steps:
(a) identification particular data word value repeats for i time in described graph data sequence in abutting connection with subsequence, and specific data word values is indicated specific color, 1≤i≤2 here
nAnd
(b) being replaced by a pair of n bit data word in abutting connection with subsequence of described identification,, the described first right data word is a described specific data word values and the described second right data word is the binary representation of i-1.
2. the method for claim 1 is characterized in that the subsequence of repeating each other adjacency of described particular data word value in the described graph data sequence is repeated described identification and alternative steps.
3. method as claimed in claim 2 is characterized in that further may further comprise the steps:
(c) insertion of coded graphics data sequence is comprised in the bit stream of other hierarchical coding data, the hierarchical coding data comprise a plurality of unique initial codes of being convenient to discern in the described bit stream that are distributed in, thereby can described bit stream begin to locate with start bit beyond the bit synchronization of described bit stream, wherein said replacement step has been removed and similar each the seat sequence of described unique initial code.
4. the method for claim 1 is characterized in that described particular data word indication background colour.
5. the method for claim 1 is characterized in that further may further comprise the steps:
(c) and (b) before, select a particular color that image overlaps as described particular color in execution in step (a); And
(d) described particular data value is distributed to specific color.
6. method as claimed in claim 5 is characterized in that the color of selecting step further to comprise definite which described figure overlapping pixels produces optimal compression.
7. method as claimed in claim 5 is characterized in that further may further comprise the steps:
(e) make that each described data word values is mapped to the palette lookup table and the described coded graphics data sequence of particular color is multiplexed.
8. the method for the coded graphics data sequence of a graph data sequence that forms expression n bit data word, each data word is indicated each pixel maximum 2
nA kind of in kind of the color, n＞1 is characterized in that comprising:
(a) a plurality of n bit data word are set, each n bit data word has a value indication each color of pixel except that particular color, and
(b) right at the consecutive order of at least one n bit data word of the inner distribution of described a plurality of data words, the described first right data word is the binary representation of i-1 for the described second right data word of data word values of indicating particular color, and integer i satisfies 1≤i≤2 here
n, represent the pixel quantity of particular color in the described graph data sequence.
9. the device of the graph data sequence of the n bit data word that is used to encode, each data word is indicated each pixel maximum 2
nA kind of in kind of the color, n＞1 is characterized in that comprising:
(a) routine analyzer, be used in described graph data sequence i repetition of identification particular data word value in abutting connection with subsequence, specific data word values is represented specific color, here 1≤i≤2
nAnd
(b) encoder that links to each other with described routine analyzer makes being replaced by a pair of n bit data word in abutting connection with subsequence of described identification, and the described first right data word is a described specific data word values and the described second right data word is the binary representation of i-1.
10. device as claimed in claim 9, each that it is characterized in that described routine analyzer and encoder constantly the particular data word value repeats described in the described graph data sequence of identification other in abutting connection with subsequence and make described identification other replace by a pair of n bit data word in abutting connection with subsequence.
11. device as claimed in claim 10 is characterized in that further may further comprise the steps:
(c) multiplexer, be used for the insertion of coded graphics data sequence is comprised in the bit stream of other hierarchical coding data, the hierarchical coding data comprise a plurality of unique initial codes of being convenient to discern that are distributed in the described bit stream, thereby can described bit stream begin to locate with start bit beyond the bit synchronization of described bit stream, wherein said replacement step has been removed and similar each the seat sequence of described unique initial code.
12. device as claimed in claim 9 is characterized in that described particular data word indication background colour.
13. device as claimed in claim 9 is characterized in that further comprising:
(c) palette generator was used for before described routine analyzer is discerned described repeat for i time, and the particular color of selecting an image overlapping is as described particular color, and described particular data value is distributed to specific color.
14. device as claimed in claim 13 is characterized in that the further color generation optimal compression of definite which described figure overlapping pixels of described palette generator.
15. device as claimed in claim 13 is characterized in that further comprising:
(e) multiplexer is used for making that each described data word values is mapped to the palette lookup table and the described coded graphics data sequence of particular color is multiplexed.
16. one kind is the method for the graph data sequence of n bit data word with the coded graphics decoded data sequence, each data word is represented each pixel maximum 2
nA kind of in kind of the color, n＞1 is characterized in that comprising following steps:
(a) identification comprises that the adjacent continuous of n bit data word of particular data word numerical value is right in described coded graphics data sequence, and specific data word values represents to connect after the specific color binary representation of i-1,1≤i≤2 here
nAnd
(b) described particular data value replacement to repeating continuously by i time.
17. method as claimed in claim 16, it is characterized in that repeating described identification and alternative steps for the continuous subsequence of repetition of particular data word numerical value described in the described graph data sequence, described coded graphics data sequence comprises described particular data word numerical value, and the particular data value number of repetition that the alternative continuous subsequence of a plurality of responses is followed in the back subtracts one binary representation.
18. method as claimed in claim 16 is characterized in that further may further comprise the steps:
(c) separate the bit stream that comprises other hierarchical coding data from described coded graphics data sequence, coded data comprises a plurality of unique initial codes of being convenient to discern that are dispersed in the described bit stream, described separating step be included in described bit stream begin to locate with start bit beyond the bit synchronous step of described bit stream.
19. method as claimed in claim 16 is characterized in that described particular data represents background colour.
20. method as claimed in claim 16 is characterized in that further may further comprise the steps:
(c) remove multiplexed palette lookup table from described coded graphics data sequence; And
(d) utilize the described palette lookup table of decoded data word indexing of described graph data sequence to determine to distribute to the color of pixel of each figure overlapping window.
21. one kind is the device of the graph data sequence of n bit data word with the coded graphics decoded data sequence, each data word is represented each pixel maximum 2
nA kind of in kind of the color, n＞1 is characterized in that comprising:
(a) routine analyzer is used in described coded graphics data sequence i time of identification particular data word numerical value to repeat continuous subsequence, the specific specific color of data word numeric representation, and the binary representation of several i-1 is followed in the back, here 1≤i≤2
nAnd
(b) decoder that links to each other with described routine analyzer, it replaces i repetition of described particular data value with the continuous subsequence of described identification.
22. device as claimed in claim 21, it is right to it is characterized in that described routine analyzer is discerned the n bit data word consecutive order of particular data word numerical value described in the described coded graphics data sequence, the coded graphics data sequence comprises described special value word, the described particular data word numerical value number of repetition that corresponding replaced continuous subsequence is followed in the back subtracts one binary representation, described decoder with other n bit data word order of described identification to substituting the described corresponding continuous subsequence of described particular data value.
23. device as claimed in claim 22 is characterized in that further comprising:
(c) multiplexer, be used for separating the bit stream that comprises other hierarchical coding data from described coded graphics data sequence, coded data comprises a plurality of unique initial codes of being convenient to discern that are dispersed in the described bit stream, described go multiplexer also be used for described bit stream begin to locate with start bit beyond the bit synchronization of described bit stream.
24. device as claimed in claim 21 is characterized in that described particular data represents background colour.
25. device as claimed in claim 21 is characterized in that further comprising:
(c) remove multiplexer, be used for from the coded graphics data sequence, going multiplexed palette lookup table; And
(d) figure overlapping generator, it utilizes the described palette lookup table of decoded data word indexing of described graph data sequence to determine to distribute to the color of pixel of each figure overlapping window.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US11140698A | 1998-07-07 | 1998-07-07 | |
| US09/111406 | 1998-07-07 | ||
| US09/111,406 | 1998-07-07 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1241871A CN1241871A (en) | 2000-01-19 |
| CN1148975C true CN1148975C (en) | 2004-05-05 |
Family
ID=34392812
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB981168361A Expired - Fee Related CN1148975C (en) | 1998-07-07 | 1998-07-30 | MPEG start code compatible overlay graphics encoding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1148975C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2112764A1 (en) * | 2008-04-25 | 2009-10-28 | Thomson Licensing | Method for encoding a sequence of integers, storage device and signal carrying an encoded integer sequence and method for decoding a sequence of integers |
| US9654777B2 (en) | 2013-04-05 | 2017-05-16 | Qualcomm Incorporated | Determining palette indices in palette-based video coding |
| US9826242B2 (en) * | 2014-03-14 | 2017-11-21 | Qualcomm Incorporated | Palette-based video coding |
| US10178395B2 (en) * | 2014-09-30 | 2019-01-08 | Qualcomm Incorporated | Explicit signaling of escape sample positions in palette coding mode for video coding |
| US9877029B2 (en) * | 2014-10-07 | 2018-01-23 | Qualcomm Incorporated | Palette index binarization for palette-based video coding |
| US9466124B2 (en) * | 2014-11-10 | 2016-10-11 | Intel Corporation | Compression using index bits in MSAA |
| CN112600565B (en) * | 2020-12-18 | 2024-12-17 | 上海集成电路研发中心有限公司 | Run-length decoding digital circuit |
-
1998
- 1998-07-30 CN CNB981168361A patent/CN1148975C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1241871A (en) | 2000-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5295203A (en) | Method and apparatus for vector coding of video transform coefficients | |
| CN1122999C (en) | Multi-stream search method and device | |
| CA2292106C (en) | Forward error correction at mpeg-2 transport stream layer | |
| US8938000B2 (en) | Transcoding system using encoding history information | |
| EP1326449B1 (en) | Data decoding method and decoding system | |
| CN1110199C (en) | Waveform generator for insertion of data into digital television signals | |
| WO1996020557A1 (en) | Picture information encoding/decoding system | |
| CN1236525A (en) | Video transmission apparatus using MPEG-2 compatible intraframe-only video compression | |
| KR20000069135A (en) | Device and method for generating encoded stream, system and method for transmitting data, and system and method for edition | |
| CN1148770A (en) | Digital video data encoding and decoding device and method for eliminating subtitle data noise | |
| US6721492B1 (en) | Signal processing apparatus and method, recording apparatus, playback apparatus, recording and playback apparatus, and stream processing apparatus and method | |
| USRE41180E1 (en) | Method for encoding and decoding moving picture signals | |
| EP0961505A2 (en) | Sub-picture encoding apparatus and method | |
| CN1148975C (en) | MPEG start code compatible overlay graphics encoding | |
| CN1090872C (en) | Method and device for compensating insufficient brightness caused by color signal processing | |
| KR20000022500A (en) | Method of encoding information, its encoder, its decoding/ synthesizing method, its decoder/synthesizer and recording which those methods are recorded. | |
| JPH0946630A (en) | Image information recording device, image information reproducing device, and optical disc | |
| US7221406B2 (en) | Data creation method and data transfer method and apparatus | |
| CN1110194C (en) | Video isignal recording apparatus | |
| JP2829266B2 (en) | Image information encoding / decoding system | |
| JP3660416B2 (en) | Image data encoding / decoding system | |
| EP0558853A2 (en) | Recording medium and digital video-information recording/reproducing system | |
| US7474236B2 (en) | Method of and apparatus for transmitting digital data | |
| EP1069782A2 (en) | Method and apparatus for storing digital data transmitted together with an analog video signal | |
| JPH1098721A (en) | Image information encoding / decoding system |
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 | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |