Name
Abstract | ||
|---|---|---|
Edges provide semantically important image features. In this paper a lossy compression method for cartoon-like images is presented, which is based on edge information. Edges together with some adjacent grey/colour values are extracted and encoded using a classical edge detector, binary compression standards such as JBIG and state-of-the-art encoders such as PAQ. When decoding, information outside these encoded data is recovered by solving the Laplace equation, i.e. we inpaint with the steady state of a homogeneous diffusion process. For the discrete reconstruction problem, we prove existence and uniqueness and establish a maximum-minimum principle. Furthermore, we describe an efficient multigrid algorithm. The result is a simple codec that is able to encode and decode in real time. We show that for cartoon-like images this codec can outperform the JPEG standard and even its more advanced successor JPEG2000. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.patcog.2010.08.004 | Pattern Recognition |
Keywords | Field | DocType |
homogeneous diffusion,adjacent grey,jpeg standard,classical edge detector,edge information,binary compression standard,lossy compression method,edge-based compression,encoded data,cartoon-like image,laplace equation,simple codec,lossy compression,partial differential equation,diffusion process,real time,image compression,image features,steady state,multigrid | Theoretical computer science,Artificial intelligence,JPEG 2000,JBIG,Codec,Pattern recognition,Lossy compression,Algorithm,JPEG,Decoding methods,Data compression,Mathematics,Image compression | Journal |
Volume | Issue | ISSN |
44 | 9 | Pattern Recognition |
Citations | PageRank | References |
27 | 1.08 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Mainberger | 1 | 111 | 6.83 |
| Andrés Bruhn | 2 | 1558 | 82.42 |
| Joachim Weickert | 3 | 5489 | 391.03 |
| Søren Forchhammer | 4 | 406 | 53.36 |