{ "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/2e59a2e3dae594eb3bcbcd2cc115ac775/roberta.toscano", "tags" : [ "Computational","Labyrinth","Labyrinthproblem.","complexity","importzotero","problems." ], "intraHash" : "e59a2e3dae594eb3bcbcd2cc115ac775", "interHash" : "9229f507c6dd762017912aa74b88762b", "label" : "Labyrinth problems: labyrinth-searching abilities of automata", "user" : "roberta.toscano", "description" : "", "date" : "2024-05-27 08:58:38", "changeDate" : "2024-05-27 08:58:38", "count" : 2, "pub-type": "book", "series": "Teubner-Texte zur Mathematik ; 114","publisher":"Teubner","address":"Leipzig", "year": "1989", "url": "", "editor": [ "Armin [Verfasser/in] Hemmerling" ], "editors": [ {"first" : "Armin [Verfasser/in]", "last" : "Hemmerling"} ], "isbn" : "3-322-00704-9", "language" : "Englisch", "bibtexKey": "hemmerling_labyrinth_1989" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2a59c2f30bfef557d71541cb37e638812/roberta.toscano", "tags" : [ "Algorithms.","Algorithmus.","Computational","Effizienter","complexity","importzotero" ], "intraHash" : "a59c2f30bfef557d71541cb37e638812", "interHash" : "fe8aca4a1366daa18b2b1e6e5d8fed37", "label" : "Effiziente Algorithmen für grundlegende Funktionen: mit zahlreichen Aufgaben und Beispielen", "user" : "roberta.toscano", "description" : "", "date" : "2024-05-27 08:58:38", "changeDate" : "2024-05-27 08:58:38", "count" : 2, "pub-type": "book", "series": "Leitfäden und Monographien der Informatik","publisher":"Teubner","address":"Stuttgart", "year": "1989", "url": "", "editor": [ "Ingo [Verfasser/in] Wegener" ], "editors": [ {"first" : "Ingo [Verfasser/in]", "last" : "Wegener"} ], "isbn" : "3-519-02276-1", "language" : "Deutsch", "bibtexKey": "wegener_effiziente_1989" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2d110c358854ba172a9c9b9fe75c9204a/wagnerst", "tags" : [ "code-measurement","complexity","iste-se","myown" ], "intraHash" : "d110c358854ba172a9c9b9fe75c9204a", "interHash" : "adbca8f7ba45cc4b8e65e520c96b50db", "label" : "An Empirical Validation of Cognitive Complexity as a Measure of Source Code Understandability", "user" : "wagnerst", "description" : "", "date" : "2021-02-09 09:52:32", "changeDate" : "2021-02-19 07:47:44", "count" : 3, "pub-type": "inproceedings", "booktitle": "Proceedings of the 14th ACM / IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM)","publisher":"ACM", "year": "2020", "url": "https://doi.org/10.1145%2F3382494.3410636", "author": [ "Marvin Muñoz Barón","Marvin Wyrich","Stefan Wagner" ], "authors": [ {"first" : "Marvin Muñoz", "last" : "Barón"}, {"first" : "Marvin", "last" : "Wyrich"}, {"first" : "Stefan", "last" : "Wagner"} ], "doi" : "10.1145/3382494.3410636", "bibtexKey": "Mu_oz_Bar_n_2020" } , { "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/2e8927761727a9bf3e5dd6858aedd7b56/thomasrichter", "tags" : [ "Golomb","XR;JPEG-LS;computational","adaptation;FLIC","algorithm;Golomb","coder;Golomb","coding;2D","coding;JPEG-LS;Lossless","coding;Memory","coding;low","coding;parallelization","complexity","complexity;data","complexity;fast","compression;adaptive","compression;gradient-based","compression;image","computational","context","edge","image","lossless","management;Throughput;Transform","model;median","modeling;Encoding;Image","parameter","parameter;JPEG","predictor;memory","requirements;Context;Context","space" ], "intraHash" : "e8927761727a9bf3e5dd6858aedd7b56", "interHash" : "c059b3eef64a56bcf5eefb9472dcec8e", "label" : "Fast lossless image compression with 2D Golomb parameter adaptation based on JPEG-LS", "user" : "thomasrichter", "description" : "", "date" : "2016-03-10 09:18:49", "changeDate" : "2016-03-10 08:20:00", "count" : 3, "pub-type": "inproceedings", "booktitle": "Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European", "year": "2012", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6334076", "author": [ "Z. Wang","M. Klaiber","Y. Gera","S. Simon","T. Richter" ], "authors": [ {"first" : "Z.", "last" : "Wang"}, {"first" : "M.", "last" : "Klaiber"}, {"first" : "Y.", "last" : "Gera"}, {"first" : "S.", "last" : "Simon"}, {"first" : "T.", "last" : "Richter"} ], "pages": "1920-1924","abstract": "A Fast and Lossless Image Compression (FLIC) algorithm based on the median edge predictor and Golomb coder of JPEG-LS is presented. FLIC eliminates the gradient-based context model from the JPEG-LS standard, the most expensive parts with respect to computational complexity and memory space requirements. To avoid a large context memory, Golomb parameter is selected based on the coding states and the prediction residuals of up to two immediate neighbors, one in each dimension. The FLIC algorithm has low memory footprint and dissolves the data dependencies in JPEG-LS to facilitate parallelization. Experimental results show that the FLIC algorithm achieves a throughput speedup factor of 3.7 over JPEG-LS with less than 4% compression performance penalty. Lossless compression performance results further show that FLIC outperforms other state-of-the-art standards including JPEG 2000 and JPEG XR.", "issn" : "2219-5491", "bibtexKey": "wang2012lossless" } , { "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" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2e8927761727a9bf3e5dd6858aedd7b56/rainerreichel", "tags" : [ "Golomb","XR;JPEG-LS;computational","adaptation;FLIC","algorithm;Golomb","coder;Golomb","coding;2D","coding;JPEG-LS;Lossless","coding;Memory","coding;low","coding;parallelization","complexity","complexity;data","complexity;fast","compression;adaptive","compression;gradient-based","compression;image","computational","context","edge","image","lossless","management;Throughput;Transform","model;median","modeling;Encoding;Image","parameter","parameter;JPEG","predictor;memory","requirements;Context;Context","space" ], "intraHash" : "e8927761727a9bf3e5dd6858aedd7b56", "interHash" : "c059b3eef64a56bcf5eefb9472dcec8e", "label" : "Fast lossless image compression with 2D Golomb parameter adaptation based on JPEG-LS", "user" : "rainerreichel", "description" : "", "date" : "2016-03-03 17:45:04", "changeDate" : "2016-03-04 09:57:29", "count" : 3, "pub-type": "inproceedings", "booktitle": "Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European", "year": "2012", "url": "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6334076", "author": [ "Z. Wang","M. Klaiber","Y. Gera","S. Simon","T. Richter" ], "authors": [ {"first" : "Z.", "last" : "Wang"}, {"first" : "M.", "last" : "Klaiber"}, {"first" : "Y.", "last" : "Gera"}, {"first" : "S.", "last" : "Simon"}, {"first" : "T.", "last" : "Richter"} ], "pages": "1920-1924","abstract": "A Fast and Lossless Image Compression (FLIC) algorithm based on the median edge predictor and Golomb coder of JPEG-LS is presented. FLIC eliminates the gradient-based context model from the JPEG-LS standard, the most expensive parts with respect to computational complexity and memory space requirements. To avoid a large context memory, Golomb parameter is selected based on the coding states and the prediction residuals of up to two immediate neighbors, one in each dimension. The FLIC algorithm has low memory footprint and dissolves the data dependencies in JPEG-LS to facilitate parallelization. Experimental results show that the FLIC algorithm achieves a throughput speedup factor of 3.7 over JPEG-LS with less than 4% compression performance penalty. Lossless compression performance results further show that FLIC outperforms other state-of-the-art standards including JPEG 2000 and JPEG XR.", "issn" : "2219-5491", "bibtexKey": "6334076" } ] }