| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 1 / 1
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
A case study on entropy-aware block-based linear transforms for lossless image compression
Borut Žalik, David Podgorelec, Ivana Kolingerová, Damjan Strnad, Štefan Kohek, 2024, izvirni znanstveni članek

Opis: Data compression algorithms tend to reduce information entropy, which is crucial, especially in the case of images, as they are data intensive. In this regard, lossless image data compression is especially challenging. Many popular lossless compression methods incorporate predictions and various types of pixel transformations, in order to reduce the information entropy of an image. In this paper, a block optimisation programming framework is introduced to support various experiments on raster images, divided into blocks of pixels. Eleven methods were implemented within , including prediction methods, string transformation methods, and inverse distance weighting, as a representative of interpolation methods. Thirty-two different greyscale raster images with varying resolutions and contents were used in the experiments. It was shown that reduces information entropy better than the popular JPEG LS and CALIC predictors. The additional information associated with each block in is then evaluated. It was confirmed that, despite this additional cost, the estimated size in bytes is smaller in comparison to the sizes achieved by the JPEG LS and CALIC predictors.
Ključne besede: computer science, information entropy, prediction, inverse distance transform, string transformations
Objavljeno v DKUM: 07.01.2025; Ogledov: 0; Prenosov: 4
.pdf Celotno besedilo (5,13 MB)

Iskanje izvedeno v 0.04 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici