{ "types" : { "Bookmark" : { "pluralLabel" : "Bookmarks" }, "Publication" : { "pluralLabel" : "Publications" }, "GoldStandardPublication" : { "pluralLabel" : "GoldStandardPublications" }, "GoldStandardBookmark" : { "pluralLabel" : "GoldStandardBookmarks" }, "Tag" : { "pluralLabel" : "Tags" }, "User" : { "pluralLabel" : "Users" }, "Group" : { "pluralLabel" : "Groups" }, "Sphere" : { "pluralLabel" : "Spheres" } }, "properties" : { "count" : { "valueType" : "number" }, "date" : { "valueType" : "date" }, "changeDate" : { "valueType" : "date" }, "url" : { "valueType" : "url" }, "id" : { "valueType" : "url" }, "tags" : { "valueType" : "item" }, "user" : { "valueType" : "item" } }, "items" : [ { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter", "tags" : [ "approximation","coding","compression,","data","image","theory," ], "intraHash" : "b19e814cb901081dd96b3b75c7e2169f", "interHash" : "ac13db9d89542c1541c8aa333792bd81", "label" : "On the duality of rate allocation and quality indices", "user" : "thomasrichter", "description" : "", "date" : "2016-03-10 09:18:49", "changeDate" : "2016-03-10 08:20:00", "count" : 3, "pub-type": "inproceedings", "booktitle": "Picture Coding Symposium (PCS)","address":"Nagoya, Japan", "year": "2010", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5702484", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "pages": "270-273","abstract": "In a recent work, the author proposed to study the performance of still image quality indices such as the SSIM by using them as objective function of rate allocation algorithms. The outcome of that work was not only a multi-scale SSIM optimal JPEG 2000 implementation, but also a first-order approximation of the MS-SSIM that is surprisingly similar to more traditional contrast-sensitivity and visual masking based approaches. It will be seen in this work that the only difference between the latter works and the MS-SSIM index is the choice of the exponent of the masking term, and furthermore, that a slight modification of the SSIM definition reproducing the traditional exponent is able to improve the performance of the index at or below the visual threshold. It is hence demonstrated that the duality of quality indices and rate allocation helps to improve both the visual performance of the compression codec and the performance of the index.", "isbn" : "978-1-4244-7134-8", "doi" : "10.1109/PCS.2010.5702484", "bibtexKey": "richter2010duality" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2c85047df859005f7986bb1578173f85d/thomasrichter", "tags" : [ "2000;JPEG-LS;context","coding","coding;Image","coding;image","compression;image","compression;memory","compression;still","data","efficient","encoder;lossy","frame","images;temporal","lossless","lossy","management;Standards;Transform","modeling;embedded","prediction;Context;Encoding;Image","prediction;temporal-extended","reference","requirement;online","sequences;JPEG","sequences;Memory","sequences;lossless","systems;image" ], "intraHash" : "c85047df859005f7986bb1578173f85d", "interHash" : "847922d26840ff8773f866433e61443a", "label" : "Memory efficient lossless compression of image sequences with JPEG-LS and temporal prediction", "user" : "thomasrichter", "description" : "", "date" : "2016-03-10 09:18:49", "changeDate" : "2016-03-10 08:20:00", "count" : 5, "pub-type": "inproceedings", "booktitle": "Picture Coding Symposium (PCS), 2012", "year": "2012", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6213353", "author": [ "Zhe Wang","D. Chanda","S. Simon","T. Richter" ], "authors": [ {"first" : "Zhe", "last" : "Wang"}, {"first" : "D.", "last" : "Chanda"}, {"first" : "S.", "last" : "Simon"}, {"first" : "T.", "last" : "Richter"} ], "pages": "305-308","abstract": "In this paper, a lossless encoder for image sequences based on JPEG-LS defined for still images with temporal-extended prediction and context modeling is proposed. As embedded systems are one important field of application of the codec, on-line lossy reference frame compression is used to reduce the encoder's memory requirement. Variations of the pixel values in the reference frame due to lossy compression are acceptable since the predictor provides only estimations of the pixel values being encoded in the current frame. Larger variations decrease the final lossless compression performance of the encoder such that a trade-off between the memory requirement and the overall compression ratio is required. Different compression algorithms for the reference frame, including JPEG, JPEG 2000 and near-lossless JPEG-LS, and their impacts on the memory requirement and the overall lossless compression ratio have been studied. Experimental results show 9.6% or more gain in lossless compression ratio compared to applying the standard JPEG-LS frame-by-frame and 80% reduction in the encoder buffer size compared to storing the uncompressed reference frame.", "doi" : "10.1109/PCS.2012.6213353", "bibtexKey": "wang2012memory" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28d862d4875f17369fa4889bf997da9cc/thomasrichter", "tags" : [ "(mathematics);JPEG","2000","2000;JPIP;Zero-Tree","Coding","JPIP","adjustment","algorithm;Context;Data","browsing","cache","coding;Image","coding;JPEG","coding;protocols;trees","compression","compression;JPIP","compression;image","data","data;interactive","databases;modified","image","information","model","model;embedded","models;Encoding;Image","protocol;medical","request","requests;JPIP","resolution;Servers;Transform","scheme;http","server;cache","state","syntax;image","type","zero-tree" ], "intraHash" : "8d862d4875f17369fa4889bf997da9cc", "interHash" : "a396d444799902c54008c5b834c47262", "label" : "Compressing JPEG 2000 JPIP Cache State Information", "user" : "thomasrichter", "description" : "", "date" : "2016-03-10 09:18:49", "changeDate" : "2016-03-10 08:20:00", "count" : 3, "pub-type": "inproceedings", "booktitle": "Data Compression Conference (DCC), 2012","publisher":"IEEE","address":"Snowbird, Utah, USA", "year": "2012", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6189232", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "editor": [ "James A. Storer Michael W. Marcellin" ], "editors": [ {"first" : "James A. Storer Michael W.", "last" : "Marcellin"} ], "pages": "13-21","abstract": "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.", "issn" : "1068-0314", "isbn" : "978-1-4673-0715-4", "doi" : "10.1109/DCC.2012.9", "bibtexKey": "richter2012compressing" } ] }