By Topic

Image compression via tritree decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Da Silva, V.C. ; Dept. de Engenharia Eletrica, Univ. Fed. da Paraiba, Joao Pessoa, Brazil ; De Carvalho, J.M.

The work presents a new method for image compression, using tritree decomposition (TT). TT was originally proposed by Wille (1992) for generation of non-structured finite element meshes for numerical solution of differential equation systems. TT decomposition is similar to quadtree decomposition (QT), which has been broadly used by image processing algorithms, mainly for segmentation and compression. However, while QT subdivides the image into progressively smaller quadratic regions, TT decomposition subdivides the image into triangular regions. The goal is to segment the image into a set of triangular homogeneous regions, where the differences among the pixel values don't exceed a certain threshold. A tree is built to represent the decomposition. Each triangle will be a node of the tree TT. The initial triangle, that contains the whole image, is the root of the tree. The final triangles, representing the compressed image, are the leaves of the tree. Reconstruction of the image is accomplished by planar interpolation among the vertices of each triangular leaf

Published in:

Computer Graphics and Image Processing, 2000. Proceedings XIII Brazilian Symposium on

Date of Conference: