An Upper Limit of AC Huffman Code Length in JPEG Compression

Simple item page
dc.creatorHorie, Kenichi
dc.date2009-01-19
dc.date.accessioned2026-07-07T12:32:06Z
dc.date.available2026-07-07T12:32:06Z
dc.descriptionA strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14% to the maximum code-lengths. The proposed strategy can be adapted to other transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper code length limits for the respective processing blocks.
dc.descriptionUS patent application 11/947936
dc.identifierhttps://arxiv.org/abs/0901.2954
dc.identifierhttp://arxiv.org/abs/0901.2954
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216668
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.subjectComputational Engineering, Finance, and Science
dc.subjectComputer Vision and Pattern Recognition
dc.titleAn Upper Limit of AC Huffman Code Length in JPEG Compression
dc.typetext

Files

Collections

arXiv