DocumentCode
3316601
Title
An improved content-adaptive mesh-generation method for image representation
Author
Adams, Michael D.
Author_Institution
Dept. of Elec. & Comp. Eng., Univ. of Victoria, Victoria, BC, Canada
fYear
2010
fDate
26-29 Sept. 2010
Firstpage
873
Lastpage
876
Abstract
A new content-adaptive mesh-generation method for image representation, based on the greedy point-removal scheme of Demaret and Iske, is proposed. The proposed method is shown to be capable of producing meshes of higher quality than those generated by the scheme of Demaret and Iske, while requiring substantially less computation and memory. Furthermore, with the proposed method, one can easily tradeoff between mesh quality and computational/memory complexity as needed. Since a mesh-generation scheme proposed by Yang et al. is a key component of the proposed method, some factors affecting the performance of this scheme are also explored.
Keywords
computational complexity; greedy algorithms; image representation; mesh generation; computational complexity; content-adaptive mesh-generation; greedy point-removal scheme; image representation; memory complexity; mesh quality; Approximation methods; Complexity theory; Ground penetrating radar; Memory management; Mesh generation; PSNR; Smoothing methods; Image representations; error diffusion; greedy point removal; mesh generation; triangle meshes;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing (ICIP), 2010 17th IEEE International Conference on
Conference_Location
Hong Kong
ISSN
1522-4880
Print_ISBN
978-1-4244-7992-4
Electronic_ISBN
1522-4880
Type
conf
DOI
10.1109/ICIP.2010.5650466
Filename
5650466
Link To Document