Ziya Arnavut

Followers

Following

107

Public Views

Address: Fredonia, New York, United States

less

Timothy Devinney

University of Manchester

Bilami Azeddine

El-Hadj Lakhdar

Armando Marques-Guedes

UNL - New University of Lisbon

Eyüp Artvinli

Eskisehir Osmangazi University, Turkey

Fabio Cuzzolin

Oxford Brookes University

Gerassimos Barlas

American University of Sharjah

Sedef Canbazoglu Bilici

Gazi University

Florentin Smarandache

University of New Mexico

Himawan Wijaya

POLITEKNIK MANUFAKTUR ASTRA

Jai Maurya

Maharshi Dayanand University

InterestsView All (6)

Uploads

Papers by Ziya Arnavut

A remapping technique based on permutations for lossless compression of multispectral images

Proceedings DCC '97. Data Compression Conference, 1997

ABSTRACT Multispectral images, such as Thematic Mapper (TM) images, have high spectral correlatio... more ABSTRACT Multispectral images, such as Thematic Mapper (TM) images, have high spectral correlation among some bands. These bands also have different dynamic ranges. Hence, when linear predictive techniques employed to exploit the spectral and spatial correlation among the bands of a TM image, the variance of the prediction errors becomes greater. Markas and Reif (1993), have used histogram equalization (modification) techniques for lossy compression of multispectral images. In general, histogram equalization techniques are not reversible. However, by defining a monotonically increasing transformation, so that two adjacent gray values will not map to the same gray value of the transformed image, and selecting a target image with a wider probability density function than the source image, one can define a reversible mapping. We introduce a distinct reversible remapping scheme which utilizes sorting permutations. This technique differs from histogram equalization. It is a reversible transformation. We show that, by utilizing the remapping technique introduced and employing linear predictive techniques on a pair of bands, one can achieve better lossless compression than the results reported previously

Block sorting and compression

Proceedings DCC '97. Data Compression Conference, 1997

The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler 3... more The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler 3] has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques 5]. This paper, describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis, and delineates its relationship to BSLDCA. In particular we describe how BSLDCA can be reduced to LPSA and show how LPSA could give better results than BSLDCA when transmitting permutations. We also introduce a new technique, Inversion Frequencies, and show that it does as well as Move-to-Front (MTF) Coding when there is locality of reference in the data.

Download

Block Sorting Transformations

Data Compression Conference, 1998

Summary form only given. The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described... more Summary form only given. The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler (1994) has received considerable attention. BSLDCA achieves compression ratio closer to PPM, but with a faster execution speed than PPM. Arnavut and Magliveras (1997) described the theoretical basis for block sorting schemes in the case of permutations and introduced the Lexical Permutation Sorting

<title>Lossless compression of pseudocolor images</title>

Applications of Digital Image Processing XXI, 1998

In a pseudo-color (color-mapped) image pixel values represent indices that point to color values ... more In a pseudo-color (color-mapped) image pixel values represent indices that point to color values in a look-up table. Well-known linear predictive schemes, such as JPEG and CALIC, perform poorly when used with pseudo-color images, while universal compressors, such as Gzip, Pkzip and Compress, yield better compression gain. Recently, Burrows and Wheeler introduced the Block Sorting Lossless Data Compression Algorithm (BWA).

Generalization of the BWT Transformation and Inversion Ranks

Data Compression Conference, 2002

