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(n 2 logn) for coding and O(nlogn) for decoding, where n is the number of pixels in the image.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Distasi R, Nappi M, Vitulano S (1997) Image compression by B-tree triangular coding. IEEE Trans Commun 45(9):1095–1100
Dimento LJ, Brekovich SY (1990) The compression effects of the binary tree overlapping method on digital imagery. IEEE Trans Commun 38:1260–1265
Radha H, Leonadi R, Vetterli M (1991) A multiresolution approach to binary tree representation of Images. Proc ICASSP 91:2653–2656
Strobach P (1989) Image coding based on quadtree–structured recursive least squares approximation. Proc IEEE ICAASP 89:1961–1964
Wu X (1992) Image coding by adaptive tree-structured segmentation. IEEE Trans Inf Theory 38(6):1755–1767
Davoine F, Svensson J, Chassery J-M (1995) A mixed triangular and quadrilateral partition for fractal image coding. In: Proceedings of the international conference on image processing (ICIP ‘95)
VC Da Silva, JM De Carvalho (2000) Image compression via TRITREE decomposition. In: Proceedings of the XIII Brazilian symposium on computer graphics and image processing (SIBGRAPI)
Li X, Knipe J, Cheng H (1997) Image compression and encryption using tree structures. Pattern Recogn Lett 18:1253–1259
Kotlov A (2001) Note: tree width and regular triangulations. Discret Math 237:187–191
Wu X, Fang Y (1995) A segmentation-based predictive multiresolution image coder. IEEE Trans Image Process 4:34–47
Radha H, Vetterli M, Leonardi R (1996) Image compression using binary space partitioning trees. IEEE Trans image process 5(12):1610–1623
Samet H (1984) The quadtree and related Hierarchical data structures. ACM Comput Surv 16(2):187–260
Babuska I, Aziz AK (1976) On the angle condition in the finite element method. Siam J Numer Anal 13(2):214–226
Rippa S (1992) Long and thin triangles can be good for linear interpolation. Siam J Numer Anal 29(1):257–270
Plaza A, Rivara M-C (2002) On the adjacencies of triangular meshes based on skeleton-regular partitions. J Comput Appl Math 140:673–693
Mitchell SA (1997) Approximating the maximum-angle covering triangulation. Comput Geom 7:93–111
Szelinski R (1990) Fast surface interpolation using hierarchical basis functions. IEEE Trans Pattern Anal Mach Intell 12:513–528
Vreelj B, Vaidyanathan PP (2001) Efficient implementation of all digital interpolation. IEEE Trans image process 10(11):1639–1646
Li J, Chen CS (2002) A simple efficient algorithm for interpolation between different grids in both 2D and 3D. Math Comput Sim 58:125–132
Chuah C-S, Leou J-J (2001) An adaptive image interpolation algorithm for image/video processing. Pattern Recogn 34:2383–2393
Boissonnant JD, Cazals F (2002) Smooth surface reconstruction via natural neighbour interpolation of distance functions. Comput Geom 22:185–203
Antonini M, Barlaud M, Mathieu P, Daubechies I (1992) Image coding using the wavelet transform. IEEE Trans Image Process 1(2):205–220
Vore BAD, Jawerth B, Lucien BJ (1992) Image compression through wavelet transform coding. IEEE Trans Inf Theory 38:719–746
Jacquin AE (1992) Image coding based on a fractal theory of iterated contractive image transformations. IEEE Trans Image Process 1:18–30
Helsingius M, Kuosmanen P, Astola J (2000) Image compression using multiple transforms. Signal Process Image Commun 15:513–529
Prasad MVNK, Mishra VN, Shukla KK (2003) Space partitioning based image compression using quality measures. Appl Soft Comput Elsevier Sci 3:273–282
Bramble JH, Zlamal M (1970) Triangular elements in the finite elements method. Math Comput 24(112):809–820
Waldron S (1998) The error in linear interpolation at the vertices of a simplex. Siam J Numer Anal 35:1191–1200
Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405
Guibas L, Stolfi J (1985) Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Trans Graph 4(2):74–123
Su P, Drysdale RLS (1995) A comparison of sequential delaunay triangulation algorithms, 1lth Symposium computational geometry, Vancouver, B.C. Canada, pp 61–70
Shewchuk JR (1999) Lecture notes on delaunay mesh generation. University of California, Berkeley, p 20
Letrattanapanich S, Bose NK (2002) High resolution image formation from low resolution frames using delaunay triangulation. IEEE Trans Image Process 11(12):1427–1441
Davoine F, Antonini M, Chassery J-M, Barlaud M (1996) Fractal image compression based on delaunay triangulation and vector quantization. IEEE Trans Image Process 5(2):338–346
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Shukla, K.K., Prasad, M.V. (2011). Tree Triangular Coding Image Compression Algorithms. In: Lossy Image Compression. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2218-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2218-0_2
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2217-3
Online ISBN: 978-1-4471-2218-0
eBook Packages: Computer ScienceComputer Science (R0)