{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:09:28Z","timestamp":1761808168298},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"publisher","award":["J2-6764","J2-8176","P2-0041"],"award-info":[{"award-number":["J2-6764","J2-8176","P2-0041"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1016\/j.ins.2018.01.045","type":"journal-article","created":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T17:37:17Z","timestamp":1518284237000},"page":"39-49","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["Efficient chain code compression with interpolative coding"],"prefix":"10.1016","volume":"439-440","author":[{"given":"Borut","family":"\u017dalik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domen","family":"Mongus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niko","family":"Luka\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krista Rizman","family":"\u017dalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2018.01.045_bib0001","series-title":"The Burrows\u2013Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching","author":"Adjeroh","year":"2008"},{"issue":"8","key":"10.1016\/j.ins.2018.01.045_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1117\/1.2771241","article-title":"Compression rates comparison of entropy coding for three-bit chain codes of bilevel images","volume":"46","author":"Aguinaga","year":"2007","journal-title":"Opt. Eng."},{"issue":"3","key":"10.1016\/j.ins.2018.01.045_bib0003","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.patcog.2006.08.005","article-title":"Lossless compression of map contours by context tree modeling of chain codes","volume":"40","author":"Akimov","year":"2007","journal-title":"Pattern Recognit."},{"issue":"3","key":"10.1016\/j.ins.2018.01.045_bib0004","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1109\/JSTSP.2010.2048232","article-title":"Bi-level image compression estimating the Markov order of dependencies","volume":"4","author":"Alcaraz-Corona","year":"2010","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0005","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"},{"issue":"1","key":"10.1016\/j.ins.2018.01.045_bib0006","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","article-title":"Algorithm for computer control of a digital plotter","volume":"4","author":"Bresenham","year":"1965","journal-title":"IBM Syst. J."},{"issue":"2","key":"10.1016\/j.ins.2018.01.045_bib0007","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","article-title":"A new chain code","volume":"32","author":"Bribiesca","year":"1999","journal-title":"Pattern Recognit."},{"issue":"5","key":"10.1016\/j.ins.2018.01.045_bib0008","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/S0031-3203(99)00093-X","article-title":"A chain code for representing 3D curves","volume":"33","author":"Bribiesca","year":"2000","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2018.01.045_bib0009","series-title":"Technical Report","article-title":"A Block\u2013Sorting Lossless Data Compression Algorithm.","author":"Burrows","year":"1994"},{"key":"10.1016\/j.ins.2018.01.045_bib0010","series-title":"Visual Perception","author":"Cornsweet","year":"1971"},{"key":"10.1016\/j.ins.2018.01.045_bib0011","series-title":"9th International Conference on Computer Engineering & Systems (ICCES)","first-page":"354","article-title":"Burrows\u2013Wheeler transform and combination of move-to-front coding and run length encoding for lossless audio coding","author":"Elsayed","year":"2014"},{"key":"10.1016\/j.ins.2018.01.045_bib0012","series-title":"Computer Graphics: Principles and Practice","author":"Foley","year":"1997"},{"issue":"2","key":"10.1016\/j.ins.2018.01.045_bib0013","first-page":"260","article-title":"On the encoding of arbitrary geometric configurations","volume":"10","author":"Freeman","year":"1961","journal-title":"IEEE Trans. Electron. Devices"},{"issue":"12","key":"10.1016\/j.ins.2018.01.045_bib0014","doi-asserted-by":"crossref","first-page":"4137","DOI":"10.1016\/j.patcog.2010.07.018","article-title":"An efficient raster font compression for embedded systems","volume":"43","author":"Globa\u010dnik","year":"2010","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2018.01.045_bib0015","series-title":"Proc. 1993 Data Compression Conference, (Snowbird)","first-page":"351","article-title":"Fast and efficient lossless image compression","author":"Howard","year":"1993"},{"issue":"7","key":"10.1016\/j.ins.2018.01.045_bib0016","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TCOM.1985.1096361","article-title":"Encoding of arbitrary curves based on chain code representation","volume":"33","author":"Kaneko","year":"1985","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"10.1016\/j.ins.2018.01.045_bib0017","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1145\/1217856.1217858","article-title":"Linear work suffix array construction","volume":"53","author":"K\u00e4rkk\u00e4inen","year":"2006","journal-title":"J. ACM"},{"issue":"9","key":"10.1016\/j.ins.2018.01.045_bib0018","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.parco.2007.06.004","article-title":"Scalable parallel suffix array construction","volume":"33","author":"Kulla","year":"2007","journal-title":"Parallel Comput."},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0019","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1016\/j.patcog.2013.11.002","article-title":"Representation of enclosing surfaces from simple voxelized objects by means of a chain code","volume":"47","author":"Lemus","year":"2014","journal-title":"Pattern Recognit."},{"issue":"12","key":"10.1016\/j.ins.2018.01.045_bib0020","doi-asserted-by":"crossref","first-page":"2840","DOI":"10.4304\/jsw.7.12.2840-2848","article-title":"Evaluation and comparison on the techniques of vertex chain codes","volume":"7","author":"Li","year":"2012","journal-title":"J. Softw."},{"issue":"1\u20132","key":"10.1016\/j.ins.2018.01.045_bib0021","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0031-3203(90)90048-P","article-title":"Corner detection from chain-code","volume":"23","author":"Liu","year":"1990","journal-title":"Pattern Recognit."},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0022","first-page":"553","article-title":"An efficient chain code with huffman coding","volume":"38","author":"Liu","year":"2004","journal-title":"Pattern Recognit."},{"issue":"9","key":"10.1016\/j.ins.2018.01.045_bib0023","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/j.image.2012.07.008","article-title":"Directional difference chain codes with quasi-lossless compression and run-length encoding","volume":"27","author":"Liu","year":"2012","journal-title":"Signal Process. Image Commun."},{"key":"10.1016\/j.ins.2018.01.045_bib0024","series-title":"Theory and practice of computer graphics 2011","first-page":"33","article-title":"Pixel-level algorithms for drawing curves","author":"Liu","year":"2011"},{"issue":"11","key":"10.1016\/j.ins.2018.01.045_bib0025","doi-asserted-by":"crossref","first-page":"2908","DOI":"10.1016\/j.patcog.2007.03.001","article-title":"Compressed vertex chain codes","volume":"40","author":"Liu","year":"2007","journal-title":"Pattern Recognit."},{"issue":"10","key":"10.1016\/j.ins.2018.01.045_sbref0026","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1109\/26.103046","article-title":"Highly efficient coding schemes for contour lines based on chain code representations","volume":"39","author":"Lu","year":"1991","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"10.1016\/j.ins.2018.01.045_bib0027","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/382780.382782","article-title":"An analysis of the Burrows\u2013Wheeler transform","volume":"48","author":"Manzini","year":"2001","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.ins.2018.01.045_bib0028","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1013002601898","article-title":"Binary interpolative coding for effective index compression","volume":"3","author":"Moffat","year":"2000","journal-title":"Inf. Retrieval"},{"key":"10.1016\/j.ins.2018.01.045_bib0029","series-title":"Applied Algorithms ICAA 2014","first-page":"187","article-title":"An experimental study of a novel Move-to-Front-or-Middle (MFM) list update algorithm","volume":"8321","author":"Mohanty","year":"2014"},{"issue":"10","key":"10.1016\/j.ins.2018.01.045_bib0030","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":"10.1016\/j.ins.2018.01.045_bib0031","series-title":"ICIP\u201997 Proceedings of the 1997 International Conference on Image Processing, volume\u00a03","first-page":"114","article-title":"Multi-grid chain coding of binary shapes","author":"Nunes","year":"1997"},{"key":"10.1016\/j.ins.2018.01.045_bib0032","series-title":"String processing and information retrieval SPIRE 2009, volume 5721","first-page":"90","article-title":"A linear-time Burrows\u2013Wheeler transform using induced sorting","author":"Okanohara","year":"2009"},{"issue":"2","key":"10.1016\/j.ins.2018.01.045_bib0033","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.image.2007.11.002","article-title":"Compact representation of contours using directional grid chain code","volume":"23","author":"Park","year":"2007","journal-title":"Signal Process. Image Commun."},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0034","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/378456.378457","article-title":"A parallel algorithm for polygon rasterization","volume":"22","author":"Pineda","year":"1988","journal-title":"Comput. Graphics"},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0035","first-page":"265","article-title":"Data compression by means of a \u201dbook stack\u201d","volume":"16","author":"Ryabko","year":"1980","journal-title":"Prob. Inf. Transm."},{"key":"10.1016\/j.ins.2018.01.045_bib0036","series-title":"Handook of Data Compression","author":"Salomon","year":"2010"},{"issue":"4","key":"10.1016\/j.ins.2018.01.045_bib0037","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.jvcir.2010.02.002","article-title":"Proposing a new code by considering pieces of discrete straight lines in contour shapes","volume":"21","author":"S\u00e1nchez-Cruz","year":"2010","journal-title":"J. Visual Commun. Image Represent."},{"issue":"6","key":"10.1016\/j.ins.2018.01.045_bib0038","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1016\/j.patcog.2006.10.013","article-title":"Efficiency of chain codes to represent binary objects","volume":"40","author":"S\u00e1nchez-Cruz","year":"2007","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2018.01.045_bib0039","series-title":"CGIM\u201908 Proceedings of the Computer Graphics and Imaging, Innsbruck, Austria","first-page":"6","article-title":"A proposal modification of the 3OT chain code","author":"S\u00e1nchez-Cruz","year":"2008"},{"issue":"1","key":"10.1016\/j.ins.2018.01.045_bib0040","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1117\/1.JEI.23.1.013031","article-title":"Equivalence of chain codes","volume":"23","author":"S\u00e1nchez-Cruz","year":"2014","journal-title":"J. Electron. Imaging"},{"issue":"2","key":"10.1016\/j.ins.2018.01.045_bib0041","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.patcog.2013.08.010","article-title":"A new relative chain code in 3D","volume":"47","author":"S\u00e1nchez-Cruz","year":"2014","journal-title":"Pattern Recognit."},{"issue":"9","key":"10.1016\/j.ins.2018.01.045_bib0042","first-page":"1","article-title":"Compressing bi-level images by means of a 3-bit chain code","volume":"44","author":"S\u00e1nchez-Cruz","year":"2005","journal-title":"SPIE Opt. Eng."},{"issue":"2","key":"10.1016\/j.ins.2018.01.045_bib0043","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized effciency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2018.01.045_bib0044","series-title":"Image Processing, Analysis and Machine Vision","author":"\u0160onka","year":"2007"},{"issue":"1","key":"10.1016\/j.ins.2018.01.045_bib0045","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","author":"\u017dalik","year":"2014","journal-title":"Signal Process. Image Commun."},{"key":"10.1016\/j.ins.2018.01.045_bib0046","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.jvcir.2016.03.001","article-title":"Unsigned Manhattan chain code","volume":"38","author":"\u017dalik","year":"2016","journal-title":"J. Visual Commun. Image Represent."},{"issue":"C","key":"10.1016\/j.ins.2018.01.045_bib0047","first-page":"8","article-title":"A universal chain code compression method","volume":"29","author":"\u017dalik","year":"2015","journal-title":"Image Vision Comput."},{"issue":"1\u201310","key":"10.1016\/j.ins.2018.01.045_bib0048","article-title":"Chain code compression using string transformation techniques","volume":"53","author":"\u017dalik","year":"2016","journal-title":"Digital Signal Process."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025518300707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025518300707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T04:56:29Z","timestamp":1535086589000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025518300707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":48,"alternative-id":["S0020025518300707"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2018.01.045","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient chain code compression with interpolative coding","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2018.01.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}