Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Geometry compression of normal meshes using rate-distortion algorithms
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ACM Transactions on Graphics (TOG)
Adaptive Multivariate Approximation Using Binary Space Partitions and Geometric Wavelets
SIAM Journal on Numerical Analysis
An efficient bit allocation for compressing normal meshes with an error-driven quantization
Computer Aided Geometric Design - Special issue: Geometry processing
Image compression by linear splines over adaptive triangulations
Signal Processing
Text detection in images using sparse representation with discriminative dictionaries
Image and Vision Computing
| Hi-index | 0.00 |
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.