Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive approximation of image data. This article first addresses selected computational aspects concerning image approximation on triangular meshes, before four recent image approximation algorithms, each relying on anisotropic triangulations, are discussed. The discussion includes generic triangulations obtained by simulated annealing, adaptive thinning on Delaunay triangulations, anisotropic geodesic triangulations, and greedy triangle bisections. Numerical examples are presented for illustration
International audienceFor any positive integer k, the (k+1)st-order tensor for the partial derivativ...
Second order elliptic partial differential equations arise in many important applications, including...
Dynamic surfaces arise in many applications, such as free surfaces in multiphase flows and moving in...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive pro...
Anisotropic triangulations provide efficient methods for sparse image representations. In previous w...
Abstract—Anisotropic triangulations provide efficient meth-ods for sparse image representations. In ...
Abstract—Triangular meshes have gained much interest in image representation and have been widely us...
We study the properties of a simple greedy algorithm introduced in [8] for the generation of data-ad...
It is well recognized today the importance of anisotropic meshes when it is solved a problem whose s...
International audienceA simple greedy refinement procedure for the generation of data-adapted triang...
Abstract. A new algorithm for approximating intensity images with adaptive triangular meshes keeping...
Changement dans la version 2 : compilé avec hyperref pour une meilleure consultation sur écran.Mesh ...
This paper presents an efficient algorithm for generat-ing adaptive triangular meshes from dense ran...
this paper we attempt to construct an anisotropic adaptive refinement algorithm that is modeled on t...
Abstract. Anisotropic triangulations provide efficient geometrical methods for sparse representation...
International audienceFor any positive integer k, the (k+1)st-order tensor for the partial derivativ...
Second order elliptic partial differential equations arise in many important applications, including...
Dynamic surfaces arise in many applications, such as free surfaces in multiphase flows and moving in...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive pro...
Anisotropic triangulations provide efficient methods for sparse image representations. In previous w...
Abstract—Anisotropic triangulations provide efficient meth-ods for sparse image representations. In ...
Abstract—Triangular meshes have gained much interest in image representation and have been widely us...
We study the properties of a simple greedy algorithm introduced in [8] for the generation of data-ad...
It is well recognized today the importance of anisotropic meshes when it is solved a problem whose s...
International audienceA simple greedy refinement procedure for the generation of data-adapted triang...
Abstract. A new algorithm for approximating intensity images with adaptive triangular meshes keeping...
Changement dans la version 2 : compilé avec hyperref pour une meilleure consultation sur écran.Mesh ...
This paper presents an efficient algorithm for generat-ing adaptive triangular meshes from dense ran...
this paper we attempt to construct an anisotropic adaptive refinement algorithm that is modeled on t...
Abstract. Anisotropic triangulations provide efficient geometrical methods for sparse representation...
International audienceFor any positive integer k, the (k+1)st-order tensor for the partial derivativ...
Second order elliptic partial differential equations arise in many important applications, including...
Dynamic surfaces arise in many applications, such as free surfaces in multiphase flows and moving in...