Name
Abstract | ||
|---|---|---|
Recently the performance of nonlinear transforms have been given a lot of attention to overcome the suboptimal n-terms approximation power of tensor product wavelet methods on higher dimensions. The suboptimal performance prevails when the latter are used for a sparse representation of functions consisting of smoothly varying areas separated by smooth contours. This paper introduces a method creating normal meshes with nonsubdivision connectivity to approximate the nonsmoothness of such images efficiently. From a domain decomposition viewpoint, the method is a triangulation refinement method preserving contours. The transform is nonlinear as it depends on the actual image. This paper proposes an normal offset based compression algorithm for digital images. The discretisation causes the transform to become redundant. We further propose a model to encode the obtained coefficients. We show promising rate distortion curves and compare the results with the JPEG2000 encoder. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.imavis.2008.06.017 | Image Vision Comput. |
Keywords | Field | DocType |
piecewise smooth,compression algorithm,digital image,triangulation refinement method,suboptimal n-terms,image compression,normal mesh,approximation power,normal multiresolution mesh,jpeg2000 encoder,actual image,geometrical image compression,wavelets,tensor product wavelet method,suboptimal performance,domain decomposition,tensor product,sparse representation | Computer vision,Polygon mesh,Pattern recognition,Sparse approximation,Digital image,Triangulation (social science),Artificial intelligence,Data compression,Domain decomposition methods,Image compression,Mathematics,Wavelet | Journal |
Volume | Issue | ISSN |
27 | 4 | Image and Vision Computing |
Citations | PageRank | References |
2 | 0.43 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Van Aerschot | 1 | 2 | 0.43 |
| Maarten Jansen | 2 | 119 | 15.20 |
| A. Bultheel | 3 | 117 | 17.02 |