Image Compression by Linear Splines over Adaptive Triangulation
Lin, Yan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/47042
Description
Title
Image Compression by Linear Splines over Adaptive Triangulation
Author(s)
Lin, Yan
Contributor(s)
Yu, Yizhou
Issue Date
2009-05
Keyword(s)
image compression
image compression algorithms
edge detection
Abstract
This paper implements a recently proposed method for image compression, and investigates possible improvements to the current algorithm. The method is based on the approximation of an image, regarded as a function, by a linear spline over an adapted triangulation, D(Y), which is the Delaunay triangulation of a small set Y of significant pixels. The linear spline minimizes the distance to the image, measured by the mean square error, among all linear splines over D(Y). The significant pixels in Y are selected by an adaptive thinning algorithm, which recursively removes less significant pixels in a greedy way, using a sophisticated criterion for measuring the significance of a pixel. This paper suggests using edge detection as a pre-processing step to the current algorithm, which can refine the starting set of significant pixels and speed up the process of selecting significant pixels. The proposed method is compared with the current established algorithm on several geometric images.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.