{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T01:07:01Z","timestamp":1775869621219,"version":"3.50.1"},"reference-count":20,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In our previous work, by combining the Hilbert scan with the symbol grouping method, efficient run-length-based entropy coding was developed, and high-efficiency image compression algorithms based on the entropy coding were obtained. However, the 2-D Hilbert curves, which are a critical part of the above-mentioned entropy coding, are defined on squares with the side length being the powers of 2, i.e., 2n, while a subband is normally a rectangle of arbitrary sizes. It is not straightforward to modify the Hilbert curve from squares of side lengths of 2n to an arbitrary rectangle. In this short article, we provide the details of constructing the modified 2-D Hilbert curve of arbitrary rectangle sizes. Furthermore, we extend the method from a 2-D rectangle to a 3-D cuboid. The 3-D modified Hilbert curves are used in a novel 3-D transform video compression algorithm that employs the run-length-based entropy coding. Additionally, the modified 2-D and 3-D Hilbert curves introduced in this short article could be useful for some unknown applications in the future.<\/jats:p>","DOI":"10.3390\/e23070836","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T22:39:43Z","timestamp":1625006383000},"page":"836","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Modified Hilbert Curve for Rectangles and Cuboids and Its Application in Entropy Coding for Image and Video Compression"],"prefix":"10.3390","volume":"23","author":[{"given":"Yibiao","family":"Rong","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, Shantou University, Shantou 515063, China"},{"name":"Guangdong Provincial Key Laboratory of Digital Signal and Image Processing, Shantou University, Shantou 515063, China"},{"name":"Key Laboratory of Intelligent Manufacturing Technology, Shantou University, Ministry of Education, Shantou 515063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Shantou University, Shantou 515063, China"},{"name":"Guangdong Provincial Key Laboratory of Digital Signal and Image Processing, Shantou University, Shantou 515063, China"},{"name":"Key Laboratory of Intelligent Manufacturing Technology, Shantou University, Ministry of Education, Shantou 515063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5080-9076","authenticated-orcid":false,"given":"Jianyu","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Shantou University, Shantou 515063, China"},{"name":"Guangdong Provincial Key Laboratory of Digital Signal and Image Processing, Shantou University, Shantou 515063, China"},{"name":"Key Laboratory of Intelligent Manufacturing Technology, Shantou University, Ministry of Education, Shantou 515063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"key":"ref_1","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. Inst. Radio Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Commun. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1147\/rd.326.0717","article-title":"An overview of the basic principles of the Q-coder adaptive binary arithmetic coder","volume":"32","author":"Pennebaker","year":"1988","journal-title":"IBM J. Res. Dev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/18.923733","article-title":"A Rapid Probability Estimator and Binary Arithmetic Coder","volume":"47","year":"2001","journal-title":"IEEE Trans. Inform."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1109\/LSP.2017.2705250","article-title":"An Adaptive Multialphabet Arithmetic Coding Based on Generalized Virtual Sliding Window","volume":"24","author":"Belyaev","year":"2017","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Taubman, D.S., and Marcellin, M.W. (2002). JPEG2000: Image Compression Fundamentals, Standards, and Practice, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-0799-4"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"144895","DOI":"10.1109\/ACCESS.2019.2944658","article-title":"A New Perspective on Improving the Lossless Compression Efficiency for Initially Acquired Images","volume":"7","author":"Lin","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"89117","DOI":"10.1109\/ACCESS.2020.2993605","article-title":"Reversible Integer-to-Integer Wavelet Filter Design for Lossless Image Compression","volume":"8","author":"Lin","year":"2020","journal-title":"IEEE Access"},{"key":"ref_9","unstructured":"(2021, June 27). Wikipedia. Available online: https:\/\/en.wikipedia.org\/wiki\/Hilbert_curve."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01199431","article-title":"\u00dcber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck","volume":"38","author":"Hilbert","year":"1891","journal-title":"Math. Ann."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/69.908985","article-title":"Analysis of the Clustering Properties of Hilbert Space-filling Curve","volume":"13","author":"Moon","year":"2001","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0020-0190(97)00014-8","article-title":"Analysis of the Hilbert curve for representing two-dimensional space","volume":"62","author":"Jafadish","year":"1997","journal-title":"Inf. Process. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/02693799008941526","article-title":"A Comparative Analysis of Some Two-Dimensional Orderings","volume":"4","author":"Abel","year":"1990","journal-title":"Int. J. Geogr. Inf. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1335::AID-SPE60>3.0.CO;2-A","article-title":"Encoding and decoding the Hilbert order","volume":"26","author":"Liu","year":"1996","journal-title":"Softw. Pract. Exper."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lin, J. (2017, January 11\u201313). Improving the Compression Efficiency for Transform Video Coding. Proceedings of the 2017 4th International Conference on Systems and Informatics (ICSAI), Hangzhou, China.","DOI":"10.1109\/ICSAI.2017.8248489"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/83.623197","article-title":"An algorithm for encoding and decoding the 3-D Hilbert order","volume":"6","author":"Liu","year":"1997","journal-title":"IEEE Trans. Image Process."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0031-3203(92)90074-S","article-title":"Picture data encryption using scan patterns","volume":"25","author":"Bourbakis","year":"1992","journal-title":"Pattern Recognit."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1109\/83.887978","article-title":"Space-filling approach for fast window query on compressed images","volume":"9","author":"Hu","year":"2000","journal-title":"IEEE Trans. Image Process."},{"key":"ref_19","unstructured":"(2021, June 27). Available online: https:\/\/stumail-my.sharepoint.cn\/:u:\/g\/personal\/jianyulin_stu_edu_cn\/EZxWBMLZ9ndCiKCI-QwtzM4BxL0IS6MtaEyZ2A-LpLl3dA."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1109\/TSP.2012.2231680","article-title":"Spectrum Decomposition for Image\/Signal Coding","volume":"61","author":"Lin","year":"2013","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/836\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:27:23Z","timestamp":1760164043000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":20,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["e23070836"],"URL":"https:\/\/doi.org\/10.3390\/e23070836","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,29]]}}}