# Lossy Image CompressionTree Triangular Coding Image Compression Algorithms

Lossy Image Compression: Tree Triangular Coding Image Compression Algorithms [This chapter presents four new image compression algorithms namely, Three-triangle decomposition scheme, Six-triangle decomposition scheme, Nine-triangle decomposition scheme and the Delaunay Triangulation Scheme. Performance of these algorithms is evaluated using standard test images. The asymptotic time complexity of Three-, Six-, and Nine-triangle decomposition algorithms is the same: O(nlogn) for coding and θ(n), for decoding. The time complexity of the Delaunay triangulation algorithm is O(n2logn) for coding and O(nlogn) for decoding, where n is the number of pixels in the image.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# Lossy Image CompressionTree Triangular Coding Image Compression Algorithms

Part of the SpringerBriefs in Computer Science Book Series
Lossy Image Compression — Aug 27, 2011
28 pages      /lp/springer-journals/lossy-image-compression-tree-triangular-coding-image-compression-heiH8ZYPZx
Publisher
Springer London
ISBN
978-1-4471-2217-3
Pages
13 –41
DOI
10.1007/978-1-4471-2218-0_2
Publisher site
See Chapter on Publisher Site

### Abstract

[This chapter presents four new image compression algorithms namely, Three-triangle decomposition scheme, Six-triangle decomposition scheme, Nine-triangle decomposition scheme and the Delaunay Triangulation Scheme. Performance of these algorithms is evaluated using standard test images. The asymptotic time complexity of Three-, Six-, and Nine-triangle decomposition algorithms is the same: O(nlogn) for coding and θ(n), for decoding. The time complexity of the Delaunay triangulation algorithm is O(n2logn) for coding and O(nlogn) for decoding, where n is the number of pixels in the image.]

Published: Aug 27, 2011

Keywords: Triangulation; Decomposition schemes; Delaunay triangulation; Algorithm complexity