A compression-boosting transform for two-dimensional data

Qiaofeng Yang, Stefano Lonardi, Avraham Melkman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. The transform requires to solve a computationally hard problem for which a randomized algorithm is used. The inverse transform is fast and can be implemented in linear time in the size of the matrix. Preliminary experimental results show that the reordering improves the compressibility of digital images.

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings
PublisherSpringer Verlag
Pages126-137
Number of pages12
ISBN (Print)3540351574, 9783540351573
DOIs
StatePublished - 1 Jan 2006
Event2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 - Hong Kong, China
Duration: 20 Jun 200622 Jun 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4041 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006
Country/TerritoryChina
CityHong Kong
Period20/06/0622/06/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'A compression-boosting transform for two-dimensional data'. Together they form a unique fingerprint.

Cite this