Add to ORKGAbstract — Locally optimal Delaunay triangulations are constructed to improve previous image approximation schemes. Our construction relies on a local optimization procedure, termed exchange. The efficient implementation of the exchange algorithm is addressed and its complexity is discussed. The good performance of our improved image approximation is illustrated by numerical comparisons
We describe a method to create optimal linear spline approximations to arbitrary functions of one or...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive pro...
Abstract. A new algorithm for approximating intensity images with adaptive triangular meshes keeping...
Locally optimal Delaunay triangulations are constructed to improve previous image approximation sche...
Abstract. Anisotropic triangulations provide efficient geometrical methods for sparse representation...
Anisotropic triangulations provide efficient methods for sparse image representations. In previous w...
Abstract—Anisotropic triangulations provide efficient meth-ods for sparse image representations. In ...
This paper proposes a new method for image compression. The method is based on the approximation of ...
Consider a triangulation of the xy plane, and a general surface z = f (xy). The points of the trian...
We study the properties of a simple greedy algorithm introduced in [8] for the generation of data-ad...
The purpose of this paper is to present an adaptive algorithm to find the best approximation in the ...
Abstract. We present a method to speed up the computation of a high-quality data-dependent triangula...
We describe the algorithms and data structures used for optimizing linear spline approximations of b...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive app...
We describe a method to create optimal linear spline approximations to arbitrary functions of one or...
We describe a method to create optimal linear spline approximations to arbitrary functions of one or...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive pro...
Abstract. A new algorithm for approximating intensity images with adaptive triangular meshes keeping...
Locally optimal Delaunay triangulations are constructed to improve previous image approximation sche...
Abstract. Anisotropic triangulations provide efficient geometrical methods for sparse representation...
Anisotropic triangulations provide efficient methods for sparse image representations. In previous w...
Abstract—Anisotropic triangulations provide efficient meth-ods for sparse image representations. In ...
This paper proposes a new method for image compression. The method is based on the approximation of ...
Consider a triangulation of the xy plane, and a general surface z = f (xy). The points of the trian...
We study the properties of a simple greedy algorithm introduced in [8] for the generation of data-ad...
The purpose of this paper is to present an adaptive algorithm to find the best approximation in the ...
Abstract. We present a method to speed up the computation of a high-quality data-dependent triangula...
We describe the algorithms and data structures used for optimizing linear spline approximations of b...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive app...
We describe a method to create optimal linear spline approximations to arbitrary functions of one or...
We describe a method to create optimal linear spline approximations to arbitrary functions of one or...
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive pro...
Abstract. A new algorithm for approximating intensity images with adaptive triangular meshes keeping...