PUMA publications for /user/thomasrichter/data;interactive%20information%20coding;protocols;trees%20(mathematics);jpeg%20syntax;image%20coding;jpeghttps://puma.ub.uni-stuttgart.de/user/thomasrichter/data;interactive%20information%20coding;protocols;trees%20(mathematics);jpeg%20syntax;image%20coding;jpegPUMA RSS feed for /user/thomasrichter/data;interactive%20information%20coding;protocols;trees%20(mathematics);jpeg%20syntax;image%20coding;jpeg2024-03-28T17:32:39+01:00Compressing JPEG 2000 JPIP Cache State Informationhttps://puma.ub.uni-stuttgart.de/bibtex/28d862d4875f17369fa4889bf997da9cc/thomasrichterthomasrichter2016-03-10T09:18:49+01:00browsing image cache coding;protocols;trees compression;JPIP 2000 scheme;http data;interactive requests;JPIP coding;Image compression;image resolution;Servers;Transform zero-tree protocol;medical adjustment algorithm;Context;Data information compression syntax;image request models;Encoding;Image data 2000;JPIP;Zero-Tree coding;JPEG model;embedded JPIP type databases;modified Coding server;cache state model (mathematics);JPEG <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thomas Richter" itemprop="url" href="/person/1a396d444799902c54008c5b834c47262/author/0"><span itemprop="name">T. Richter</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Data Compression Conference (DCC), 2012</span>, </em></span><em>Seite <span itemprop="pagination">13-21</span>. </em><em>Snowbird, Utah, USA, </em><em>IEEE, </em><em><span itemprop="publisher">IEEE</span>, </em>(<em><span>April 2012<meta content="April 2012" itemprop="datePublished"/></span></em>)</span>Thu Mar 10 09:18:49 CET 2016Snowbird, Utah, USAData Compression Conference (DCC), 20120413-21{C}ompressing {JPEG} 2000 {JPIP} {C}ache {S}tate {I}nformation2012browsing image cache coding;protocols;trees compression;JPIP 2000 scheme;http data;interactive requests;JPIP coding;Image compression;image resolution;Servers;Transform zero-tree protocol;medical adjustment algorithm;Context;Data information compression syntax;image request models;Encoding;Image data 2000;JPIP;Zero-Tree coding;JPEG model;embedded JPIP type databases;modified Coding server;cache state model (mathematics);JPEG JPEG 2000 part 9, or short JPIP, is an interactive image browsing protocol that allows the selective delivery of image regions, components or scales from JPEG 2000 image. Typical applications are browsing tools for medical databases where transmitting huge images from server to client in total would be uneconomical. Instead, JPIP allows extracting only the desired image parts for analysis by an http type request syntax. Such a JPIP connection may either operate in a session within which the server remains aware of the image data already cached at the client and it hence doesn't have to transmit again, or it may operate in a stateless mode in which the server has no model of the data already available on the client. In such cases, the client may include a description of its cache model within a proceeding request to avoid retransmission of data already buffered. Unfortunately, the standard defined methods how such cache models are described are very inefficient, and a single request including a cache model may grow several KBytes large for typical images and requests, making the deployment of a JPIP server on top of existing http server infrastructure rather inconvenient. In this work, a lossy and loss less embedded compression scheme for such JPIP cache model adjustment requests based on a modified zero-tree algorithm is proposed, this algorithm works even in constraint environments where request size must remain limited. The proposed algorithm losslessly compresses such cache model adjustment requests often better than by a factor of 1:8, but may even perform a 1:8000 compression in cases where the cache model has to describe a large number of precincts.