<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="https://puma.ub.uni-stuttgart.de/tag/data%20coding%20coding%20coding%20data%20approximation"><title>PUMA publications for /tag/data%20coding%20coding%20coding%20data%20approximation</title><link>https://puma.ub.uni-stuttgart.de/tag/data%20coding%20coding%20coding%20data%20approximation</link><description>PUMA RSS feed for /tag/data%20coding%20coding%20coding%20data%20approximation</description><dc:date>2026-04-03T22:08:43+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel"/></rdf:Seq></items></channel><item rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter"><title>On the duality of rate allocation and quality indices</title><link>https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter</link><dc:creator>thomasrichter</dc:creator><dc:date>2016-03-10T09:18:49+01:00</dc:date><dc:subject>approximation coding compression, data image theory, </dc:subject><content:encoded>&lt;span data-person-type=&#034;author&#034; class=&#034;authorEditorList &#034;&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;Thomas Richter&#034; itemprop=&#034;url&#034; href=&#034;/person/1ac13db9d89542c1541c8aa333792bd81/author/0&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;T. Richter&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;. &lt;/span&gt;&lt;span class=&#034;additional-entrytype-information&#034;&gt;&lt;span itemtype=&#034;http://schema.org/Book&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;isPartOf&#034;&gt;&lt;em&gt;&lt;span itemprop=&#034;name&#034;&gt;Picture Coding Symposium (PCS)&lt;/span&gt;, &lt;/em&gt;&lt;/span&gt;&lt;em&gt;page &lt;span itemprop=&#034;pagination&#034;&gt;270-273&lt;/span&gt;. &lt;/em&gt;&lt;em&gt;Nagoya, Japan, &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;&lt;span&gt;December 2010&lt;meta content=&#034;December 2010&#034; itemprop=&#034;datePublished&#034;/&gt;&lt;/span&gt;&lt;/em&gt;)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/approximation"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/coding"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/compression,"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/data"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/image"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/theory,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter"><owl:sameAs rdf:resource="/uri/bibtex/2b19e814cb901081dd96b3b75c7e2169f/thomasrichter"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5702484"/><swrc:date>Thu Mar 10 09:18:49 CET 2016</swrc:date><swrc:address>Nagoya, Japan</swrc:address><swrc:booktitle>Picture Coding Symposium (PCS)</swrc:booktitle><swrc:month>dec</swrc:month><swrc:organization><swrc:Organization swrc:name="IEEE"/></swrc:organization><swrc:pages>270-273</swrc:pages><swrc:title>{O}n the duality of rate allocation and quality indices</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>approximation coding compression, data image theory, </swrc:keywords><swrc: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.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="978-1-4244-7134-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1109/PCS.2010.5702484" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas Richter"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel"><title>On the duality of rate allocation and quality indices</title><link>https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel</link><dc:creator>rainerreichel</dc:creator><dc:date>2016-03-03T17:45:04+01:00</dc:date><dc:subject>approximation coding compression, data image theory, </dc:subject><content:encoded>&lt;span data-person-type=&#034;author&#034; class=&#034;authorEditorList &#034;&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;Thomas Richter&#034; itemprop=&#034;url&#034; href=&#034;/person/1ac13db9d89542c1541c8aa333792bd81/author/0&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;T. Richter&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;. &lt;/span&gt;&lt;span class=&#034;additional-entrytype-information&#034;&gt;&lt;span itemtype=&#034;http://schema.org/Book&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;isPartOf&#034;&gt;&lt;em&gt;&lt;span itemprop=&#034;name&#034;&gt;Picture Coding Symposium (PCS)&lt;/span&gt;, &lt;/em&gt;&lt;/span&gt;&lt;em&gt;page &lt;span itemprop=&#034;pagination&#034;&gt;270-273&lt;/span&gt;. &lt;/em&gt;&lt;em&gt;Nagoya, Japan, &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;&lt;span&gt;December 2010&lt;meta content=&#034;December 2010&#034; itemprop=&#034;datePublished&#034;/&gt;&lt;/span&gt;&lt;/em&gt;)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/approximation"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/coding"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/compression,"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/data"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/image"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/theory,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel"><owl:sameAs rdf:resource="/uri/bibtex/2b19e814cb901081dd96b3b75c7e2169f/rainerreichel"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5702484"/><swrc:date>Thu Mar 03 17:45:04 CET 2016</swrc:date><swrc:address>Nagoya, Japan</swrc:address><swrc:booktitle>Picture Coding Symposium (PCS)</swrc:booktitle><swrc:month>dec</swrc:month><swrc:organization><swrc:Organization swrc:name="IEEE"/></swrc:organization><swrc:pages>270-273</swrc:pages><swrc:title>{O}n the duality of rate allocation and quality indices</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>approximation coding compression, data image theory, </swrc:keywords><swrc: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.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="978-1-4244-7134-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1109/PCS.2010.5702484" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas Richter"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>