Source:http://linkedlifedata.com/resource/pubmed/id/18249659
Switch to
Predicate | Object |
---|---|
rdf:type | |
lifeskim:mentions | |
pubmed:issue |
5
|
pubmed:dateCreated |
2008-2-5
|
pubmed:abstractText |
We propose an optimal buffered compression algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The MPEG-4 shape coding scheme consists of two steps: first, distortion is introduced by down and up scaling; then, context-based arithmetic encoding is applied. Since arithmetic coding is "lossless," the down up scaling step is considered as a virtual quantizer. We first formulate the buffer-constrained adaptive quantization problem for shape coding, and then propose an algorithm for the optimal solution under buffer constraints. Previously, the fact that a conversion ratio (CR) of 1/4 makes a coded image irritating to human observers for QCIF size was reported for MPEG-4 shape coding. Therefore, careful consideration for small size images such as QCIF should be given to prevent coded images from being unacceptable. To this end, a low bit rate tuned algorithm is proposed in this paper as well. Experimental results are given using an MPEG-4 shape codec.
|
pubmed:language |
eng
|
pubmed:journal | |
pubmed:status |
PubMed-not-MEDLINE
|
pubmed:issn |
1057-7149
|
pubmed:author | |
pubmed:issnType |
Print
|
pubmed:volume |
10
|
pubmed:owner |
NLM
|
pubmed:authorsComplete |
Y
|
pubmed:pagination |
686-700
|
pubmed:year |
2001
|
pubmed:articleTitle |
Optimal buffered compression and coding mode selection for MPEG-4 shape coding.
|
pubmed:affiliation |
Solid Streaming Inc., New York, NY 10005, USA.
|
pubmed:publicationType |
Journal Article
|