.png){kind=icon}
Return
Chain code lossless compression using move-to-front transform and adaptive run-length encoding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2013.09.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Chain codes are the most size-efficient representations of rasterised binary shapes and contours. This paper considers a new lossless chain code compression method based on move-to-front transform and an adaptive run-length encoding. The former reduces the information entropy of the chain code, whilst the latter compresses the entropy-reduced chain code by coding the repetitions of chain code symbols and their combinations using a variable-length model. In comparison to other state-of-the-art compression methods, the entropy-reduction is highly efficient, and the newly proposed method yields, on average, better compression. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Chain code
Compression
Move-to-front transform
Run-length encoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
2.7
Papers:
2.8K
Citations:
4.2K
Organization
Cited Papers
ShareSaveShareSaveLossless compression of map contours by context tree modeling of chain codes.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more