{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:26:33Z","timestamp":1766298393758,"version":"3.48.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"38","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["438221930"],"award-info":[{"award-number":["438221930"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-025-20971-3","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:16:41Z","timestamp":1751519801000},"page":"46553-46580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Investigations on algorithm selection for interval-based coding methods"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5063-6515","authenticated-orcid":false,"given":"Tilo","family":"Strutz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Schreiber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"issue":"4","key":"20971_CR1","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s11554-014-0407-0","volume":"11","author":"F Belghith","year":"2016","unstructured":"Belghith F, Kibeya H, Loukil H, Ben Ayed MA, Masmoudi N (2016) A new fast motion estimation algorithm using fast mode decision for high-efficiency video coding. J Real-Time Image Process 11(4):675\u2013691. https:\/\/doi.org\/10.1007\/s11554-014-0407-0","journal-title":"J Real-Time Image Process"},{"issue":"4","key":"20971_CR2","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s11554-014-0431-0","volume":"11","author":"AV Paramkusam","year":"2016","unstructured":"Paramkusam AV, Reddy VSK (2016) An efficient multi-layer reference frame motion estimation for video coding. Journal of Real-Time Image Processing 11(4):645\u2013661. https:\/\/doi.org\/10.1007\/s11554-014-0431-0","journal-title":"Journal of Real-Time Image Processing"},{"issue":"3","key":"20971_CR3","doi-asserted-by":"publisher","first-page":"3535","DOI":"10.1007\/s11042-022-13094-6","volume":"82","author":"P Goncalves","year":"2023","unstructured":"Goncalves P, Correa G, Agostini L, Porto M (2023) Learning-based bypass zone search algorithm for fast motion estimation. Multimed Tools Appl 82(3):3535\u20133560. https:\/\/doi.org\/10.1007\/s11042-022-13094-6","journal-title":"Multimed Tools Appl"},{"issue":"22","key":"20971_CR4","doi-asserted-by":"publisher","first-page":"33693","DOI":"10.1007\/s11042-023-14579-8","volume":"82","author":"W Niu","year":"2023","unstructured":"Niu W, Huang X, Yin H, Lu Y, Zhou Y, Yan C (2023) Fast all zero block detection algorithm for versatile video coding. Multimed Tools Appl 82(22):33693\u201333718. https:\/\/doi.org\/10.1007\/s11042-023-14579-8","journal-title":"Multimed Tools Appl"},{"issue":"18","key":"20971_CR5","doi-asserted-by":"publisher","first-page":"28301","DOI":"10.1007\/s11042-023-14691-9","volume":"82","author":"X Shang","year":"2023","unstructured":"Shang X, Li G, Zhao X, Han H, Zuo Y (2023) Fast CU size decision algorithm for VVC intra coding. Multimed Tools Appl 82(18):28301\u201328322. https:\/\/doi.org\/10.1007\/s11042-023-14691-9","journal-title":"Multimed Tools Appl"},{"key":"20971_CR6","doi-asserted-by":"publisher","unstructured":"Liu S, Cui S, Li T, Liu H, Yang Q, Yang H (2024) Fast CU partition algorithm based on swin-transformer for depth intra coding in 3D-HEVC. Multimed Tools Appl. https:\/\/doi.org\/10.1007\/s11042-024-18926-1","DOI":"10.1007\/s11042-024-18926-1"},{"key":"20971_CR7","doi-asserted-by":"publisher","unstructured":"Pakdaman F, Adelimanesh MA, Gabbouj M, Hashemi MR (2020) Complexity analysis of next-generation VVC encoding and decoding. In: 2020 IEEE international conference on image processing (ICIP), pp 3134\u20133138. https:\/\/doi.org\/10.1109\/ICIP40778.2020.9190983","DOI":"10.1109\/ICIP40778.2020.9190983"},{"key":"20971_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1147\/rd.232.0149","volume":"23","author":"J Rissanen","year":"1979","unstructured":"Rissanen J, Langdon G (1979) Arithmetic coding. IBM J Res Dev 23:149\u2013162. https:\/\/doi.org\/10.1147\/rd.232.0149","journal-title":"Arithmetic coding. IBM J Res Dev"},{"key":"20971_CR9","unstructured":"Martin GN (1979) Range encoding: An algorithm for removing redundancy from a digitized message, In: Video & data recording conference, vol 245 (Southampton. UK)"},{"key":"20971_CR10","unstructured":"Duda J (2014) Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding. arXiv:1311.2540"},{"key":"20971_CR11","doi-asserted-by":"publisher","unstructured":"Strutz T (2023) Rescaling of symbol counts for adaptive rANS coding. In: 31st European signal processing conference (EUSIPCO) (Helsinki, Finland), pp 585\u2013589. https:\/\/doi.org\/10.23919\/EUSIPCO58844.2023.10289961","DOI":"10.23919\/EUSIPCO58844.2023.10289961"},{"issue":"5","key":"20971_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s11554-023-01346-z","volume":"20","author":"Q Sheng","year":"2023","unstructured":"Sheng Q, Zhu H, Sheng H, Huang X, Jiang J, Lai C (2023) High efficiency lossless image recompression algorithm with asymmetric numeral systems for real-time mobile application. J Real-Time Image Proc 20(5):90. https:\/\/doi.org\/10.1007\/s11554-023-01346-z","journal-title":"J Real-Time Image Proc"},{"key":"20971_CR13","doi-asserted-by":"publisher","unstructured":"Marpe D, Schwarz H, Wiegand T (2003) Context-based adaptive binary arithmetic coding in the H.264\/AVC video compression standard. IEEE Trans Circ Syst Video Technol 13(7):620\u2013636. https:\/\/doi.org\/10.1109\/TCSVT.2003.815173","DOI":"10.1109\/TCSVT.2003.815173"},{"issue":"1","key":"20971_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s11042-005-6848-5","volume":"26","author":"H Man","year":"2005","unstructured":"Man H, Docef A, Kossentini F (2005) Performance analysis of the JPEG 2000 image coding standard. Multimed Tools Appl 26(1):27\u201357. https:\/\/doi.org\/10.1007\/s11042-005-6848-5","journal-title":"Multimed Tools Appl"},{"issue":"1","key":"20971_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/LCOMM.2002.807424","volume":"7","author":"B Ryabko","year":"2003","unstructured":"Ryabko B, Rissanen J (2003) Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions. IEEE Commun Lett 7(1):33\u201335. https:\/\/doi.org\/10.1109\/LCOMM.2002.807424","journal-title":"IEEE Commun Lett"},{"issue":"5","key":"20971_CR16","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1109\/TMM.2019.2941270","volume":"22","author":"T Strutz","year":"2020","unstructured":"Strutz T, M\u00f6ller P (2020) Screen content compression based on enhanced soft context formation. IEEE Trans Multimedia 22(5):1126\u20131138. https:\/\/doi.org\/10.1109\/TMM.2019.2941270","journal-title":"IEEE Trans Multimedia"},{"key":"20971_CR17","doi-asserted-by":"publisher","unstructured":"Chen M, Su H, Deng S, Xu Y (2020) Machine learning based symbol probability distribution prediction for entropy coding In AV1. In: 2020 IEEE international conference on image processing (ICIP), pp 3374\u20133378. https:\/\/doi.org\/10.1109\/ICIP40778.2020.9190906","DOI":"10.1109\/ICIP40778.2020.9190906"},{"key":"20971_CR18","doi-asserted-by":"publisher","unstructured":"Och H, Uddehal S.R, Strutz T, Kaup A (2024) Enhanced color palette modeling for lossless screen content compression. In: ICASSP 2024 - 2024 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 3670\u20133674. https:\/\/doi.org\/10.1109\/ICASSP48485.2024.10446445","DOI":"10.1109\/ICASSP48485.2024.10446445"},{"key":"20971_CR19","doi-asserted-by":"crossref","unstructured":"Moffat A (1999) An improved data structure for cumulative probability tables. Soft: Prac Exp 29(7):647\u2013659. https:\/\/doi.org\/10.1002\/(SICI)1097-024X(199906)29:7&lt;647::AID-SPE252&gt;3.0.CO;2-5","DOI":"10.1002\/(SICI)1097-024X(199906)29:7<647::AID-SPE252>3.3.CO;2-X"},{"key":"20971_CR20","doi-asserted-by":"publisher","unstructured":"Fenwick P (1994) A new data structure for cumulative probability tables. Soft: Prac Exp 24(3):327\u2013336. https:\/\/doi.org\/10.1002\/spe.4380240306","DOI":"10.1002\/spe.4380240306"},{"key":"20971_CR21","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I Witten","year":"1987","unstructured":"Witten I, Neal R, Cleary J (1987) Arithmetic coding for data compression. Communications of the ACM 30:520\u2013540. https:\/\/doi.org\/10.1145\/214762.214771","journal-title":"Communications of the ACM"},{"key":"20971_CR22","doi-asserted-by":"publisher","unstructured":"Painsky A, Rosset S, Feder M (2016) A simple and efficient approach for adaptive entropy coding over large alphabets. In: 2016 Data compression conference (DCC), pp 369\u2013378. https:\/\/doi.org\/10.1109\/DCC.2016.59","DOI":"10.1109\/DCC.2016.59"},{"issue":"4","key":"20971_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/JSAIT.2023.3245417","volume":"3","author":"D Severo","year":"2022","unstructured":"Severo D, Townsend J, Khisti A, Makhzani A, Ullrich K (2022) Compressing multisets with large alphabets. IEEE Journal on Selected Areas in Information Theory 3(4):605\u2013615. https:\/\/doi.org\/10.1109\/JSAIT.2023.3245417","journal-title":"IEEE Journal on Selected Areas in Information Theory"},{"key":"20971_CR24","unstructured":"Microsoft. __rdtsc. Available: https:\/\/learn.microsoft.com\/en-us\/cpp\/intrinsics\/rdtsc?view=msvc-170. Accessed 23 April 2025"},{"key":"20971_CR25","doi-asserted-by":"publisher","unstructured":"Said A (2004) Comparative analysis of arithmetic coding computational complexity, In: Data compression conference, 2004. Proceedings. DCC 2004, p 562. https:\/\/doi.org\/10.1109\/DCC.2004.1281538. Also: techn. report at HP Laboratories Palo Alto, HPL-2004-75","DOI":"10.1109\/DCC.2004.1281538"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-025-20971-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T22:13:48Z","timestamp":1765836828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-025-20971-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":25,"journal-issue":{"issue":"38","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["20971"],"URL":"https:\/\/doi.org\/10.1007\/s11042-025-20971-3","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"11 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}