By Topic

Efficient content adaptive mesh representation of an image using binary space partitions and singular value 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
$33 $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

3 Author(s)
Michel Sarkis ; Technische Universität München, Institute for Data Processing, Arcisstr. 21, 80290, Munich, Germany ; Oliver Lorscheider ; Klaus Diepold

Content adaptive mesh generation is an important research area with many applications in image processing and computer vision. The main issue is to represent an image with the pixels that preserve most of the amount of its information. The obtained pixels are then used to generate a mesh that approximates the original image. This work presents a novel iterative method that simultaneously reduces the number of the pixels and generates the mesh approximation of an image. The main idea is to incorporate binary space partitions along with singular value decomposition to cluster the pixels into planes and thus the nodes of the mesh are nothing but the pixels that define each plane. Compared to previous techniques, the proposed method leads to a 30% reduction in the size of the approximating mesh. In addition, the method minimizes the artifacts obtained from the reconstruction of the original image from the approximating mesh.

Published in:

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

Date of Conference:

March 31 2008-April 4 2008