Name
Abstract | ||
|---|---|---|
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided by local approximation error and its variance. The triangulation encodes the image, yielding compression rates comparable to or even superior to JPEG and JPEG2000 compression. The specific contributions of our paper are a speed-up of the simulated annealing optimization and a comparison of our approach to other image approximation and compression methods. Furthermore, we propose an adaptive vertex insertion/removal strategy and termination criteria for the simulated annealing to achieve specified approximation error bounds. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-76858-6_35 | ISVC (1) |
Keywords | Field | DocType |
local approximation error,adaptive vertex insertion,approximation error bound,data-dependent triangulations,compression method,simulated annealing,image approximation,high-quality data-dependent triangulation,image compression,compression rate,simulated annealing optimization,jpeg2000 compression,approximation error,probability distribution | Computer science,Discrete cosine transform,Probability distribution,Artificial intelligence,Simulated annealing,Mathematical optimization,Pattern recognition,Algorithm,Adaptive simulated annealing,Triangulation (social science),JPEG,Image compression,Approximation error | Conference |
Volume | ISSN | ISBN |
4841 | 0302-9743 | 3-540-76857-2 |
Citations | PageRank | References |
8 | 0.48 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Burkhard Lehner | 1 | 18 | 2.37 |
| Georg Umlauf | 2 | 134 | 16.86 |
| Bernd Hamann | 3 | 2283 | 206.78 |