{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T15:17:13Z","timestamp":1776698233864,"version":"3.51.2"},"reference-count":35,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["23-04622L"],"award-info":[{"award-number":["23-04622L"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["J2-4458"],"award-info":[{"award-number":["J2-4458"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["P2-0041"],"award-info":[{"award-number":["P2-0041"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Slovenian Research and Innovation Agency","award":["23-04622L"],"award-info":[{"award-number":["23-04622L"]}]},{"name":"Slovenian Research and Innovation Agency","award":["J2-4458"],"award-info":[{"award-number":["J2-4458"]}]},{"name":"Slovenian Research and Innovation Agency","award":["P2-0041"],"award-info":[{"award-number":["P2-0041"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper proposes a new string transformation technique called Move with Interleaving (MwI). Four possible ways of rearranging 2D raster images into 1D sequences of values are applied, including scan-line, left-right, strip-based, and Hilbert arrangements. Experiments on 32 benchmark greyscale raster images of various resolutions demonstrated that the proposed transformation reduces information entropy to a similar extent as the combination of the Burrows\u2013Wheeler transform followed by the Move-To-Front or the Inversion Frequencies. The proposed transformation MwI yields the best result among all the considered transformations when the Hilbert arrangement is applied.<\/jats:p>","DOI":"10.3390\/e25121591","type":"journal-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T11:54:48Z","timestamp":1701086088000},"page":"1591","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Transformation Technique for Reducing Information Entropy: A Case Study on Greyscale Raster Images"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4372-5020","authenticated-orcid":false,"given":"Borut","family":"\u017dalik","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-0290","authenticated-orcid":false,"given":"Damjan","family":"Strnad","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0701-9201","authenticated-orcid":false,"given":"David","family":"Podgorelec","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4556-2771","authenticated-orcid":false,"given":"Ivana","family":"Kolingerov\u00e1","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of West Bohemia, Technick\u00e1 8, 306 14 Plze\u0148, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4691-5401","authenticated-orcid":false,"given":"Luka","family":"Luka\u010d","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9517-1157","authenticated-orcid":false,"given":"Niko","family":"Luka\u010d","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0776-1860","authenticated-orcid":false,"given":"Simon","family":"Kolmani\u010d","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6980-4523","authenticated-orcid":false,"given":"Krista","family":"\u017dalik","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6210-0889","authenticated-orcid":false,"given":"\u0160tefan","family":"Kohek","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka Cesta 46, SI-2000 Maribor, Slovenia"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"},{"key":"ref_2","first-page":"379","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"AT&T Tech. J."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Liu, S., Xu, M., Qin, Y., and Luka\u0107, N. (2022). Knowledge Graph Alignment Network with Node-Level Strong Fusion. Appl. Sci., 12.","DOI":"10.3390\/app12199434"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gray, R.M. (2011). Entropy and Information Theory, Springer. [2nd ed.].","DOI":"10.1007\/978-1-4419-7970-4"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Sabirov, D.S., and Shepelevich, I.S. (2021). Information Entropy in Chemistry: An Overview. Entropy, 23.","DOI":"10.3390\/e23101240"},{"key":"ref_6","first-page":"223","article-title":"Experimental evaluation of crack shielding during fatigue crack growth using digital image correlation","volume":"38","year":"2013","journal-title":"Fatigue Fract. Eng. Mater. Struct."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Ben-Naim, A. (2017). Entropy, Shannon\u2019s Measure of Information and Boltzmann\u2019s H-Theorem. Entropy, 19.","DOI":"10.3390\/e19020048"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sayood, K. (2012). Introduction to Data Compression, Morgan Kaufman. [4th ed.].","DOI":"10.1016\/B978-0-12-415796-5.00001-6"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Rahman, M.A., and Hamada, M. (2019). Lossless Image Compression Techniques: A State-of-the-Art Survey. Symmetry, 11.","DOI":"10.3390\/sym11101274"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Salomon, D., and Motta, G. (2010). Handbook of Data Compression, Springer. [5th ed.].","DOI":"10.1007\/978-1-84882-903-9"},{"key":"ref_11","first-page":"265","article-title":"Data compression by means of a \u2018book stack\u2019","volume":"16","author":"Ryabko","year":"1980","journal-title":"Probl. Pereda. Inform."},{"key":"ref_12","unstructured":"Storer, J.A., and Cohn, M. (1997). Proceedings of the IEEE Data Compression Conference, DCC\u201997, Snowbird, UT, USA, 25\u201327 March 1997, IEEE Computer Society Press."},{"key":"ref_13","unstructured":"Abel, J. (2023, November 01). Improvements to the Burrows-Wheeler Compression Algorithm: After BWT Stages. Available online: https:\/\/api.semanticscholar.org\/CorpusID:16110299."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","article-title":"A Locally Adaptive Data Compression Scheme","volume":"29","author":"Bentley","year":"1986","journal-title":"Commun. ACM"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1002\/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D","article-title":"Improvements to Burrows-Wheeler Compression Algorithm","volume":"30","author":"Deorowicz","year":"2000","journal-title":"Softw. Pract. Exper."},{"key":"ref_16","unstructured":"Binder, E. (2023, November 14). Distance Coding. Available online: https:\/\/groups.google.com\/g\/comp.compression\/c\/96DHNJgf0NM\/m\/Ep15oLxq1CcJ."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/S0097539794277858","article-title":"Improved randomized on-line algorithms for the list update problem","volume":"27","author":"Albers","year":"1998","journal-title":"SIAM J. Comput."},{"key":"ref_18","unstructured":"Burrows, M., and Wheeler, D.J. (1994). A Block-Sorting Lossless Data Compression Algorithm, Digital Systems Research Center."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1002\/spe.982","article-title":"Post BWT stages of the Burrows-Wheeler compression Algorithm","volume":"40","author":"Abel","year":"2010","journal-title":"Softw. Pract. Exper."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Vahrenhold, J. (2009). Experimental Algorithms, Proceedings of the 8th International Symposium on Experimental Algorithms, SEA 2009, Dortmund, Germany, 3\u20136 June 2009, Springer.","DOI":"10.1007\/978-3-642-02011-7"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.image.2013.09.002","article-title":"Chain code lossless compression using Move-To-Front transform and adaptive Run-Length Encoding","volume":"29","year":"2014","journal-title":"Signal Process. Image Commun."},{"key":"ref_22","unstructured":"Cohn, M., and Storer, J.A. (2000). Proceedings of the IEEE Data Compression Conference, DCC\u20192000, Snowbird, UT, USA, 28\u201330 March 2000, IEEE Computer Society Press."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Adjeroh, D., Bell, T., and Mukherjee, A. (2008). The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, Springer Science + Business Media. [2nd ed.].","DOI":"10.1007\/978-0-387-78909-5"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2610","DOI":"10.1109\/TIP.2006.877396","article-title":"Improved lossless intra coding for H. 264\/MPEG-4 AVC","volume":"15","author":"Lee","year":"2006","journal-title":"IEEE Trans. Image Process."},{"key":"ref_25","first-page":"693","article-title":"Comparison of JPEG 2000 and other lossless compression schemes for digital mammograms","volume":"25","author":"Khademi","year":"2005","journal-title":"IEEE Trans. Image Process."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Barina, D. (2021). Comparison of Lossless Image Formats. arXiv.","DOI":"10.24132\/CSRN.2021.3002.38"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Ulacha, G., and \u0141azoryszczak, M. (2023). Lossless Image Coding Using Non-MMSE Algorithms to Calculate Linear Prediction Coefficients. Entropy, 25.","DOI":"10.3390\/e25010156"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s00530-018-0597-6","article-title":"Interactive synthesis and visualization of self-organizing trees for large-scale forest succession simulation","volume":"25","author":"Kohek","year":"2019","journal-title":"Multimed. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/TC.2010.188","article-title":"Two efficient algorithms for linear time suffix array construction","volume":"60","author":"Nong","year":"2011","journal-title":"IEEE Trans. Comput."},{"key":"ref_30","first-page":"918","article-title":"Linear work suffix array construction","volume":"53","author":"Sanders","year":"2017","journal-title":"J. ACM"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bader, M. (2013). Space-Filling Curves\u2014An Introduction with Applications in Scientific Computing, Springer.","DOI":"10.1007\/978-3-642-31046-1"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1016\/j.ins.2006.12.003","article-title":"Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query","volume":"17","author":"Chung","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.jvcir.2017.10.003","article-title":"Boolean Operations on Rasterized Shapes Represented by Chain Codes Using Space Filling Curves","volume":"49","author":"Mongus","year":"2017","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1080\/00207160108805115","article-title":"Using state diagrams for Hilbert curve mappings","volume":"78","author":"Lawder","year":"2001","journal-title":"Int. J. Comput. Math."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"\u017dalik, B., Strnad, D., Kohek, \u0160., Kolingerov\u00e1, I., Nerat, A., Luka\u010d, N., Lipu\u0161, B., \u017dalik, M., and Podgorelec, D. (2023). FLoCIC: A Few Lines of Code for Raster Image Compression. Entropy, 25.","DOI":"10.3390\/e25030533"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/12\/1591\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:31:50Z","timestamp":1760131910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/12\/1591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"references-count":35,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["e25121591"],"URL":"https:\/\/doi.org\/10.3390\/e25121591","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,27]]}}}