Image compression by B-tree triangular coding

This paper describes an algorithm for still image compression called B-tree triangular coding (BTTC). The coding scheme is based on the recursive decomposition of the image domain into right-angled triangles arranged in a binary tree. The method is attractive because of its fast encoding, O(n log n)...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1997-09, Vol.45 (9), p.1095-1100
Main Authors: Distasi, R., Nappi, M., Vitulano, S.
Format: Article
Language:English
Subjects:
Biomedical imaging
Clocks
Communications Society
Image coding
Image processing
Interpolation
Pixel
Q factor
Testing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes an algorithm for still image compression called B-tree triangular coding (BTTC). The coding scheme is based on the recursive decomposition of the image domain into right-angled triangles arranged in a binary tree. The method is attractive because of its fast encoding, O(n log n), and decoding, /spl Theta/(n), where n is the number of pixels, and because it is easy to implement and to parallelize. Experimental studies indicate that BTTC produces images of satisfactory quality from a subjective and objective point of view, One advantage of BTTC over JPEG is its shorter execution time.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.623074