Summary form only given. We expand the theoretical foundations of LPSA (lexical permutation sorti... more Summary form only given. We expand the theoretical foundations of LPSA (lexical permutation sorting algorithm) (see Arnavut, Z., and Magliveras, S.S., The Computer Journal, vol.40, no.5, pp.292-5, 1997) from permutations to multiset permutations (data strings) and give the general theory behind the BWT combinatorially. We then show the information theoretic relationship between interval ranks and canonical sorting permutations. Finally, we

Inversion Coding

The Computer Journal, 2004

ABSTRACT The Burrows-Wheeler Compression (BWC) described by Burrows and Wheeler has received cons... more ABSTRACT The Burrows-Wheeler Compression (BWC) described by Burrows and Wheeler has received considerable attention. An essential part of BWC schemes is the Move-to-Front coder (recency ranking). In this paper we introduce a different coding (ranking) scheme, the inversion coder. We prove the information theoretic relationship between interval ranks and canonical sorting permutations. We also introduce a faster and more memory efficient-algorithm for inversion ranks. Finally, we explore the relationship between inversion ranks and recency ranks and show that inversion coding is superior to interval ranking as well as recency ranking.

Lexical Permutation Sorting Algorithm

The Computer Journal, 1997

The Block Sorting Lossless Data Compression Algorithm (BWT) described by Burrows and Wheeler has ... more The Block Sorting Lossless Data Compression Algorithm (BWT) described by Burrows and Wheeler has received considerable attention. Its compression rates are simliar to context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques. This paper describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis and delineates its relationship to BWT. In particular we describe how BWT can be reduced to LPSA and show how LPSA could give better results than BWT when transmitting permutations.

Download

Move-to-Front and Inversion Coding

Data Compression Conference, 2000

Motivated by the Move-to-Front MTF coder's recency ranking utilization of small size permutations... more Motivated by the Move-to-Front MTF coder's recency ranking utilization of small size permutations which are restricted to the data source's alphabet size, we i n vestigate compression of data les by using the canonical sorting permutations from the set of f0; : : : ; n g, where n is the size of a data source, followed by inversion coding. We show that the inversion coding ranking technique introduced yields better compression gain than the recency ranking MTF coder for almost all the test data les. Furthermore, we investigate replacement of MTF coder in the Block Sorting Schemes and show that when inversion coding is used after the BWT transformation, it yields better compression gains on average than the well-known block sorting techniques such a s Bzip, Bks98 and Szip-b.

Download

Block Sorting and Compression

Data Compression Conference, 1997

Download

Inversion Coding

The Computer Journal, 2004

Lossless EEG signal compression

International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, 2009

In this work, we investigate the lossless compression of EEG signals using Burrows-Wheeler Transf... more

<title>Lossless compression of images with permutation codes</title>

Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI, 2008

Images contain large amount of data and are used in many applications. Not only compressed image ... more Images contain large amount of data and are used in many applications. Not only compressed image data save space, but also in certain applications such as the World-Wide-Web (WWW), they save time since the amount of data to be transmitted is smaller than the original image. Codebook approaches have been used in lossy image compression. For example, vector quantization employs

Losless EEG signal compression

2012 Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

In this work, we study the lossless compression of EEG (electroencephalograph) signals using line... more In this work, we study the lossless compression of EEG (electroencephalograph) signals using linear prediction and arithmetic coder. We show that, when we separate the less significant bits of each signal, linear prediction techniques yield better prediction, and with a structured arithmetic coder not only our technique achieves better compression rates than other techniques reported previously, but also our technique is much faster than the others.

Lossless Compression of Dithered Images

IEEE Photonics Journal, 2013

In order to display high-bit resolution images on low-bit resolution displays, bit resolution nee... more In order to display high-bit resolution images on low-bit resolution displays, bit resolution needs to be reduced. This problem is vital especially for low-cost or small (mobile) devices. To untangle the bit reduction problem, special color quantization algorithms, called dithering, are employed on high-bit resolution images. The dithering process helps to remedy the problem, but it does not help much in terms of storage and transmission of images. To reduce storage needs and lower data transmission, numerous special compression techniques have been proposed in the last several decades. While the well-known compression algorithms, such as gzip, help lower image file sizes, usually, they are not adequate. To improve the compression gain, special compression techniques that take into account structure of image data must be developed. In this paper, we show that, when the pseudo-distance technique (PDT) is used for dithered images, it yields better compression results than GIF and PNG.

Download

Lossless compression of DNA Microarray images with Inversion Coder

2014 11th Annual High Capacity Optical Networks and Emerging/Enabling Technologies (Photonics for Energy), 2014

A new context-model for the pseudo-distance technique in lossless compression of color-mapped images

Applications of Digital Image Processing XXXV, 2012

ABSTRACT In this work, we propose a method that utilizes a new context model along with a pseudo-... more ABSTRACT In this work, we propose a method that utilizes a new context model along with a pseudo-distance technique in compression of color-mapped images. Graphic Interchange Format (GIF) and Portable Network Graphics (PNG) are two of the well-known and frequently used techniques for the compression of color-mapped images. There are several techniques that achieve better compression results than GIF and PNG; however, most of these techniques need two passes on the image data, while others do not run in linear time. The pseudo-distance technique runs in linear time and requires only one pass. We show that using the proposed context model along with the pseudo-distance technique yields better results than both PNG and GIF.

Parallel lossless compression of color-mapped images

2013 High Capacity Optical Networks and Emerging/Enabling Technologies, 2013

Scanning paths for lossless compression of pseudo-color images

2014 IEEE Western New York Image and Signal Processing Workshop (WNYISPW), 2014

Lossless compression of dithered images with the pseudo-distance technique

High Capacity Optical Networks and Emerging/Enabling Technologies, 2012

ABSTRACT Despite many advances, still image storage and transfer, particularly in low-cost device... more ABSTRACT Despite many advances, still image storage and transfer, particularly in low-cost devices, remain to be important problems. For example, some wireless phone displays do not have the capacity to handle true colors. To remedy this problem, a color quantization (color palette) technique is often applied to images in order to reduce the number of colors. However, to avoid the side effects of the color-quantization, usually a process called dithering is applied to quantized images. Dithering techniques approximate colors which are not available in the palette by utilizing a diffusion technique of colored pixels from within the available palette. In this work, we examine compression of color-quantized images with different dithering techniques and show that the recently introduced modified pseudo-distance technique yields better compression results than the wellknown GIF and PNG techniques.

Block-sorting transformations with pseudo-distance technique for lossless compression of color-mapped images

2011 Western New York Image Processing Workshop, 2011

Color-mapped images are widely used in many applications, especially in WWW, and are usually comp... more Color-mapped images are widely used in many applications, especially in WWW, and are usually compressed with Graphic Interchange Format (GIF) without any loss. In our recent work, we showed that further compression gains can be achieved for color-mapped images over GIF when a structured arithmetic coder is used along with the pseudo-distance metric, instead of a Huffman coder as suggested