http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-1083752-A1
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_14ba71eccbb5f65a22b78f39b3c6ffc3 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-423 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-428 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-63 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-61 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N7-50 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N7-32 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N7-26 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N11-04 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06T9-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M7-40 |
filingDate | 1999-09-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_79a56885455f8bb6f38c64b5c63c2887 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_7959398862d508c66b2346a75cd19bf4 |
publicationDate | 2001-03-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | EP-1083752-A1 |
titleOfInvention | Video decoder with reduced memory |
abstract | The video memory requisite of a decoder of compressed video sequencesncomprising the steps of decompressing the coded pictures, storing the relative datanin one or more buffers organized in the video memory, may be reduced by:n sub-sampling and recompressing the pictures after decompression andnbefore storing them in respective buffers of the video memory, deriving from an Lnmatrix representing the current picture to be compressed a sequence of sub-samplingnL i and H i sub-matrices obtained by constructing two sub-matrices L 1 andnH 1 of half the number of pixels of the starting matrix L, respectively by removingna progressively increased number of pixels and by interpolating the pixels of thenL 1 matrix and successive subtraction of the corresponding pixels removed fromnthe start matrix L and iterating this procedure using the sub-matrix L 1 as thenstarting matrix for deriving the successive matrix L i until a sub-matrix L n nconstituted by a single pixel is obtained, quantizing with a zero-returning quantizer said H i sub-matrices calculatednfrom the respective L i matrix with a Q i step greater than the Q i-1 step used for thensub-matrix H i-1 ; effecting a binary tree coding of the values of said matrices using zero-treenmarkers for identifying a whole tree branch constituted only of zeroes, effecting a Huffman coding of the most recurrent symbols leaving uncodednthe least recurrent symbols, having them preceded by an Escape symbol,naccording to a spatial prediction technique with variable length coding (CPLV); storing the data relative to the pictures in the form of sub-sampled,nrecompressed and CPLV coded blocks in respective video memory buffers; decoding the data relative to said sub-sampled and recompressed blocks ofnpixels; decompressing the decoded data of said blocks of pixels according to saidnspatial prediction technique with variable length coding (CPLV). |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11209511-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-112968751-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111711511-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111711511-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-03096700-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110276295-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11677969-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110531294-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110531294-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6879267-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/RU-2477575-C2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110276295-A |
priorityDate | 1999-09-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 123.