Lossless chain code compression with an improved Binary Adaptive Sequential Coding of zero-runs
Authors:
- Borut ŽalikBŽBorut Žalik
- Domen MongusDMDomen Mongus
- Krista Rizman ŽalikKŽKrista Rizman Žalik
- David PodgorelecDPDavid Podgorelec
- Niko LukačNiko Lukač
Open Access
- 1 February 2021
- journal article
- research article
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 75
Abstract
No abstract availableKeywords
Funding Information
- ARRS
This publication has 32 references indexed in Scilit:
- An efficient raster font compression for embedded systemsPattern Recognition, 2010
- Compressed vertex chain codesPattern Recognition, 2007
- Lossless compression of map contours by context tree modeling of chain codesPattern Recognition, 2006
- An efficient chain code with Huffman codingPattern Recognition, 2005
- A contour-based approach to binary shape coding using a multiple grid chain codeSignal Processing: Image Communication, 2000
- The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LSIEEE Transactions on Image Processing, 2000
- A new chain codePattern Recognition, 1999
- A universal data compression systemIEEE Transactions on Information Theory, 1983
- A simple general binary source code (Corresp.)IEEE Transactions on Information Theory, 1982
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966