Chain code compression with modified interpolative coding

Žalik, Borut; Žalik, Krista Rizman; Zupančič, Eva; Lukač, Niko; Žalik, Mitja; Mongus, Domen

doi:10.1016/j.compeleceng.2019.05.001

Cited by 7 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The interval between L and H is filled simply by incrementing the value

. A similar case was recognized in [ 32 , 33 ]. If

), where D is the maximal value of the domain, then the encoder also does not emit any bits.…”

Section: Methodssupporting

confidence: 66%

“…The compression pipeline is classical, consisting of only two parts: the prediction (the JPEG LS predictor turned out to be the most successful) and the entropy encoder. Interpolative coding, a technique developed by Moffat and Stuiver [ 31 ], is less known and has not been used in image compression, except for bi-level images [ 32 , 33 , 35 ]. It turned out to be as good as the widely used arithmetic coding for images with continuous tones as well.…”

Section: Discussionmentioning

confidence: 99%

“…In [ 35 ] it was reported that IC can be a good alternative to arithmetic coding for bi-level image compression. IC was also successful at chain code compression [ 32 , 33 , 36 ]. The characteristic of both domains is a small alphabet.…”

Section: Methodsmentioning

confidence: 99%

See 2 more Smart Citations

FLoCIC: A Few Lines of Code for Raster Image Compression

Žalik

Strnad

Kohek

et al. 2023

Entropy

Self Cite

View full text Add to dashboard Cite

A new approach is proposed for lossless raster image compression employing interpolative coding. A new multifunction prediction scheme is presented first. Then, interpolative coding, which has not been applied frequently for image compression, is explained briefly. Its simplification is introduced in regard to the original approach. It is determined that the JPEG LS predictor reduces the information entropy slightly better than the multi-functional approach. Furthermore, the interpolative coding was moderately more efficient than the most frequently used arithmetic coding. Finally, our compression pipeline is compared against JPEG LS, JPEG 2000 in the lossless mode, and PNG using 24 standard grayscale benchmark images. JPEG LS turned out to be the most efficient, followed by JPEG 2000, while our approach using simplified interpolative coding was moderately better than PNG. The implementation of the proposed encoder is extremely simple and can be performed in less than 60 lines of programming code for the coder and 60 lines for the decoder, which is demonstrated in the given pseudocodes.

show abstract

“…The interval between L and H is filled simply by incrementing the value

. A similar case was recognized in [ 32 , 33 ]. If

), where D is the maximal value of the domain, then the encoder also does not emit any bits.…”

Section: Methodssupporting

confidence: 66%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

FLoCIC: A Few Lines of Code for Raster Image Compression

Žalik

Strnad

Kohek

et al. 2023

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

“…Freeman proposed two chain codes known as Freeman chain code in eight (F8) and four (F4) directions. Other chain codes were discovered by Bribiesca (Vertex Chain Code, VCC) [28], Sánchez-Cruz and Rodríguez-Dagnino (Three-Orthogonal chain code, 3OT) [29],Žalik et al (Unsigned Manhattan Chain Code, UMCC) [30],and Dunkelberger and Mitchell (Mid-crack Chain Code) [31]. In general, there are two types of chain codes: those operating on raster pixels and those working with raster edges.…”

Section: Methodsmentioning

confidence: 99%

An Efficient Region Merging Algorithm in Raster Space

Žalik¹,

Podgorelec²,

Lukač³

et al. 2023

Qualitative and Computational Aspects of Dynamical Systems

Self Cite

View full text Add to dashboard Cite

This work introduces a new region merging algorithm operating in raster space represented by a 4-connected graph. Necessary definitions are introduced first to derive a new merging function formally. An implementation is described after that, which consists of two steps: a determination of the shared trails of the input cycles, and construction of the resulting merged region. The cycles defining the regions are represented by the Freeman crack chain code in four directions. The algorithm works in linear time On, where n is the number of total graph vertices, i.e. pixels. However, the expected time complexity for one merging operation performed by the algorithm is O1.

show abstract

“…The most time-consuming task is performed by the last function in Line 9, which needs to replace the first l − 1 values in L. It can be realised in various ways. Four different implementations were proposed and analysed in [31].…”

Section: Move-to-front Transformmentioning

confidence: 99%

On Move with Interleaving (MwI) Implementation

Žalik,

Jeromel,

Kolingerová

et al. 2024

Preprint

View full text Add to dashboard Cite

Various implementations of the Move with Interleaving transform are discussed in this paper, with the transformation itself explained briefly at first. The transform has an expected time complexity of O(n), where n represents the length of the sequence being transformed. The importance of implementation also grows as the sequences become longer. The paper explains three different implementations: the first uses the standard vector, the second employs a lookup table, and the third utilises a dynamic linked list with a pool of released records. The experiments were conducted on 32 greyscale raster images of various contexts and sizes. All three solutions were implemented in both C++ and Java, and then executed on three different platforms: a personal computer running MS Windows and Linux, and a Raspberry Pi 2 with Linux. The implementation based on the dynamic linked list was the fastest, and outperformed the vector-based implementation by more than 1800%. While direct comparisons between results on the Raspberry Pi and those on the modern personal computer may not be straightforward, a consistent pattern prevails: the dynamic linked list implementation outperformed the other two consistently, and the C++ code was faster than the code written in Java. The difference was most evident on the Raspberry Pi.

show abstract

Chain code compression with modified interpolative coding

Cited by 7 publications

References 15 publications

FLoCIC: A Few Lines of Code for Raster Image Compression

FLoCIC: A Few Lines of Code for Raster Image Compression

An Efficient Region Merging Algorithm in Raster Space

On Move with Interleaving (MwI) Implementation

Contact Info

Product

Resources

About