Compression method for binary tree like bitmaps

Sandor J. Piros, P. Korondi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In previous publications we had shown that a biological process, like cell division and differentiation could be described as a kind of wavelet transformation. By mimicking this process, we are able to transform a 2-3 or more dimensional image or dataset into a perfect binary tree structure. Here we show potentially possible approach how to compress this kind of bitmap. The main advantage of this lossless method is that the resolution of the reconstructed image is doubling by each step.

Original languageEnglish
Title of host publication2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012
DOIs
Publication statusPublished - 2012
Event2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012 - Sharjah, United Arab Emirates
Duration: Apr 10 2012Apr 12 2012

Other

Other2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012
CountryUnited Arab Emirates
CitySharjah
Period4/10/124/12/12

Fingerprint

Binary trees
Cells

Keywords

  • binary tree
  • bioinformatics
  • image compression
  • image transformation
  • wavelet

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Piros, S. J., & Korondi, P. (2012). Compression method for binary tree like bitmaps. In 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012 [6215197] https://doi.org/10.1109/ISMA.2012.6215197

Compression method for binary tree like bitmaps. / Piros, Sandor J.; Korondi, P.

2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012. 2012. 6215197.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Piros, SJ & Korondi, P 2012, Compression method for binary tree like bitmaps. in 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012., 6215197, 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012, Sharjah, United Arab Emirates, 4/10/12. https://doi.org/10.1109/ISMA.2012.6215197
Piros SJ, Korondi P. Compression method for binary tree like bitmaps. In 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012. 2012. 6215197 https://doi.org/10.1109/ISMA.2012.6215197
Piros, Sandor J. ; Korondi, P. / Compression method for binary tree like bitmaps. 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012. 2012.
@inproceedings{5ae83271998849ad9cd94b86667b4006,
title = "Compression method for binary tree like bitmaps",
abstract = "In previous publications we had shown that a biological process, like cell division and differentiation could be described as a kind of wavelet transformation. By mimicking this process, we are able to transform a 2-3 or more dimensional image or dataset into a perfect binary tree structure. Here we show potentially possible approach how to compress this kind of bitmap. The main advantage of this lossless method is that the resolution of the reconstructed image is doubling by each step.",
keywords = "binary tree, bioinformatics, image compression, image transformation, wavelet",
author = "Piros, {Sandor J.} and P. Korondi",
year = "2012",
doi = "10.1109/ISMA.2012.6215197",
language = "English",
isbn = "9781467308625",
booktitle = "2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012",

}

TY - GEN

T1 - Compression method for binary tree like bitmaps

AU - Piros, Sandor J.

AU - Korondi, P.

PY - 2012

Y1 - 2012

N2 - In previous publications we had shown that a biological process, like cell division and differentiation could be described as a kind of wavelet transformation. By mimicking this process, we are able to transform a 2-3 or more dimensional image or dataset into a perfect binary tree structure. Here we show potentially possible approach how to compress this kind of bitmap. The main advantage of this lossless method is that the resolution of the reconstructed image is doubling by each step.

AB - In previous publications we had shown that a biological process, like cell division and differentiation could be described as a kind of wavelet transformation. By mimicking this process, we are able to transform a 2-3 or more dimensional image or dataset into a perfect binary tree structure. Here we show potentially possible approach how to compress this kind of bitmap. The main advantage of this lossless method is that the resolution of the reconstructed image is doubling by each step.

KW - binary tree

KW - bioinformatics

KW - image compression

KW - image transformation

KW - wavelet

UR - http://www.scopus.com/inward/record.url?scp=84863672001&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863672001&partnerID=8YFLogxK

U2 - 10.1109/ISMA.2012.6215197

DO - 10.1109/ISMA.2012.6215197

M3 - Conference contribution

AN - SCOPUS:84863672001

SN - 9781467308625

BT - 2012 8th International Symposium on Mechatronics and its Applications, ISMA 2012

ER -