Learn More
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies local and nonlocal processing of images, meshes, and more generally discrete data. The approach considers the problem as a variational one, which consists in minimizing a weighted sum of two energy terms: a regularization one that uses the discrete(More)
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variational one, which consists in minimizing a weighted sum of two energy terms: a regularization one that uses the discrete p-Laplace operator, and an approximation one. This formulation(More)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion(More)
We describe a system for taking a 2D sketch of a mirror-symmetric 3D shape and lifting the curves to 3D, inferring the symmetry relationship from the original hand-drawn curves. The system takes as input a hand-drawn sketch and generates a set of 3D curves such that their orthogonal projection matches the input sketch. The main contribution is a method(More)
A segmentation and model-reconstruction algorithm is proposed based on polynomial approximation and on a novel version of "region growing". First, an initial partition is calculated on the basis of differential-geometric properties of the range image. Then, the first merging procedure is applied ("merge with constraints") aiming at correctly identifying(More)
In this paper, we propose a new Multi-Objective Optimization (MOO) approach using the second version of non-dominated sorting genetic algorithm (NSGA-II) for Blind RGB color image watermarking. The design of an optimal watermarking for a given application always involves a tradeoff between imperceptibility requirement and robustness requirement. Therefore,(More)
In this paper, we develop a family of straight-line graphs which we call A-shape of a finite point set (A is an arbitrary point set). Derived from the Delaunay trian-gulation, this family captures the notion of shape hull of a finite point set. 1 Introduction This paper deals with the problem of computing the shape hull of a point set. Apparently, the fit(More)