{ "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/20ed9cbeb964eafd1c03a7a15e7023033/thomasrichter", "tags" : [ "Annealing,","Distortion","JPEG","Quantization,","Rate","Simulated","Theory,","Variable","XR,","coding,","compression,","data","distortion","image","optimisation,","quantisation","rate","theory,","vector" ], "intraHash" : "0ed9cbeb964eafd1c03a7a15e7023033", "interHash" : "f8ff101d1065b16a8b19dce9bdb0c1b3", "label" : "Spatial Constant Quantization in JPEG XR is Nearly Optimal", "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), 2010","address":"Snowbird, UT", "year": "2010", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5453436", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "pages": "79-88","abstract": "The JPEG XR image compression standard, originally developed under the name\nHD-Photo by Microsoft, offers the feature of spatial variably quantization;\nits codestream syntax allows to select one out of a limited set of possible\nquantizers per macro block and per frequency band. In this paper, an\nalgorithm is presented that finds the rate-distortion optimal set of quantizers,\nand the optimal quantizer choice for each macro block. Even though it\nseems plausible that this feature may provide a huge improvement for images\nwhose statistics is non-stationary, e.g. compound images, it is demonstrated that\nthe PSNR improvement is not larger than 0.3dB for a two-step heuristics\nof feasible complexity, but improvements of up to 0.8dB for\ncompound images are possible by a much more complex optimization strategy.", "issn" : "1068-0314", "isbn" : "978-1-4244-6425-8", "doi" : "10.1109/DCC.2010.14", "bibtexKey": "richter2010spatial" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/272ef1f05d3b9b7e3ad85ee82e2e25da2/thomasrichter", "tags" : [ "Gaussian;JPEG2000;Visual","Masking","SSIM","algorithm;multi-scale","algorithm;statistical","algorithm;wavelet","allocation","coding;Image","coding;Visual","coding;wavelet","complexity","compression","compression;image","data","data;weighting","error","image","index;rate","masking","masks;Codecs;Frequency;Humans;Image","methods;Rate-distortion;Transform","model;visual","quality;Image","quality;visual","reconstruction;Mean","square","standard;low","system;Generalized","transforms;JPEG2000" ], "intraHash" : "72ef1f05d3b9b7e3ad85ee82e2e25da2", "interHash" : "c6b4d7259fb109715502cb1b7974b2fe", "label" : "Effective Visual Masking Techniques in JPEG2000", "user" : "thomasrichter", "description" : "", "date" : "2016-03-10 09:18:49", "changeDate" : "2016-03-10 08:20:00", "count" : 5, "pub-type": "inproceedings", "booktitle": "Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on","address":"San Diego, CA", "year": "2008", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4712395", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "pages": "2876-2879","abstract": "This paper introduces a very low complexity visual masking algorithm for the\nJPEG2000 image compression standard and evaluates its impact on the visual\nimage quality by means of the Multi-scale SSIM index. The algorithm derives\nsuitable weighting masks indirectly from a statistical model of the wavelet\ndata which is defined from the second moment and the average absolute amplitude of\nthe data. If combined with an a priori rate allocation algorithm, the\ncomputation of the visual masking weights has almost no overhead at all.", "issn" : "1522-4880", "doi" : "10.1109/ICIP.2008.4712395", "bibtexKey": "richter2008effective" } , { "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" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/20ed9cbeb964eafd1c03a7a15e7023033/rainerreichel", "tags" : [ "Annealing,","Distortion","JPEG","Quantization,","Rate","Simulated","Theory,","Variable","XR,","coding,","compression,","data","distortion","image","optimisation,","quantisation","rate","theory,","vector" ], "intraHash" : "0ed9cbeb964eafd1c03a7a15e7023033", "interHash" : "f8ff101d1065b16a8b19dce9bdb0c1b3", "label" : "Spatial Constant Quantization in JPEG XR is Nearly Optimal", "user" : "rainerreichel", "description" : "", "date" : "2016-03-03 17:45:04", "changeDate" : "2016-03-04 09:57:29", "count" : 3, "pub-type": "inproceedings", "booktitle": "Data Compression Conference (DCC), 2010","address":"Snowbird, UT", "year": "2010", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5453436", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "pages": "79-88","abstract": "The JPEG XR image compression standard, originally developed under the name\r\nHD-Photo by Microsoft, offers the feature of spatial variably quantization;\r\nits codestream syntax allows to select one out of a limited set of possible\r\nquantizers per macro block and per frequency band. In this paper, an\r\nalgorithm is presented that finds the rate-distortion optimal set of quantizers,\r\nand the optimal quantizer choice for each macro block. Even though it\r\nseems plausible that this feature may provide a huge improvement for images\r\nwhose statistics is non-stationary, e.g. compound images, it is demonstrated that\r\nthe PSNR improvement is not larger than 0.3dB for a two-step heuristics\r\nof feasible complexity, but improvements of up to 0.8dB for\r\ncompound images are possible by a much more complex optimization strategy.", "issn" : "1068-0314", "isbn" : "978-1-4244-6425-8", "doi" : "10.1109/DCC.2010.14", "bibtexKey": "Richter2010" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28d862d4875f17369fa4889bf997da9cc/rainerreichel", "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" : "rainerreichel", "description" : "", "date" : "2016-03-03 17:45:04", "changeDate" : "2016-03-04 09:57:29", "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": "Richter2012b" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel", "tags" : [ "approximation","coding","compression,","data","image","theory," ], "intraHash" : "b19e814cb901081dd96b3b75c7e2169f", "interHash" : "ac13db9d89542c1541c8aa333792bd81", "label" : "On the duality of rate allocation and quality indices", "user" : "rainerreichel", "description" : "", "date" : "2016-03-03 17:45:04", "changeDate" : "2016-03-04 09:57:29", "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": "Richter2010b" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/272ef1f05d3b9b7e3ad85ee82e2e25da2/rainerreichel", "tags" : [ "Gaussian;JPEG2000;Visual","Masking","SSIM","algorithm;multi-scale","algorithm;statistical","algorithm;wavelet","allocation","coding;Image","coding;Visual","coding;wavelet","complexity","compression","compression;image","data","data;weighting","error","image","index;rate","masking","masks;Codecs;Frequency;Humans;Image","methods;Rate-distortion;Transform","model;visual","quality;Image","quality;visual","reconstruction;Mean","square","standard;low","system;Generalized","transforms;JPEG2000" ], "intraHash" : "72ef1f05d3b9b7e3ad85ee82e2e25da2", "interHash" : "c6b4d7259fb109715502cb1b7974b2fe", "label" : "Effective Visual Masking Techniques in JPEG2000", "user" : "rainerreichel", "description" : "", "date" : "2016-03-03 17:45:04", "changeDate" : "2016-03-04 09:57:29", "count" : 5, "pub-type": "inproceedings", "booktitle": "Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on","address":"San Diego, CA", "year": "2008", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4712395", "author": [ "Thomas Richter" ], "authors": [ {"first" : "Thomas", "last" : "Richter"} ], "pages": "2876-2879","abstract": "This paper introduces a very low complexity visual masking algorithm for the\r\nJPEG2000 image compression standard and evaluates its impact on the visual\r\nimage quality by means of the Multi-scale SSIM index. The algorithm derives\r\nsuitable weighting masks indirectly from a statistical model of the wavelet\r\ndata which is defined from the second moment and the average absolute amplitude of\r\nthe data. If combined with an a priori rate allocation algorithm, the\r\ncomputation of the visual masking weights has almost no overhead at all.", "issn" : "1522-4880", "doi" : "10.1109/ICIP.2008.4712395", "bibtexKey": "Richter2008" } ] }